Related papers: Overlap Cycles for Steiner Quadruple Systems
In view of the numerous examples in the literature it is attempted to outline a theory of Heisenberg spin systems possessing dimerized ground states (``DGS systems") which comprises all known examples. Whereas classical DGS systems can be…
A design is said to be $f$-pyramidal when it has an automorphism group which fixes $f$ points and acts sharply transitively on all the others. The problem of establishing the set of values of $v$ for which there exists an $f$-pyramidal…
For each $n\ge5$, we give an $S_n$-equivariant basis for $H_4(\overline{\mathcal{M}_{0,n}},\mathbb{Q})$, as well as for $H_{2(n-5)}(\overline{\mathcal{M}_{0,n}},\mathbb{Q})$. Such a basis exists for…
We introduce a uniform method of proof for the following results. For {\em each} of the following conditions, there are $2^{\aleph_0}$ families of Steiner systems, satisfying that condition: i) Theorem~2.2.4: (extending \cite{Chicoetal})…
Cycles and Cliques in a side-information graph reduce the number of transmissions required in an index coding problem. Thapa, Ong and Johnson defined a more general form of overlapping cycles, called the interlinked-cycle (IC) structure,…
In this paper, we consider the family of planar piecewise linear differential systems with two zones separated by a straight line without sliding regions, that is, differential systems whose flow transversally crosses the switching line…
An $r$-block-coloring, simply $r$-coloring, of a Steiner triple system $\mathrm{STS}(v)$ is a partition of the block set into $r$ color classes, each color class being a partial parallel class. The chromatic index of $\mathrm{STS}(v)$,…
We introduce a hierarchy of linear systems for showing that a given subspace of pure quantum states is entangled (i.e., contains no product states). This hierarchy outperforms known methods already at the first level, and it is complete in…
Let $n$, $k$, and $t$ be integers satisfying $n>k>t\ge2$. A Steiner system with parameters $t$, $k$, and $n$ is a $k$-uniform hypergraph on $n$ vertices in which every set of $t$ distinct vertices is contained in exactly one edge. An…
Kirkman triple systems (KTSs) are among the most popular combinatorial designs and their existence has been settled a long time ago. Yet, in comparison with Steiner triple systems, little is known about their automorphism groups. In…
We obtain the number of different Steiner triple systems S(2^m-1,3,2) of rank 2^m-m+2 over the field GF(2).
Let $R=\mathbb{Z}_{4}[u]/\langle u^k\rangle=\mathbb{Z}_{4}+u\mathbb{Z}_{4}+\ldots+u^{k-1}\mathbb{Z}_{4}$ ($u^k=0$) where $k\in \mathbb{Z}^{+}$ satisfies $k\geq 2$. For any odd positive integer $n$, it is known that cyclic codes over $R$ of…
Latin squares have been historically used in order to create statistical designs in which, starting from a small number of experiments, it can be obtained a large experimental space. In this sense, the optimization of the selection of Latin…
We show that every sufficiently large plane triangulation has a large collection of nested cycles that either are pairwise disjoint, or pairwise intersect in exactly one vertex, or pairwise intersect in exactly two vertices. We apply this…
The cyclic sieving phenomenon (CSP) was introduced by Reiner, Stanton, and White to study combinatorial structures with actions of cyclic groups. The crucial step is to find a polynomial, for example a q-analog, that satisfies the CSP…
A 3-dimensional quasiperiodic lattice, with overlapping unit cells and periodic in one direction, is constructed using grid and projection methods pioneered by de Bruijn. Each unit cell consists of 26 points, of which 22 are the vertices of…
Square Heffter arrays are $n\times n$ arrays such that each row and each column contains $k$ filled cells, each row and column sum is divisible by $2nk+1$ and either $x$ or $-x$ appears in the array for each integer $1\leq x\leq nk$.…
Quantum synchronization has been a subject of intensive research in the last decade. In this work, we propose a quantum Li\'enard system whose classical equivalent features two limit cycles to one of which the system will converge. In the…
In this paper new Steiner systems $S(2,6,121)$, $S(2,6,126)$, $S(2,7,169)$ are introduced. Also some non-existence results for line lengths $7..11$ are presented. There is no solid proof that presented algorithm is exhaustive or correct,…
We prove that every concatenation of $10$ or more binary squares contains an overlap. The bound $10$ is best possible. In contrast, over a ternary alphabet, there are infinitely long overlap-free words that consist of a concatenation of…