Related papers: Negative Latin Square Type Partial Difference Sets…

Classical strong external difference families (SEDFs) are much-studied combinatorial structures motivated by information security applications; it is conjectured that only one classical abelian SEDF exists with more than two sets. Recently,…

We study the connection between mutually unbiased bases and mutually orthogonal extraordinary supersquares, a wider class of squares which does not contain only the Latin squares. We show that there are four types of complete sets of…

Nonnegative least squares problems with multiple right-hand sides (MNNLS) arise in models that rely on additive linear combinations. In particular, they are at the core of most nonnegative matrix factorization algorithms and have many…

This paper examines the construction of low-density parity-check (LDPC) codes from transversal designs based on sets of mutually orthogonal Latin squares (MOLS). By transferring the concept of configurations in combinatorial designs to the…

Strong external difference families (SEDFs) have applications to cryptography and are rich combinatorial structures in their own right; until now, all SEDFs have been in abelian groups. In this paper, we consider SEDFs in both abelian and…

Following the continuing interest in the Urysohn space and, more specifically, the recent problem area of finding and comparing group structures on the Urysohn space we prove that there exists a non-abelian group structure on the Urysohn…

A $k \times n$ partial Latin rectangle is \textit{$C$-sparse} if the number of nonempty entries in each row and column is at most $C$ and each symbol is used at most $C$ times. We prove that the probability a uniformly random $k \times n$…

A quantum Latin square is an $n \times n$ array of unit vectors where each row and column forms an orthonormal basis of a fixed complex vector space. We introduce the notion of $(G,G')$-invariant quantum Latin squares for finite groups $G$…

A group classification of first-order delay ordinary differential equation (DODE) accompanied by an equation for delay parameter (delay relation) is presented. A subset of such systems (delay ordinary differential systems or DODSs) which…

In this paper, an effort is made to classify which prime character degree graphs having eight vertices occur for some finite solvable group. To approach this, we compile known results and constructions from the literature which are used to…

For nearly a century, mathematicians have been developing techniques for constructing abelian automorphism groups of combinatorial objects, and, conversely, constructing combinatorial objects from abelian groups. While abelian groups are a…

We give algebraic and geometric classifications of complex $4$-dimensional nilpotent noncommutative Jordan algebras. Specifically, we find that, up to isomorphism, there are only $18$ non-isomorphic nontrivial nilpotent noncommutative…

We discuss a hierarchy of broken symmetries with special emphasis on partial dynamical symmetries (PDS). The latter correspond to a situation in which a non-invariant Hamiltonian accommodates a subset of solvable eigenstates with good…

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…

We construct, for any given $ \ell = \frac{1}{2} + {\mathbb N}_0, $ the second-order \textit{nonlinear} partial differential equations (PDEs) which are invariant under the transformations generated by the centrally extended conformal…

Regular maps on linear fractional groups $PSL(2,q)$ and $PGL(2,q$) have been studied for many years and the theory is well-developed, including generating sets for the asscoiated groups. This paper studies the properties of self-duality,…

P. J. Federico used the term low-order for perfect squared squares with at most 28 squares in their dissection. In 2010 low-order compound perfect squared squares (CPSSs) were completely enumerated. Up to symmetries of the square and its…

We classify Schubert problems in the Grassmannian of 4-planes in 9-dimensional space by their Galois groups. Of the 31,806 essential Schubert problems in this Grassmannian, there are only 149 whose Galois group does not contain the…

A defining set of a Latin square is a partially filled-in Latin square which completes to no other Latin square of the same order. We introduce the concept of a $k$-strong defining set, in which if less than $k$ entries are deleted, the…

We present our exhaustive exploration of the densest ternary sphere packings (DTSPs) for 45 radius ratios and 237 kinds of compositions, which is a packing problem of three kinds of hard spheres with different radii, under periodic boundary…