
arXiv: 2208.12712
Abstract The theory of limits of permutations leads to limit objects called permutons, which are certain Borel measures on the unit square. We prove that permutons avoiding a given permutation of order have a particularly simple structure. Namely, almost every fiber of the disintegration of the permuton (say, along the x‐axis) consists only of atoms, at most many, and this bound is sharp. We use this to give a simple proof of the “permutation removal lemma.”
Permutations, words, matrices, 05A05, permutons, permutations, FOS: Mathematics, Mathematics - Combinatorics, G.2.1, pattern-avoidance, Combinatorics (math.CO), removal lemma
Permutations, words, matrices, 05A05, permutons, permutations, FOS: Mathematics, Mathematics - Combinatorics, G.2.1, pattern-avoidance, Combinatorics (math.CO), removal lemma
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
