Related papers: Limits of Latin squares

Left-invariant Lorentzian structures on the 2D solvable non-Abelian Lie group are studied. Sectional curvature, attainable sets, Lorentzian length maximizers, distance, spheres, and infinitesimal isometries are described.

We prove explicit bounds on the number of lattice points on or near a convex curve in terms of geometric invariants such as length, curvature, and affine arclength. In several of our results we obtain the best possible constants. Our…

In this note we introduce the concept of the trade space of a latin square. Computations using Sage and the GAP package Simplicial Homology are presented.

We prove rigorously the convergence of the Cahn-Larch\'e system, which is a Cahn-Hilliard system coupled with the system of linearized elasticity, to a modified Hele-Shaw problem as long as a classical solution of the latter system exists.…

We define a morphism based upon a Latin square that generalizes the Thue-Morse morphism. We prove that fixed points of this morphism are overlap-free sequences generalizing results of Allouche - Shallit and Frid.

Let $Q$ be an ideal (downward-closed set) in the lattice of linear subspaces of $(\mathbb F_q)^n$, ordered by inclusion. For $0 \le k \le n$, let $\mu_k(Q)$ denote the fraction of $k$-dimensional subspaces that belong to $Q$. We show that…

Using proof-theoretic methods in the style of proof mining, we give novel computationally effective limit theorems for the convergence of the Cesaro-means of certain sequences of random variables. These results are intimately related to…

In this paper, we propose a new interpretation of local limit theorems for univariate and multivariate distributions on lattices. We show that - given a local limit theorem in the standard sense - the distributions are approximated well by…

We investigate the lazy burning process for Latin squares by studying their associated hypergraphs. In lazy burning, a set of vertices in a hypergraph is initially burned, and that burning spreads to neighboring vertices over time via a…

We study the compactness problem for moduli spaces of holomorphic supercurves which, being motivated by supergeometry, are perturbed such as to allow for transversality. We give an explicit construction of limiting objects for sequences of…

Determining the number of embeddings of Laman graph frameworks is an open problem which corresponds to understanding the solutions of the resulting systems of equations. In this paper we investigate the bounds which can be obtained from the…

The goal of the paper is to lay the foundation for the qualitative analogue of the classical, quantitative sparse graph limit theory. In the first part of the paper we introduce the qualitative analogues of the Benjamini-Schramm and…

In this paper, we study a classical construction of lattices from number fields and obtain a series of new results about their minimum distance and other characteristics by introducing a new measure of algebraic numbers. In particular, we…

The chromatic number of a Latin square is the least number of partial transversals which cover its cells. This is just the chromatic number of its associated Latin square graph. Although Latin square graphs have been widely studied as…

The Lovasz theta function provides a lower bound for the chromatic number of finite graphs based on the solution of a semidefinite program. In this paper we generalize it so that it gives a lower bound for the measurable chromatic number of…

We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…

This article introduces and studies the tight approximation property, a property of algebraic varieties defined over the function field of a complex or real curve that refines the weak approximation property (and the known cohomological…

We find a compactification of the $\mathrm{SL}(3,\mathbb{R})$-Hitchin component by studying the degeneration of the Blaschke metrics on the associated equivariant affine spheres. In the process, we establish the closure in the space of…

We consider a regularized least squares problem, with regularization by structured sparsity-inducing norms, which extend the usual $\ell_1$ and the group lasso penalty, by allowing the subsets to overlap. Such regularizations lead to…

Sliced Latin hypercube designs (SLHDs) are widely used in computer experiments with both quantitative and qualitative factors and in batches. Optimal SLHDs achieve better space-filling property on the whole experimental region. However,…