Related papers: Tight quasi-symmetric designs
Unitary t-designs are distributions on the unitary group whose first t moments appear maximally random. Previous work has established several upper bounds on the depths at which certain specific random quantum circuit ensembles approximate…
A (v,k,t) covering design, or covering, is a family of k-subsets, called blocks, chosen from a v-set, such that each t-subset is contained in at least one of the blocks. The number of blocks is the covering's size}, and the minimum size of…
The Eaton--Moret\'o conjecture extends the recently-proven Brauer height zero conjecture to blocks with non-abelian defect group, positing equality between the minimal positive heights of a block of a finite group and its defect group. Here…
We give a method of constructing maps between tubular groups inductively according to a set of strategies. This map will be a quasi-isometry exactly when the set of strategies is consistent. Conversely, if there exists a quasi-isometry…
This paper studies circular designs for interference models, where a treatment assigned to a plot also affects its neighboring plots within a block. For the purpose of estimating total effects, the circular neighbor balanced design was…
We prove that quadratical quasigroups form a variety Q of right and left simple groupoids. New examples of quadratical quasigroups of orders 25 and 29 are given. The fine structure of quadratical quasigroups and inter-relationships between…
A design is $G$-additive with $G$ an abelian group, if its points are in $G$ and each block is zero-sum in $G$. All the few known ``manageable" additive Steiner 2-designs are $\mathrm{EA}(q)$-additive for a suitable $q$, where…
We complete the classification of tight $4$-designs in Hamming association schemes $H(n,q)$, i.e., that of tight orthogonal arrays of strength $4$, which had been open since a result by Noda (1979). To do so, we construct an association…
We construct, in the framework of the N=4 SYM theory, a supermultiplet of twist-two conformal operators and study their renormalization properties. The components of the supermultiplet have the same anomalous dimension and enter as building…
We present an interleaving scheme that yields quasi-cyclic turbo codes. We prove that randomly chosen members of this family yield with probability almost 1 turbo codes with asymptotically optimum minimum distance, i.e. growing as a…
Given an STS(v), we ask if there is a permutation of the points of the design such that no $\ell$ consecutive points in this permutation contain a block of the design. Results are obtained in the cases $\ell = 3,4$.
In this note we answer positively a question of Chris Godsil and Karen Meagher on the existence of a 2-design whose block graph has a non-canonical maximum clique without a design structure.
A class of quasilinear singularly perturbed boundary value problems with a turning point of attractive type is considered. The problems are solved numerically by a finite-difference scheme on a special discretization mesh which is dense…
Bose proved the inequality $b\geq v+r-1$ for resolvable balanced incomplete block designs (RBIBDs) and Kageyama improved it for RBIBDs which are not affine resolvable. In this note we prove a new lower bound on the number of blocks $b$ that…
In this note, we give direct constructions of some group divisible designs (GDDs) with block size $4$ that have up to $50$ points.
All quasilinear NLS-type systems with fourth order symmetry are listed. Vector generalizations of some of them are constructed. Local master symmetries for several systems from the list are found.
In this paper we provide a $4$-GDD of type $2^2 5^5$, thereby solving the existence question for the last remaining feasible type for a $4$-GDD with no more than $30$ points. We then show that $4$-GDDs of type $2^t 5^s$ exist for all but a…
A regular-graph design is a block design for which a pair $\{a,b\}$ of distinct points occurs in $\lambda+1$ or $\lambda$ blocks depending on whether $\{a,b\}$ is or is not an edge of a given $\delta$-regular graph. Our paper describes a…
We classify all finite linear spaces on at most 15 points admitting a blocking set. There are no such spaces on 11 or fewer points, one on 12 points, one on 13 points, two on 14 points, and five on 15 points. The proof makes extensive use…
An avoidance problem of configurations in 4-cycle systems is investigated by generalizing the notion of sparseness, which is originally from Erd\H{o}s' r-sparse conjecture on Steiner triple systems. A 4-cycle system of order v, 4CS(v), is…