Related papers: Large deviations in random Latin squares

We use a greedy probabilistic method to prove that for every $\epsilon > 0$, every $m\times n$ Latin rectangle on $n$ symbols has an orthogonal mate, where $m=(1-\epsilon)n$. That is, we show the existence of a second Latin rectangle such…

We show that the threshold for the binomial random $3$-partite, $3$-uniform hypergraph $G^{3}((n,n,n),p)$ to contain a Latin square is $\Theta(\log{n}/n)$. We also prove analogous results for Steiner triple systems and proper list…

To any $n \times n$ Latin square $L$, we may associate a unique sequence of mutually orthogonal permutation matrices $P = P_1, P_2, ..., P_n$ such that $L = L(P) = \sum kP_k$. Brualdi and Dahl (2018) described a generalisation of a Latin…

Let $O(2n+\ell)$ be the group of orthogonal matrices of size $\left(2n+\ell\right)\times \left(2n+\ell\right)$ equipped with the probability distribution given by normalized Haar measure. We study the probability \begin{equation*}…

Latin squares are $n\times n$ matrices containing $n$ symbols, where each symbol appears exactly once in each row and column. They were studied by Euler, later popularized through Sudoku, and remain a rich source of difficult combinatorial…

The Bruhat order on permutation matrices extends to alternating sign matrices via corner-sum matrices, where the order is given by entrywise domination. A classical result of Lascoux and Sch\"utzenberger states that alternating sign…

For integer partitions $\lambda :n=a_1+...+a_k$, where $a_1\ge a_2\ge >...\ge a_k\ge 1$, we study the sum $a_1+a_3+...$ of the parts of odd index. We show that the average of this sum, over all partitions $\lambda$ of $n$, is of the form…

Given an integer partition $(h_1,h_2,\dots,h_k)$ of $n$, is it possible to find an order $n$ latin square with $k$ disjoint subsquares of orders $h_1,\dots,h_k$? This question was posed by L.Fuchs and is only partially solved. Existence has…

We consider several old problems involving the number of prime divisors function $\omega(n)$, as well as the related functions $\Omega(n)$ and $\tau(n)$. Firstly, we show that there are infinitely many positive integers $n$ such that…

Similar to how standard Young tableaux represent paths in the Young lattice, Latin rectangles may be use to enumerate paths in the poset of semi-magic squares with entries zero or one. The symmetries associated to determinant preserve this…

On the set of positive integers, we consider the iterative process that maps $n$ to either $\frac{3n+1}{2}$ or $\frac{n}{2}$ depending on the parity of $n$. The Collatz conjecture states that all such sequences eventually enter the trivial…

Mitra et al. [Phys. Rev. E 99 (2019) 012117] proposed a new percolation model that includes distortion in the square lattice and concluded that it may belong to the same universality class as the ordinary percolation. But the conclusion is…

We consider the problem of constructing Latin cubes subject to the condition that some symbols may not appear in certain cells. We prove that there is a constant $\gamma > 0$ such that if $n=2^k$ and $A$ is $3$-dimensional $n\times n\times…

We study the distribution of squares in a Piatetski-Shapiro sequence $\left(\lfloor n^c\rfloor\right)_{n\in\mathbb N}$ with $c>1$ and $c\not\in\mathbb N$. We also study more general equations $\lfloor{n^c}\rfloor = sm^2$, $n,m\in \mathbb…

Consider the Birkhoff polytope of n by n doubly-stochastic matrices. As the Birkhoff-von Neumann theorem famously states, its vertex set coincides with the set of all n by n permutation matrices. Here we seek a higher-dimensional analog of…

Percolation models with multiple percolating clusters have attracted much attention in recent years. Here we use Monte Carlo simulations to study bond percolation on $L_{1}\times L_{2}$ planar random lattices, duals of random lattices, and…

We study least squares linear regression over $N$ uncorrelated Gaussian features that are selected in order of decreasing variance. When the number of selected features $p$ is at most the sample size $n$, the estimator under consideration…

In 2009, Grant, Shallit, and Stoll constructed a large family of pseudorandom sequences, called generalized Rudin--Shapiro sequences, for which they established some results about the average of discrete correlation coefficients of order 2…

To get another from a given latin square, we have to change at least 4 entries. We show how to find these entries and how to change them.

It was proven in [B.-Y. Chen, F. Dillen, J. Van der Veken and L. Vrancken, Curvature inequalities for Lagrangian submanifolds: the final solution, Differ. Geom. Appl. 31 (2013), 808-819] that every Lagrangian submanifold $M$ of a complex…