Characterization of quasirandom permutations by a pattern sum
From MaRDI portal
Publication:3386522
DOI10.1002/rsa.20956zbMath1454.05007arXiv1909.11027OpenAlexW3082325971MaRDI QIDQ3386522
Timothy F. N. Chan, Yanitsa Pehova, Maryam Sharifzadeh, Jonathan A. Noel, Jan Volec, Daniel Král'
Publication date: 5 January 2021
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.11027
Related Items (7)
Lower bound on the size of a quasirandom forcing set of permutations ⋮ Quasirandom-Forcing Orientations of Cycles ⋮ Natural quasirandomness properties ⋮ Quasirandom Latin squares ⋮ Independence of permutation limits at infinitely many scales ⋮ Density maximizers of layered permutations ⋮ No additional tournaments are quasirandom-forcing
Cites Work
- Unnamed Item
- On universality of graphs with uniformly distributed edges
- Quasi-random subsets of \(\mathbb{Z}_ n\)
- Hypergraphs, quasi-randomness, and conditions for regularity
- Pseudo-random hypergraphs
- Quasirandom permutations
- Limits of permutation sequences
- Tournament quasirandomness from local counting
- Quasirandom permutations are characterized by 4-point densities
- A consistent test of independence based on a sign covariance related to Kendall's tau
- Hypergraph regularity and the multidimensional Szemerédi theorem
- On measures of association and a related problem
- Quasi-random tournaments
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Quasi-random hypergraphs
- Quasirandom Groups
- Quasi-Random Set Systems
- On the Density of Transitive Tournaments
- Flag algebras
- A Non-Parametric Test of Independence
- Quasi-random graphs
This page was built for publication: Characterization of quasirandom permutations by a pattern sum
