Počet záznamů: 1
On pattern-avoiding permutons
- 1.0582637 - ÚI 2025 US eng J - Článek v odborném periodiku
Garbe, F. - Hladký, Jan - Kun, G. - Pekárková, K.
On pattern-avoiding permutons.
Random Structures and Algorithms. Online January 2024 (2024). ISSN 1042-9832. E-ISSN 1098-2418
Grant CEP: GA ČR(CZ) GX21-21762X
Institucionální podpora: RVO:67985807
Klíčová slova: pattern-avoidance * permutations * permutons * removal lemma
Impakt faktor: 1, rok: 2022
Způsob publikování: Omezený přístup
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 k 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 (k-1) many, and this bound is sharp. We use this to give a simple proof of the “permutation removal lemma.”
Trvalý link: https://hdl.handle.net/11104/0350714
Počet záznamů: 1