• Corpus ID: 119139626

Limits of permutation sequences through permutation regularity

  title={Limits of permutation sequences through permutation regularity},
  author={Carlos Hoppen and Yoshiharu Kohayakawa and Carlos Gustavo Moreira and Rudini Menezes Sampaio},
  journal={arXiv: Combinatorics},
A permutation sequence $(\sigma_n)_{n \in \mathbb{N}}$ is said to be convergent if, for every fixed permutation $\tau$, the density of occurrences of $\tau$ in the elements of the sequence converges. We prove that such a convergent sequence has a natural limit object, namely a Lebesgue measurable function $Z:[0,1]^2 \to [0,1]$ with the additional properties that, for every fixed $x \in [0,1]$, the restriction $Z(x,\cdot)$ is a cumulative distribution function and, for every $y \in [0,1]$, the… 


Let $L$ be a countable language. We say that a countable infinite $L$ -structure ${\mathcal{M}}$ admits an invariant measure when there is a probability measure on the space of $L$ -structures with

Weak regularity and finitely forcible graph limits

A finitely forcible graphon is constructed such that the number of parts in any weak $\varepsilon$-regular partition of $W$ is at least exponential in $\vrepsilon^{-2}/2^{5\log^*\varePSilon^-2}}$.

Theory of limits of sequences of Latin squares

We build up a limit theory for sequences of Latin squares, which parallels the theory of limits of dense graph sequences. Our limit objects, which we call Latinons, are certain two variable functions

Quasirandom permutations are characterized by 4-point densities

For permutations $${\pi}$$ and $${\tau}$$ of lengths $${|\pi|\le|\tau|}$$ , let $${t(\pi,\tau)}$$ be the probability that the restriction of $${\tau}$$ to a random $${|\pi|}$$ -point set is (order)

Characterization of quasirandom permutations by a pattern sum

It is shown that there is a set S of 4-point permutations such that the sum of the pattern densities of the permutation from S in the permutations Pi_i converges to |S|/24 if and only if the sequence is quasirandom.

On the growth of permutation classes

It is proved that, asymptotically, patterns in Łukasiewicz paths exhibit a concentrated Gaussian distribution, and a new enumeration technique is introduced, based on associating a graph with each permutation, and the generating functions for some previously unenumerated classes are determined.

Density maximizers of layered permutations

A permutation is layered if it contains neither 231 nor 312 as a pattern. It is known that, if σ is a layered permutation, then the density of σ in a permutation of order n is maximized by a layered

Testing permutation properties through subpermutations

Limits of structures and the example of tree semi-lattices



Limits of permutation sequences

A note on permutation regularity

Recurrence of Distributional Limits of Finite Planar Graphs

Suppose that $G_j$ is a sequence of finite connected planar graphs, and in each $G_j$ a special vertex, called the root, is chosen randomly-uniformly. We introduce the notion of a distributional

Testing permutation properties through subpermutations

A Permutation Regularity Lemma

  • J. Cooper
  • Mathematics, Computer Science
    Electron. J. Comb.
  • 2006
A permutation analogue of the celebrated Szemeredi Regularity Lemma is introduced, and it is shown how one can count sub-patterns of a permutation with an integral, and relate the results to permutation quasirandomness in a manner analogous to the graph-theoretic setting.

Convergent Sequences of Dense Graphs II. Multiway Cuts and Statistical Physics

We consider sequences of graphs (Gn) and dene various notions of convergence related to these sequences including \left-convergence," dened in terms of the densities of homomorphisms from small

Quick Approximation to Matrices and Applications

The matrix approximation is generalized to multi-dimensional arrays and from that derive approximation algorithms for all dense Max-SNP problems and the Regularity Lemma is derived.

Generalized quasirandom graphs

Very large graphs

Relations with probability, algebra, extrema graph theory, and analysis are surveyed, finding more complete theoretical results for dense networks than for sparse networks.