Lower bound on the size of a quasirandom forcing set of permutations

DOI10.1017/S0963548321000298MaRDI QIDQ5886321zbMATH OpenOpenAlexFDO

Authors

Publication date 31 March 2023

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

combinatorial limitsquasirandomnessquasirandom permutationsquasirandomness forcing

Mathematics Subject Classification ID

Nonparametric hypothesis testing (62G10) Permutations, words, matrices (05A05)

Recommendations

• Quasirandom permutations are characterized by 4-point densities
• Characterization of quasirandom permutations by a pattern sum
• Quasirandom permutations
• Forcing quasirandomness with triangles
• Note on forcing pairs

Cites work

• scientific article; zbMATH DE number 4027516 (Why is no real title available?)
• A Non-Parametric Test of Independence
• A consistent test of independence based on a sign covariance related to Kendall's tau
• An approximate version of Sidorenko's conjecture
• Characterization of quasirandom permutations by a pattern sum
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Hypergraphs, quasi-randomness, and conditions for regularity
• Limits of permutation sequences
• No additional tournaments are quasirandom-forcing
• On measures of association and a related problem
• On the density of transitive tournaments
• On universality of graphs with uniformly distributed edges
• Pseudo-random hypergraphs
• Quasi-Random Set Systems
• Quasi-random graphs
• Quasi-random hypergraphs
• Quasi-random tournaments
• Quasirandom Groups
• Quasirandom permutations
• Quasirandom permutations are characterized by 4-point densities
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Tournament quasirandomness from local counting

Cited in

(7)

• Characterization of quasirandom permutations by a pattern sum
• scientific article; zbMATH DE number 7053339 (Why is no real title available?)
• Quasirandom-Forcing Orientations of Cycles
• Forcing generalised quasirandom graphs efficiently
• Forcing quasirandomness with triangles
• Density maximizers of layered permutations
• Quasirandom permutations are characterized by 4-point densities

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)