English
Related papers

Related papers: Discrepancy of High-Dimensional Permutations

200 papers

In this paper we use counting arguments to prove that the expected percentage coverage of a $d$ dimensional parameter space of size $n$ when performing $k$ trials with either Latin Hypercube sampling or Orthogonal sampling (when $n=p^d$) is…

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…

Combinatorics · Mathematics 2022-12-20 Vishesh Jain , Huy Tuan Pham

Let S_n denote the symmetric group on n letters. We consider the S_n-root lattice A_{n-1} = {(z1,...,zn) in Z^n | z1+...+zn = 0}, where S_n acts on Z^n by permuting the coordinates, and its tensor, symmetric, and exterior squares. For odd…

Rings and Algebras · Mathematics 2007-05-23 Nicole Lemire , Martin Lorenz

Let $l$ be a positive odd integer. Using Cilleruelo's method, we establish an explicit lower bound $N_l$ depending on $l$ such that for all $n\geq N_l$, $\prod_{k=1}^n (2k^2+l)$ is not a square. As an application, we determine all values of…

Number Theory · Mathematics 2023-12-12 Russelle Guadalupe

In this paper, we first present the relation between a transversal in a Latin square with some concepts in its Latin square graph, and give an equivalent condition for a Latin square has an orthogonal mate. The most famous open problem…

Combinatorics · Mathematics 2018-08-17 Adel P. Kazemi , Behnaz Pahlavsay

Let $Q(n,k)$ be the number of $n$-ary quasigroups of order $k$. We derive a recurrent formula for Q(n,4). We prove that for all $n\geq 2$ and $k\geq 5$ the following inequalities hold: $({k-3}/2)^{n/2}(\frac{k-1}2)^{n/2} < log_2 Q(n,k) \leq…

Combinatorics · Mathematics 2016-02-09 Denis Krotov , Vladimir Potapov

Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…

Combinatorics · Mathematics 2021-01-05 Arvind Ayyer , Daniel Hathcock , Prasad Tetali

A critical set in an $n \times n$ Latin square is a minimal set of entries that uniquely identifies it among all Latin squares of the same size. It is conjectured by Nelder in 1979, and later independently by Mahmoodian, and Bate and van…

Combinatorics · Mathematics 2016-09-16 Hamed Hatami , Yingjie Qian

Latin squares are interesting combinatorial objects with many applications. When working with Latin squares, one is sometimes led to deal with partial Latin squares, a generalization of Latin squares. One of the problems regarding partial…

Combinatorics · Mathematics 2014-03-20 Masood Aryapoor

Every Latin square of prime power order $q$ is uniquely described by a local permutation polynomial (LPP) in the polynomial ring $\mathbb{F}_q[x,y]$. Despite this equivalence, one may find in the literature only some preliminary results on…

Combinatorics · Mathematics 2025-10-13 Raúl M. Falcón , Jaime Gutiérrez , Jorge Jiménez Urroz

Goyeneche et al recently proposed a notion of orthogonality for quantum Latin squares, and showed that orthogonal quantum Latin squares yield quantum codes. We give a simplified characterization of orthogonality for quantum Latin squares,…

Quantum Physics · Physics 2019-01-30 Benjamin Musto , Jamie Vicary

A triangle $T'$ is $\varepsilon$-similar to another triangle $T$ if their angles pairwise differ by at most $\varepsilon$. Given a triangle $T$, $\varepsilon>0$ and $n\in\mathbb{N}$, B\'ar\'any and F\"uredi asked to determine the maximum…

Combinatorics · Mathematics 2022-05-03 József Balogh , Felix Christian Clemen , Bernard Lidický

The inner distance of a Latin square was defined by myself and six others during an REU in the Summer of 2020 at Moravian College. Since then, I have been curious about its possible connections to other combinatorial mathematics. The inner…

Combinatorics · Mathematics 2021-12-30 Omar Aceval Garcia

The problem of completing a partially specified n by n Latin square is solved by an alternative proof, based on filling the rows (or diagonals) from 1 to n, using an extended form of Hall's marriage theorem.

Combinatorics · Mathematics 2016-12-28 Eli Shamir

Latin tableaux are a generalization of Latin squares, which first appeared in the early 2000's in a paper of Chow, Fan, Goemans, and Vondr\'{a}k. Here, we extend the notion of isotopy, a permutation group action, from Latin squares to Latin…

Combinatorics · Mathematics 2021-04-02 R. Karpman , É. Roldán

We prove that mean multiplicities in the length spectrum of a non-compact arithmetic hyperbolic orbifold of dimension $n \geqslant 4$ have exponential growth rate $$ \langle g(L) \rangle \geqslant c \frac{e^{([n/2] - 1)L}}{L^{1 + \delta_{5,…

Geometric Topology · Mathematics 2024-07-03 Alexandr Grebennikov

We say that a diagonal in an array is {\em $\lambda$-balanced} if each entry occurs $\lambda$ times. Let $L$ be a frequency square of type $F(n;\lambda^m)$; that is, an $n\times n$ array in which each entry from $\{1,2,\dots ,m\}$ occurs…

Combinatorics · Mathematics 2018-02-06 Nicholas Cavenagh , Adam Mammoliti

Suppose $\Lambda \subseteq \RR^2$ has the property that any two exponentials with frequency from $\Lambda$ are orthogonal in the space $L^2(D)$, where $D \subseteq \RR^2$ is the unit disk. Such sets $\Lambda$ are known to be finite but it…

Classical Analysis and ODEs · Mathematics 2011-11-08 Alex Iosevich , Mihail N. Kolountzakis

Let X be a 2-dimensional simplicial complex. The degree of an edge e is the number of 2-faces of X containing e. The complex X is an \epsilon-expander if the coboundary d_1(\phi) of every Z_2-valued 1-cochain \phi \in C^1(X;Z_2) satisfies…

Combinatorics · Mathematics 2013-07-16 Alexander Lubotzky , Roy Meshulam

We will show that there are at least 8, 10 and 9 mutually orthogonal Latin squares (MOLS) of orders $n=54$, $96$ and $108$. The cases $n=54$ and $96$ are obtained by constructing separable permutation codes consisting of $8 \times 54$ and…

Combinatorics · Mathematics 2024-12-03 R. Julian R. Abel , Ingo Janiszczak , Reiner Staszewski