Related papers: The Enumeration of Cyclic MNOLS

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…

In this paper, we study the maximum number, denoted by $H(m,n)$, of hyperelliptic limit cycles of the Li\'enard systems $$\dot x=y, \qquad \dot y=-f_m(x)y-g_n(x),$$ where, respectively, $f_m(x)$ and $g_n(x)$ are real polynomials of degree…

For Latin squares the units (rows and columns) have fixed sum. The same holds for rows, columns, and blocks in Sudokus. Summing the elements of a unit yields a linear equation, and the set of all such equations forms a system of linear…

Cyclic codes are among the most important families of codes in coding theory for both theoretical and practical reasons. Despite their prominence and intensive research on cyclic codes for over a half century, there are still open problems…

The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define it, showing that the maximum is attained by the polar of the…

In this paper, we study the distribution of the number of occurrences of the simplest frame pattern, called the $\mu$ pattern, in $n$-cycles. Given an $n$-cycle $C$, we say that a pair $\langle i,j \rangle$ matches the $\mu$ pattern if $i <…

A necklace can be considered as a cyclic list of $n$ red and $n$ blue beads in an arbitrary order, and the goal is to fold it into two and find a large cross-free matching of pairs of beads of different colors. We give a counterexample for…

We study the maximum modulus set, $\mathcal{M}(p)$, of a polynomial $p$. We are interested in constructing $p$ so that $\mathcal{M}(p)$ has certain exceptional features. Jassim and London gave a cubic polynomial $p$ such that…

Applying the techniques developed in [AGG], we construct new real hyperbolic manifolds whose underlying topology is that of a disc bundle over a closed orientable surface. By the Gromov-Lawson-Thurston conjecture [GLT], such bundles $M\to…

An algorithm that uses the cycle structure of the rows, or the columns, of a Latin square to compute its autotopy group is introduced. As a result, a bound for the size of the autotopy group is obtained. This bound is used to show that the…

We find the maximum number of maximal independent sets in two families of graphs: all graphs with $n$ vertices and at most $r$ cycles, and all such graphs that are also connected. In addition, we characterize the extremal graphs.

A transversal in an $n \times n$ latin square is a collection of $n$ entries not repeating any row, column, or symbol. Kwan showed that almost every $n \times n$ latin square has $\bigl((1 + o(1)) n / e^2\bigr)^n$ transversals as $n \to…

We discuss possibility of describing solar, atmospheric and LSND results with four neutrinos forming two quasi-degenerate pairs. The simplest versions of this 2+2 scheme with either $\nu_e$ or $\nu_\mu$ mixing exclusively with sterile…

In this note we show that for each Latin square $L$ of order $n\geq 2$, there exists a Latin square $L'\neq L$ of order $n$ such that $L$ and $L'$ differ in at most $8\sqrt{n}$ cells. Equivalently, each Latin square of order $n$ contains a…

In a Latin square, every row can be interpreted as a permutation, and therefore has a parity (even or odd). We prove that in a uniformly random $n\times n$ Latin square, the $n$ row parities are very well approximated by a sequence of $n$…

A \emph{frequency square} is a matrix in which each row and column is a permutation of the same multiset of symbols. We consider only {\em binary} frequency squares of order $n$ with $n/2$ zeroes and $n/2$ ones in each row and column. Two…

A binary frequency square of type $(n;\lambda_0,\lambda_1)$ is a $(0,1)$-matrix of order $n$ with $\lambda_0$ zeros and $\lambda_1$ ones in each row and in each column. Two such squares are orthogonal if there are exactly $\lambda_1^2$…

A universal cycle (u-cycle) is a compact listing of a collection of combinatorial objects. In this paper, we use natural encodings of these objects to show the existence of u-cycles for collections of subsets, matroids, restricted…

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…

We find and discuss an unexpected (to us) order $n$ cyclic group of automorphisms of the Lie algebra $I\mathfrak{u}_n := \mathfrak{u}_n\ltimes\mathfrak{u}_n^\ast$, where $\mathfrak{u}_n$ is the Lie algebra of upper triangular $n\times n$…