Quasirandom permutations
From MaRDI portal
Publication:1826859
DOI10.1016/j.jcta.2004.01.006zbMath1043.60009arXivmath/0211001OpenAlexW2911324645MaRDI QIDQ1826859
Publication date: 6 August 2004
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0211001
Permutations, words, matrices (05A05) Combinatorial probability (60C05) Irregularities of distribution, discrepancy (11K38) Special sequences (11K31)
Related Items
Lower bound on the size of a quasirandom forcing set of permutations ⋮ Quasirandom permutations are characterized by 4-point densities ⋮ Patterns in random permutations ⋮ Quasirandom-Forcing Orientations of Cycles ⋮ Natural quasirandomness properties ⋮ Quasirandom Latin squares ⋮ Limit densities of patterns in permutation inflations ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ FORCING QUASIRANDOMNESS WITH TRIANGLES ⋮ On the maximum density of fixed strongly connected subtournaments ⋮ Limits of \(k\)-dimensional poset sequences ⋮ A note on permutation regularity ⋮ Testing permutation properties through subpermutations ⋮ A note on permutation regularity ⋮ Tournament quasirandomness from local counting ⋮ Quasi-random words and limits of word sequences ⋮ Characterization of quasirandom permutations by a pattern sum ⋮ Sturmian words and the permutation that orders fractional parts ⋮ A note on random k-dimensional posets ⋮ Quasirandom arithmetic permutations ⋮ No additional tournaments are quasirandom-forcing
Cites Work
- Unnamed Item
- Generating pseudo-random permutations and maximum flow algorithms
- Quasi-random subsets of \(\mathbb{Z}_ n\)
- The solution of a conjecture of Stanley and Wilf for all layered patterns
- The distributions of the entries of Young tableaux
- On the number of permutations avoiding a given pattern
- Well-Spaced Labelings of Points in Rectangular Grids
- On permutations containing no long arithmetic progressions
- Quasi-Monte Carlo methods and pseudo-random numbers
- Quasi-Random Set Systems
- Irregularities of distribution, VII
- Quasi-random graphs
- A new proof of Szemerédi's theorem
This page was built for publication: Quasirandom permutations