Related papers: Fun with Latin Squares

We show the Alon-Tarsi conjecture on Latin squares is equivalent to a very special case of a conjecture made independently by Hadamard and Howe, and to the non-vanishing of some interesting integrals over SU(n). Our investigations were…

Writing the values of Krawtchouk polynomials as matrices, we consider weighted partial sums along columns. For the general case, we find an identity that, in the symmetric case yields a formula for such partial sums. Complete sums of…

Designs of experiments for multivariate case are reviewed. Fast algorithm of construction of good Latin hypercube designs is developed.

Sets of three types of convex pentagons that are aperiodic with no matching conditions on the edges are created from a chiral aperiodic monotile Tile(1, 1). This method divides the interior of Tile(1,1) into five convex polygons with five…

We study compositional inverses of permutation polynomials, complete mappings, mutually orthogonal Latin squares, and bent vectorial functions. Recently it was obtained in [33] the compositional inverses of linearized permutation binomials…

We present systematic methods of constructing pandiagonal sudoku squares of order k*k and Knut Vik sudoku squares of order k*k not divisible by 2 or 3. Pandiagonal magic squares are constructed from these squares. Examples of all these…

Using a quartic surface and its rational curves we can give an infinite number of integer hexahedra; these are 6 sided 3d solids, each face a trapezoid, with all sides and diagonals having intger lengths.

We give a simple construction of an orthogonal basis for the space of m by n matrices with row and column sums equal to zero. This vector space corresponds to the affine space naturally associated with the Birkhoff polytope, contingency…

A word is square-free if it does not contain nonempty factors of the form $XX$. In 1906 Thue proved that there exist arbitrarily long square-free words over a $3$-letter alphabet. It was proved recently [7] that among these words there are…

A Costas latin square of order n is a set of n disjoint Costas arrays of the same order. Costas latin squares are studied here from a construction as well as a classification point of view. A complete classification is carried out up to…

We present a general technique for obtaining permutation polynomials over a finite field from permutations of a subfield. By applying this technique to the simplest classes of permutation polynomials on the subfield, we obtain several new…

We introduce higher-dimensional cubical sliding puzzles that are inspired by the classical 15 Puzzle from the 1880s. In our puzzles, on a $d$-dimensional cube, a labeled token can be slid from one vertex to another if it is topologically…

It is proved that for any prescribed orientation of the triples of either a Steiner triple system or a Latin square of odd order, there exists an embedding in an orientable surface with the triples forming triangular faces and one extra…

A quantum Latin square of order $v$, QLS($v$), is a $v\times v$ array in which each of entries is a unit column vector from the Hilbert space $\mathbb{C}^{v}$, such that every row and column forms an orthonormal basis of $\mathbb{C}^{v}$.…

In the paper I prove that there are two squares of opposition. The unconventional one is built up for synthetic propositions. There a, i are contrary, a, o (resp. e, i) are contradictory, e, o are subcontrary, a, e (resp. i, o) are said to…

We generalize classical triangular Schubert puzzles to puzzles with convex polygonal boundary. We give these puzzles a geometric Schubert calculus interpretation and derive novel combinatorial commutativity statements, using purely…

We consider a variation of Construction A of lattices from linear codes based on two classes of number fields, totally real and CM Galois number fields. We propose a generic construction with explicit generator and Gram matrices, then focus…

We give a new proof of the fact that any finite quadratic module can be decomposed into indecomposable ones. For any indecomposable finite quadratic module, we construct a lattice, and a positive definite lattice, both of which are of the…

A quantum Latin square of order $n$ (denoted as QLS$(n)$) is an $n\times n$ array whose entries are unit column vectors from the $n$-dimensional Hilbert space $\mathcal{H}_n$, such that each row and column forms an orthonormal basis. Two…

A classical question in combinatorics is the following:\ given a partial Latin square $P$, when can we complete $P$ to a Latin square $L$? In this paper, we investigate the class of \textbf{$\epsilon$-dense partial Latin squares}:\ partial…