Quasirandom permutations are characterized by 4-point densities

DOI10.1007/s00039-013-0216-9zbMath1268.05006arXiv1205.3074OpenAlexW2127355117WikidataQ57601362 ScholiaQ57601362MaRDI QIDQ2375768

Daniel Král', Oleg Pikhurko

Publication date: 25 June 2013

Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.3074

zbMATH Keywords

permutationsgraph sequencesquasirandomnessdensity of subgraphspermutation limitssubpermutation density

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Permutations, words, matrices (05A05) Density (toughness, etc.) (05C42)

Related Items (24)

Lower bound on the size of a quasirandom forcing set of permutations ⋮ First order convergence of matroids ⋮ Densities in large permutations and parameter testing ⋮ Patterns in random permutations ⋮ Quasirandom-Forcing Orientations of Cycles ⋮ Natural quasirandomness properties ⋮ Quasirandom Latin squares ⋮ The number of \(n\)-queens configurations ⋮ Locally uniform random permutations with large increasing subsequences ⋮ Finitely forcible graphons and permutons ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On the maximum density of fixed strongly connected subtournaments ⋮ Limits of \(k\)-dimensional poset sequences ⋮ Tournament quasirandomness from local counting ⋮ Quasi-random words and limits of word sequences ⋮ Characterization of quasirandom permutations by a pattern sum ⋮ Decomposing Graphs into Edges and Triangles ⋮ Independence of permutation limits at infinitely many scales ⋮ Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits ⋮ Weak regularity and finitely forcible graph limits ⋮ Compactness and finite forcibility of graphons ⋮ Inducibility of directed paths ⋮ Density maximizers of layered permutations ⋮ No additional tournaments are quasirandom-forcing

Cites Work

• Unnamed Item
• Testing permutation properties through subpermutations
• Limits of dense graph sequences
• On universality of graphs with uniformly distributed edges
• Quasi-random subsets of \(\mathbb{Z}_ n\)
• Hypergraphs, quasi-randomness, and conditions for regularity
• The distributions of the entries of Young tableaux
• Pseudo-random hypergraphs
• Quasirandom permutations
• Limits of permutation sequences
• Finitely forcible graphons
• Generalized quasirandom graphs
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Quasi-random tournaments
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Quasi-random hypergraphs
• Quasirandom Groups
• Quasi-Random Set Systems
• Flag algebras
• Quasi-random graphs

This page was built for publication: Quasirandom permutations are characterized by 4-point densities