Related papers: $q$-Analogs for Steiner Systems and Covering Desig…
Free Steiner triple systems (STS) are infinite structures that are naturally characterised by a universal property. We consider the class of free STSs from a model theoretic viewpoint. We show that free STSs on any number of generators are…
A set $\mathcal{F}_q$ of $3$-dimensional subspaces of $\mathbb{F}_q^7$, the $7$-dimensional vector space over the finite field $\mathbb{F}_q$, is said to form a $q$-analogue of the Fano plane if every $2$-dimensional subspace of…
We study the enumeration of mixed dimer covers on skew Young diagrams of ribbon shape (also called border strips or snake graphs). For the two extreme cases of straight and zigzag shapes, we show that the number of mixed dimer covers are…
The existence of Steiner triple systems STS(n) of order n containing no nontrivial subsystem is well known for every admissible n. We generalize this result in two ways. First we define the expander property of 3-uniform hypergraphs and…
We define a pseudo quasi-3 design as a symmetric design with the property that the derived and residual designs with respect to at least one block are quasi-symmetric. Quasi-symmetric designs can be used to construct optimal self…
This paper addresses the resilience of large-scale closed-loop structured systems in the sense of arbitrary pole placement when subject to failure of feedback links. Given a structured system with input, output, and feedback matrices, we…
A Steiner triple system is a set $S$ together with a collection $\mathcal{B}$ of subsets of $S$ of size 3 such that any two elements of $S$ belong to exactly one element of $\mathcal{B}$. It is well known that the class of finite Steiner…
Coding theory and combinatorial $t$-designs have close connections and interesting interplay. One of the major approaches to the construction of combinatorial t-designs is the employment of error-correcting codes. As we all known, some…
We prove an analog of the classical Hartogs extension theorem for certain (possibly unbounded) domains on coverings of Stein manifolds.
In this work we advance a generalization of quantum computational logics capable of dealing with some important examples of quantum algorithms. We outline an algebraic axiomatization of these structures.
A new kind of aperiodic tiling is introduced. It is shown to underlie a structure obtained as a superposition of waves with incommensurate periods. Its connections to other other tilings and quasicrystals are discussed.
Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph $\cG_q(n,r)$ by subspaces from the Grassmann graph $\cG_q(n,k)$, $k \geq r$, are discussed. The problem is of interest from four points of view: coding…
In this article, we construct a Steiner system with the parameters $S(3,6,42)$, settling one of the smallest open parameter sets of Steiner $3$-designs. Furthermore, we establish the existence of rotational Steiner quadruple systems on $46$…
The aim of this paper is to make a connection between design theory and algebraic geometry/commutative algebra. In particular, given any Steiner System $S(t,n,v)$ we associate two ideals, in a suitable polynomial ring, defining a Steiner…
We prove orthogonality relations for some analogs of trigonometric functions on a $q$-quadratic grid and introduce the corresponding $q$-Fourier series. We also discuss several other properties of this basic trigonometric system and the…
Considerable time is often spent optimizing antennas to meet specific design metrics. Rarely, however, are the resulting antenna designs compared to rigorous physical bounds on those metrics. Here we study the performance of optimized…
Mathematicians have been interested in non-periodic tilings of space for decades; however, it was the unexpected discovery of non-periodically ordered structures in intermetallic alloys which brought this subject into the limelight. These…
A partial Steiner triple system of order $u$ is a pair $(U,\mathcal{A})$ where $U$ is a set of $u$ elements and $\mathcal{A}$ is a set of triples of elements of $U$ such that any two elements of $U$ occur together in at most one triple. If…
In 1976, Delsarte introduced the notion of $q$-analogs of designs, and $q$-analogs of graphs were introduced recently by M. Braun et al. In this paper, we extend that study by giving a method for constructing transitive regular $q$-analogs…
Significant progress is required in the engineering of large, interacting quantum systems in order to realize the promises of gate-model quantum computing. Designing such systems is challenging, as the dynamics of continuous variable…