Lower bound on the size of a quasirandom forcing set of permutations
From MaRDI portal
Publication:5886321
DOI10.1017/S0963548321000298OpenAlexW3183382846MaRDI QIDQ5886321FDOQ5886321
Author name not available (Why is that?)
Publication date: 31 March 2023
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.09434
Recommendations
Cites Work
- Limits of permutation sequences
- A consistent test of independence based on a sign covariance related to Kendall's tau
- A Non-Parametric Test of Independence
- On measures of association and a related problem
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Title not available (Why is that?)
- Quasi-random graphs
- On universality of graphs with uniformly distributed edges
- Quasi-random hypergraphs
- Quasirandom Groups
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Hypergraphs, quasi-randomness, and conditions for regularity
- Quasirandom permutations are characterized by 4-point densities
- Quasi-Random Set Systems
- An approximate version of Sidorenko's conjecture
- Quasirandom permutations
- Quasi-random tournaments
- On the Density of Transitive Tournaments
- Pseudo-random hypergraphs
- Characterization of quasirandom permutations by a pattern sum
- Tournament quasirandomness from local counting
- No additional tournaments are quasirandom-forcing
Cited In (4)
This page was built for publication: Lower bound on the size of a quasirandom forcing set of permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886321)
