On pattern-avoiding permutons

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\ k \ have a particularly simple structure. Namely, almost every fiber of the disintegration of the permut...

Full description

Saved in:
Bibliographic Details
Main Authors: Garbe, Frederik (Author) , Hladký, Jan (Author) , Kun, Gábor (Author) , Pekárková, Kristýna (Author)
Format: Article (Journal)
Language:English
Published: 29 January 2024
In: Random structures & algorithms
Year: 2024, Volume: 65, Issue: 1, Pages: 46-60
ISSN:1098-2418
DOI:10.1002/rsa.21208
Online Access:Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1002/rsa.21208
Verlag, lizenzpflichtig, Volltext: https://onlinelibrary.wiley.com/doi/abs/10.1002/rsa.21208
Get full text
Author Notes:Frederik Garbe, Jan Hladký, Gábor Kun, Kristýna Pekárková

MARC

LEADER 00000caa a2200000 c 4500
001 1909333115
003 DE-627
005 20241205222115.0
007 cr uuu---uuuuu
008 241121s2024 xx |||||o 00| ||eng c
024 7 |a 10.1002/rsa.21208  |2 doi 
035 |a (DE-627)1909333115 
035 |a (DE-599)KXP1909333115 
035 |a (OCoLC)1475647863 
040 |a DE-627  |b ger  |c DE-627  |e rda 
041 |a eng 
084 |a 28  |2 sdnb 
100 1 |a Garbe, Frederik  |e VerfasserIn  |0 (DE-588)1348929871  |0 (DE-627)1909336661  |4 aut 
245 1 0 |a On pattern-avoiding permutons  |c Frederik Garbe, Jan Hladký, Gábor Kun, Kristýna Pekárková 
264 1 |c 29 January 2024 
300 |a 15 
336 |a Text  |b txt  |2 rdacontent 
337 |a Computermedien  |b c  |2 rdamedia 
338 |a Online-Ressource  |b cr  |2 rdacarrier 
500 |a Gesehen am 21.11.2024 
520 |a 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\ 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)\ łeft(k-1\right) \ many, and this bound is sharp. We use this to give a simple proof of the “permutation removal lemma.” 
650 4 |a pattern-avoidance 
650 4 |a permutations 
650 4 |a permutons 
650 4 |a removal lemma 
700 1 |a Hladký, Jan  |d 1934-  |e VerfasserIn  |0 (DE-588)131880322  |0 (DE-627)515960004  |0 (DE-576)298812304  |4 aut 
700 1 |a Kun, Gábor  |d 1973-  |e VerfasserIn  |0 (DE-588)123016126  |0 (DE-627)082296006  |0 (DE-576)29352145X  |4 aut 
700 1 |a Pekárková, Kristýna  |e VerfasserIn  |4 aut 
773 0 8 |i Enthalten in  |t Random structures & algorithms  |d New York, NY [u.a.] : Wiley, 1990  |g 65(2024), 1, Seite 46-60  |h Online-Ressource  |w (DE-627)306711141  |w (DE-600)1500812-5  |w (DE-576)082436185  |x 1098-2418  |7 nnas  |a On pattern-avoiding permutons 
773 1 8 |g volume:65  |g year:2024  |g number:1  |g pages:46-60  |g extent:15  |a On pattern-avoiding permutons 
856 4 0 |u https://doi.org/10.1002/rsa.21208  |x Verlag  |x Resolving-System  |z lizenzpflichtig  |3 Volltext 
856 4 0 |u https://onlinelibrary.wiley.com/doi/abs/10.1002/rsa.21208  |x Verlag  |z lizenzpflichtig  |3 Volltext 
951 |a AR 
992 |a 20241121 
993 |a Article 
994 |a 2024 
998 |g 1348929871  |a Garbe, Frederik  |m 1348929871:Garbe, Frederik  |d 110000  |d 110300  |e 110000PG1348929871  |e 110300PG1348929871  |k 0/110000/  |k 1/110000/110300/  |p 1  |x j 
999 |a KXP-PPN1909333115  |e 4620528447 
BIB |a Y 
SER |a journal 
JSO |a {"title":[{"title":"On pattern-avoiding permutons","title_sort":"On pattern-avoiding permutons"}],"person":[{"given":"Frederik","family":"Garbe","role":"aut","display":"Garbe, Frederik","roleDisplay":"VerfasserIn"},{"family":"Hladký","given":"Jan","roleDisplay":"VerfasserIn","display":"Hladký, Jan","role":"aut"},{"given":"Gábor","family":"Kun","role":"aut","display":"Kun, Gábor","roleDisplay":"VerfasserIn"},{"given":"Kristýna","family":"Pekárková","role":"aut","display":"Pekárková, Kristýna","roleDisplay":"VerfasserIn"}],"type":{"bibl":"article-journal","media":"Online-Ressource"},"note":["Gesehen am 21.11.2024"],"recId":"1909333115","language":["eng"],"origin":[{"dateIssuedDisp":"29 January 2024","dateIssuedKey":"2024"}],"id":{"doi":["10.1002/rsa.21208"],"eki":["1909333115"]},"name":{"displayForm":["Frederik Garbe, Jan Hladký, Gábor Kun, Kristýna Pekárková"]},"physDesc":[{"extent":"15 S."}],"relHost":[{"language":["eng"],"recId":"306711141","type":{"media":"Online-Ressource","bibl":"periodical"},"disp":"On pattern-avoiding permutonsRandom structures & algorithms","note":["Gesehen am 17.02.05"],"titleAlt":[{"title":"Random structures and algorithms"}],"part":{"volume":"65","text":"65(2024), 1, Seite 46-60","extent":"15","year":"2024","pages":"46-60","issue":"1"},"pubHistory":["1.1990 -"],"title":[{"title_sort":"Random structures & algorithms","title":"Random structures & algorithms"}],"physDesc":[{"extent":"Online-Ressource"}],"id":{"issn":["1098-2418"],"zdb":["1500812-5"],"doi":["10.1002/(ISSN)1098-2418"],"eki":["306711141"]},"origin":[{"publisherPlace":"New York, NY [u.a.]","dateIssuedDisp":"1990-","dateIssuedKey":"1990","publisher":"Wiley"}]}]} 
SRT |a GARBEFREDEONPATTERNA2920