Large deviation principle for random permutations
We derive a large deviation principle for random permutations induced by probability
measures of the unit square, called permutons. These permutations are called-random …
measures of the unit square, called permutons. These permutations are called-random …
Thresholds for patterns in random permutations
D Bevan, D Threlfall - arXiv preprint arXiv:2312.01182, 2023 - arxiv.org
We explore how the asymptotic structure of a random permutation of $[n] $ with $ m $
inversions evolves, as $ m $ increases, establishing thresholds for the appearance and …
inversions evolves, as $ m $ increases, establishing thresholds for the appearance and …
Permutations with few inversions are locally uniform
D Bevan - arXiv preprint arXiv:1908.07277, 2019 - arxiv.org
We prove that permutations with few inversions exhibit a local-global dichotomy in the
following sense. Suppose ${\boldsymbol\sigma} $ is a permutation chosen uniformly at …
following sense. Suppose ${\boldsymbol\sigma} $ is a permutation chosen uniformly at …
[HTML][HTML] The feasible regions for consecutive patterns of pattern-avoiding permutations
J Borga, R Penaguiao - Discrete Mathematics, 2023 - Elsevier
We study the feasible region for consecutive patterns of pattern-avoiding permutations. More
precisely, given a family C of permutations avoiding a fixed set of patterns, we consider the …
precisely, given a family C of permutations avoiding a fixed set of patterns, we consider the …
Thresholds for patterns in random permutations with a given number of inversions
D Bevan, D Threlfall - The Electronic Journal of Combinatorics, 2024 - combinatorics.org
We explore how the asymptotic structure of a random permutation of $[n] $ with $ m $
inversions evolves, as $ m $ increases, establishing thresholds for the appearance and …
inversions evolves, as $ m $ increases, establishing thresholds for the appearance and …
[PDF][PDF] The History of the Gothenburg–Reykjavık–Strathclyde Combinatorics Group
E Steingrımsson - ecajournal.kms-ks.org
1. Origins in Gothenburg Page 1 numerative ombinatorics pplications A Enumerative
Combinatorics and Applications ecajournal.haifa.ac.il ECA 3:1 (2023) Article #S1H1 https://doi.org/10.54550/ECA2023V3S1H1 …
Combinatorics and Applications ecajournal.haifa.ac.il ECA 3:1 (2023) Article #S1H1 https://doi.org/10.54550/ECA2023V3S1H1 …
[PDF][PDF] The feasible region of consecutive occurrences of permutations is a cycle polytope
J Borga - permutationpatterns.com
The feasible region clPk for classical patterns was first studied in [5] for some particular
families of patterns. Describing the region clPk in full generality is a hard (and probably out …
families of patterns. Describing the region clPk in full generality is a hard (and probably out …