Quasirandom Latin squares

DOI10.1002/RSA.21060MaRDI QIDQ6076738zbMATH OpenOpenAlexFDO

Authors Jacob W. Cooper, Daniel Král', Ander Lamaison, S. Mohr

Publication date 17 October 2023

Published in Random Structures \& Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial limitLatin squareLatinonquasirandomness

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Random graphs (graph-theoretic aspects) (05C80)

Abstract: We prove a conjecture by Garbe et al. [arXiv:2010.07854] by showing that a Latin square is quasirandom if and only if the density of every 2x3 pattern is 1/720+o(1). This result is the best possible in the sense that 2x3 cannot be replaced with 2x2 or 1xN for any N.

Recommendations

• All-even Latin squares
• Substructures in Latin squares
• Hamilton transversals in random Latin squares
• The cycle structure of two rows in a random Latin square
• Most Latin squares have many subsquares

Cites work

• A consistent test of independence based on a sign covariance related to Kendall's tau
• A Non-Parametric Test of Independence
• Characterization of quasirandom permutations by a pattern sum
• Finitely forcible graphons
• scientific article; zbMATH DE number 4027516 (Why is no real title available?)
• Hypergraph regularity and the multidimensional Szemerédi theorem
• Hypergraphs, quasi-randomness, and conditions for regularity
• 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 graphs
• Quasi-random hypergraphs
• Quasi-Random Set Systems
• Quasi-random subsets of \(\mathbb{Z}_ n\)
• 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
• Weak regularity and finitely forcible graph limits

Cited in

(12)

• Random Latin square graphs
• Characterization of quasirandom permutations by a pattern sum
• Intercalates and discrepancy in random Latin squares
• Random Latin squares and 2-dimensional expanders
• Transversals in quasirandom latin squares
• Quasirandom-Forcing Orientations of Cycles
• The number of n-queens configurations
• Large deviations in random latin squares
• Theory of limits of sequences of Latin squares
• Forcing generalised quasirandom graphs efficiently
• Forcing generalized quasirandom graphs efficiently (extended abstract)
• Forcing quasirandomness in a regular tournament

This page was built for publication: Quasirandom Latin squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6076738)