Substructures in Latin squares

DOI10.1007/s11856-023-2513-9zbMath1522.05021arXiv2202.05088MaRDI QIDQ6050265

Ashwin Sah, Matthew Kwan, Mehtaab Sawhney, Michael Simkin

Publication date: 12 October 2023

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

random Latin squareshigh-girth Steiner triple systems

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Triple systems (05B07)

Related Items (1)

ON THE NUMBER OF QUADRATIC ORTHOMORPHISMS THAT PRODUCE MAXIMALLY NONASSOCIATIVE QUASIGROUPS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An upper bound on the number of high-dimensional permutations
• Subsquare-free Latin squares of odd order
• 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
• 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
• Fractional triangle decompositions of dense 3-partite graphs
• Counting designs
• Maximally nonassociative quasigroups via quadratic orthomorphisms
• Upper tails via high moments and entropic stability
• Maximal nonassociativity via fields
• Partial associativity and rough approximate groups
• On a conjecture of Erdős on locally sparse Steiner triple systems
• Clique decompositions of multipartite graphs and completion of Latin squares
• Bounds on the number of small Latin subsquares
• Discrepancy of high-dimensional permutations
• Completions of ε-Dense Partial Latin Squares
• Almost all Steiner triple systems have perfect matchings
• The cycle structure of two rows in a random Latin square
• Shadows of colored complexes.
• Generating uniformly distributed random latin squares
• The infamous upper tail
• Intercalates and discrepancy in random Latin squares
• Monotone Subsequences in High-Dimensional Permutations
• Minimalist designs
• Almost all Steiner triple systems are almost resolvable
• Large girth approximate Steiner triple systems
• Fractional Clique Decompositions of Dense Partite Graphs
• Asymptotic enumeration of Latin rectangles
• Large deviations in random latin squares
• Threshold for Steiner triple systems

This page was built for publication: Substructures in Latin squares