Related papers: Latin hypercubes realizing integer partitions

The partitioning of space by hyperplanes in the context of discrete classification problem is considered. We obtain some relations for the number of partitions and establish a recurrence relation for the maximal number of partitions of R^n…

A quadratic form f is said to have semigroup property if its values at points of the integer lattice form a semigroup under multiplication. A problem of V. Arnold is to describe all binary integer quadratic forms with semigroup property. If…

A cubic partition consists of partition pairs $(\lambda,\mu)$ such that $\vert\lambda\vert+\vert\mu\vert=n$ where $\mu$ involves only even integers but no restriction is placed on $\lambda$. This paper initiates the notion of generalized…

For $n\in \mathbb{N}$ consider the $n$-dimensional hypercube as equal to the vector space $\mathbb{F}_2^n$, where $\mathbb{F}_2$ is the field of size two. Endow $\mathbb{F}_2^n$ with the Hamming metric, i.e., with the metric induced by the…

A partial Latin square of order $n$ can be represented by a $3$-dimensional chess-board of size $n\times n\times n$ with at most $n^2$ non-attacking rooks. In Latin squares, a subsystem and its most distant mate together have as many rooks…

A division sudoku is a latin square whose all six conjugates are sudoku squares. We enumerate division sudokus up to a suitable equivalence, introduce powerful invariants of division sudokus, and also study latin squares that are division…

Wolfgang Rump showed that there is a one-to-one correspondence between nondegenerate involutive set-theoretic solutions of the Yang-Baxter equation and binary algebras in which all left translations $L_x$ are bijections, the squaring map is…

We settle the existence of certain "anti-magic" cubes using combinatorial block designs and graph decompositions to align a handful of small examples.

Sliced Sudoku-based space-filling designs and, more generally, quasi-sliced orthogonal array-based space-filling designs are useful experimental designs in several contexts, including computer experiments with categorical in addition to…

Motivated by Andrews' partitions with initial repetitions, we derive parity formulas for several functions for this class of partitions. In many cases, we present an infinite family of Ramanujan-like congruences modulo 2.

We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two. This result generalizes the polynomial partitioning theorem on the Euclidean…

In this paper we investigate the following existence problem for rational functions: for a given collection $\Pi$ of partitions of a number $n$ to define whether there exists a rational function $f$ of degree $n$ for which $\Pi$ is the…

A quasigroup is a pair $(Q, \cdot)$ where $Q$ is a non-empty set and $\cdot$ is a binary operation on $Q$ such that for every $(u, v) \in Q^2$ there exists a unique $(x, y) \in Q^2$ such that $u \cdot x = v = y \cdot u$. Let $q$ be an odd…

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…

Two Latin squares $L=[l(i,j)]$ and $M=[m(i,j)]$, of even order $n$ with entries $\{0,1,2,\ldots,n-1\}$, are said to be nearly orthogonal if the superimposition of $L$ on $M$ yields an $n\times n$ array $A=[(l(i,j),m(i,j))]$ in which each…

Semi-Latin squares have been extensively studied. They can be interpreted as a special case of latinized block designs where the number of columns is equal to the number of replicates in the design. Latinized row-column designs are…

We investigate the structure of two-dimensional partial cubes, i.e., of isometric subgraphs of hypercubes whose vertex set defines a set family of VC-dimension at most 2. Equivalently, those are the partial cubes which are not contractible…

We present the number of totally symmetric quasigroups (equivalently, totally symmetric Latin squares) of order 16, as well as the number of isomorphism classes, and extend previously published results to include information on the number…

A Lie superalgebra is called quasi-Frobenius if it admits a closed anti-symmetric non-degenerate bilinear form. We study the notion of double extensions of quasi-Frobenius Lie superalgebra when the form is either orthosymplectic or…

We considerably improve Ono's and Ahlgren-Ono's work on the frequent occurrence of Ramanujan-type congruences for the partition function, and demonstrate that Ramanujan-type congruences occur in families that are governed by square-classes.…