Universal limits of substitution-closed permutation classes

F Bassino, M Bouvel, V Féray, L Gerin… - Journal of the …, 2020 - ems.press
Universal limits of substitution-closed permutation classes Page 1 DOI 10.4171/JEMS/993 J.
Eur. Math. Soc. 22, 3565–3639 © European Mathematical Society 2020 Frédérique Bassino …

Degree sequence of random permutation graphs

BB Bhattacharya, S Mukherjee - 2017 - projecteuclid.org
In this paper, we study the asymptotics of the degree sequence of permutation graphs
associated with a sequence of random permutations. The limiting finite-dimensional …

The feasible region for consecutive patterns of permutations is a cycle polytope

J Borga, R Penaguiao - Algebraic Combinatorics, 2020 - alco.centre-mersenne.org
We study proportions of consecutive occurrences of permutations of a given size.
Specifically, the limit of such proportions on large permutations forms a region, called …

Independence of permutation limits at infinitely many scales

D Bevan - Journal of Combinatorial Theory, Series A, 2022 - Elsevier
Independence of permutation limits at infinitely many scales - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …

The feasible region for consecutive patterns of permutations is a cycle polytope

J Borga, R Penaguiao - arXiv preprint arXiv:1910.02233, 2019 - arxiv.org
We study proportions of consecutive occurrences of permutations of a given size.
Specifically, the limit of such proportions on large permutations forms a region, called\emph …

The dimension of the region of feasible tournament profiles

D Kral, A Lamaison, M Prorok, X Shu - arXiv preprint arXiv:2310.19482, 2023 - arxiv.org
Erd\H os, Lov\'asz and Spencer showed in the late 1970s that the dimension of the region of
$ k $-vertex graph profiles, ie, the region of feasible densities of $ k $-vertex graphs in large …

Weak regularity and finitely forcible graph limits

J Cooper, T Kaiser, D Král, J Noel - Transactions of the American …, 2018 - ams.org
Graphons are analytic objects representing limits of convergent sequences of graphs.
Lovász and Szegedy conjectured that every finitely forcible graphon, ie, any graphon …

The dimension of the feasible region of pattern densities

F Garbe, A MALEKSHAHIAN… - … Proceedings of the …, 2023 - cambridge.org
A classical result of Erdős, Lovász and Spencer from the late 1970s asserts that the
dimension of the feasible region of densities of graphs with at most k vertices in large graphs …

Large-scale Rook Placements

P Jiradilok - arXiv preprint arXiv:2204.00615, 2022 - arxiv.org
For each certain" nice" piecewise linear function $ f:[0, 1]\to [0, 1] $, we consider a family of
growing Young diagrams $\{\lambda (f, N)\} _ {N= 1}^{\infty} $ by enlarging the region under …

[PDF][PDF] The dimension of the feasible region of pattern densities

R Penaguiao - arXiv preprint arXiv:2309.10203, 2023 - raulpenaguiao.github.io
A classical result of Erdos, Lovász and Spencer from the late 1970s asserts that the
dimension of the feasible region of densities of graphs with at most k vertices in large graphs …