# Limits of Latin squares.

@article{Garbe2020LimitsOL, title={Limits of Latin squares.}, author={Frederik Garbe and Robert Hancock and Jan Hladk'y and Maryam Sharifzadeh}, journal={arXiv: Combinatorics}, year={2020} }

We develop a limit theory of Latin squares, paralleling the recent limit theories of dense graphs and permutations. We introduce a notion of density, an appropriate version of the cut distance, and a space of limit objects - so-called Latinons. Key results of our theory are the compactness of the limit space and the equivalence of the topologies induced by the cut distance and the left-convergence. Last, using Keevash's recent results on combinatorial designs, we prove that each Latinon can be…

## Figures from this paper

## 4 Citations

A Removal Lemma for Ordered Hypergraphs

- Mathematics
- 2021

We prove a removal lemma for induced ordered hypergraphs, simultaneously generalizing Alon–Ben-Eliezer–Fischer’s removal lemma for ordered graphs and the induced hypergraph removal lemma. That is, we…

Ordered Graph Limits and Their Applications

- Mathematics, Computer ScienceITCS
- 2021

An ordered analogue of the well-known result by Alon and Stav on the furthest graph from a hereditary property is proved, the first known result of this type in the ordered setting, and an alternative analytic proof of the ordered graph removal lemma is described.

Quasirandom Latin squares

- MathematicsRandom Structures & Algorithms
- 2021

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…

Natural quasirandomness properties

- Mathematics, Computer Science
- 2020

This paper proposes three new hierarchies of quasirandomness properties that can be naturally defined for arbitrary combinatorial objects and proves several implications and separations comparing them to each other and to what has been known for hypergraphs.

## References

SHOWING 1-10 OF 56 REFERENCES

Theory of limits of sequences of Latin squares

- Mathematics
- 2019

We build up a limit theory for sequences of Latin squares, which parallels the theory of limits of dense graph sequences. Our limit objects, which we call Latinons, are certain two variable functions…

The existence of designs II

- Mathematics
- 2018

We generalise the existence of combinatorial designs to the setting of subset sums in lattices with coordinates indexed by labelled faces of simplicial complexes. This general framework includes the…

Regularity Partitions and The Topology of Graphons

- Mathematics, Computer Science
- 2010

It is proved that if a graphon has an excluded induced sub-bigraph then the underlying metric space is compact and has finite packing dimension, which implies that such graphons have regularity partitions of polynomial size.

Recurrence of Distributional Limits of Finite Planar Graphs

- Mathematics
- 2000

Suppose that $G_j$ is a sequence of finite connected planar graphs, and in each $G_j$ a special vertex, called the root, is chosen randomly-uniformly. We introduce the notion of a distributional…

Ordered Graph Limits and Their Applications

- Mathematics, Computer ScienceITCS
- 2021

An ordered analogue of the well-known result by Alon and Stav on the furthest graph from a hereditary property is proved, the first known result of this type in the ordered setting, and an alternative analytic proof of the ordered graph removal lemma is described.

Quasi-Random Oriented Graphs

- MathematicsJ. Graph Theory
- 2013

The main theorem extends to the case of a general underlying graph G, the main result of [3] which corresponds to the Case that G is complete, and shows that a number of conditions on oriented graphs are equivalent.

An $L^p$ theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions

- Mathematics, Computer ScienceTransactions of the American Mathematical Society
- 2019

A theory of limits for sequences of sparse graphs based on graphons is introduced, which generalizes both the existing $L^\infty$ theory of dense graph limits and its extension by Bollob\'as and Riordan to sparse graphs without dense spots.

Flag algebras

- MathematicsJournal of Symbolic Logic
- 2007

The first application of a formal calculus that captures many standard arguments in the area of asymptotic extremal combinatorics is given by presenting a new simple proof of a result by Fisher about the minimal possible density of triangles in a graph with given edge density.