Large deviations in random latin squares

DOI10.1112/blms.12638zbMath1522.05020arXiv2106.11932OpenAlexW3175138403WikidataQ113270015 ScholiaQ113270015MaRDI QIDQ6133414

Ashwin Sah, Matthew Kwan, Mehtaab Sawhney

Publication date: 18 August 2023

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

Latin squaresLatin rectangleintercalate3-partite 3-uniform hypergraphs

Mathematics Subject Classification ID

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

Related Items (4)

Substructures in Latin squares ⋮ Cycles of quadratic Latin squares and antiperfect 1‐factorisations ⋮ Row‐Hamiltonian Latin squares and Falconer varieties ⋮ Threshold for Steiner triple systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An upper bound on the number of high-dimensional permutations
• Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
• The solution of van der Waerden's problem for permanents
• Almost all quasigroups have rank 2
• On tail probabilities for martingales
• On certain constructions for latin squares with no latin subsquares of order two
• Most Latin squares have many subsquares
• Mappings of Latin squares
• Counting designs
• All-even Latin squares
• Upper tails via high moments and entropic stability
• Large deviations of subgraph counts for sparse Erdős-Rényi graphs
• Nonlinear large deviation bounds with applications to Wigner matrices and sparse Erdős-Rényi graphs
• Random triangle removal
• Upper tails and independence polynomials in random graphs
• Bounds on the number of small Latin subsquares
• The Littlewood-Offord problem and invertibility of random matrices
• The deletion method for upper tail estimates
• On the number of Latin squares
• Discrepancy of high-dimensional permutations
• The missing log in large deviations for triangle counts
• Upper tails for triangles
• Almost all Steiner triple systems have perfect matchings
• The cycle structure of two rows in a random Latin square
• Almost All Steiner Triple Systems Are Asymmetric
• Generating uniformly distributed random latin squares
• The infamous upper tail
• Intercalates and discrepancy in random Latin squares
• Monotone Subsequences in High-Dimensional Permutations
• Threshold Functions for Ramsey Properties
• Minimalist designs
• HYPERGRAPH MATCHINGS AND DESIGNS
• Almost all Steiner triple systems are almost resolvable
• The chromatic number of random graphs
• Asymptotic enumeration of Latin rectangles
• Upper tail for homomorphism counts in constrained sparse random graphs

This page was built for publication: Large deviations in random latin squares