Related papers: Tight quasi-symmetric designs

Block designs are combinatorial structures in which each pair of a set of varieties appears together in a fixed number of blocks. Complete graphs are graphs in which every pair of vertices are adjacent. We present some new constructions of…

For any $n\geq 6$ we construct almost strongly minimal geometries of type $\bullet \overset{n}{-} \bullet \overset{n}{-}\bullet$ which are $2$-ample but not $3$-ample.

We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the…

Let $X$ be a monoid scheme. We will show that the stalk at any point of $X$ defines a point of the topos $\Qc(X)$ of quasi-coherent sheaves over $X$. As it turns out, every topos point of $\Qc(X)$ is of this form if $X$ satisfies some…

The main goal of this paper is to study the extent of freedom one has in constructing quasi-copulas vs. copulas. Specifically, it exhibits three construction methods for quasi-copulas based on recent developments: a representation of…

It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further…

A $(v, k, \lambda)$ symmetric design is said to have the symmetric difference property (SDP) if the symmetric difference of any three blocks is either a block or the complement of a block. Symmetric designs fulfilling this property have the…

A combinatorial object is said to be quasirandom if it exhibits certain properties that are typically seen in a truly random object of the same kind. It is known that a permutation is quasirandom if and only if the pattern density of each…

In this paper we study a certain generalization of combinatorial designs related to almost difference sets, namely the $t$-adesign, which was coined by Cunsheng Ding in 2015. It is clear that $2$-adesigns are a kind of partially balanced…

A weakly distance-regular digraph is quasi-thin if the maximum value of its intersection numbers is 2. In this paper, we focus on commutative quasi-thin weakly distance-regular digraphs, and classify such digraphs with valency more than 3.…

A design is additive under an abelian group $G$ (briefly, $G$-additive) if, up to isomorphism, its point set is contained in $G$ and the elements of each block sum up to zero. The only known Steiner 2-designs that are $G$-additive for some…

In this paper, we provide a criterion for determining whether multiple shells support a $t$-design. We construct as a corollary an infinite series of $2$-designs using power residue codes.

Let $n=2^k-1$ and $m=2^{k-2}$ for a certain $k\ge 3$. Consider the point-line geometry of $2m$-element subsets of an $n$-element set. Maximal singular subspaces of this geometry correspond to binary simplex codes of dimension $k$. For $k\ge…

When $X$ is locally compact, a quasi-integral (also called a quasi-linear functional) on $ C_c(X)$ is a homogeneous, positive functional that is only assumed to be linear on singly-generated subalgebras. We study simple and almost simple…

We consider the asymptotic power performance under local alternatives of the Cochran-Mantel-Haenszel test. Our setting is non-traditional: we investigate randomized experiments that assign subjects via Fisher's blocking design. We show that…

A relative t-design in the binary Hamming association schemes H(n,2) is equivalent to a weighted regular t-wise balanced design, i.e., certain combinatorial t-design which allow different sizes of blocks and a weight function on blocks. In…

A $t\text{-}(n,k,\lambda;q)$-design is a set of $k$-subspaces, called blocks, of an $n$-dimensional vector space $V$ over the finite field with $q$ elements such that each $t$-subspace is contained in exactly $\lambda$ blocks. A partition…

A unitary 2-design can be viewed as a quantum analogue of a 2-universal hash function: it is indistinguishable from a truly random unitary by any procedure that queries it twice. We show that exact unitary 2-designs on n qubits can be…

Relative $t$-designs in the $n$-dimensional hypercube $\mathcal{Q}_n$ are equivalent to weighted regular $t$-wise balanced designs, which generalize combinatorial $t$-$(n,k,\lambda)$ designs by allowing multiple block sizes as well as…

We prove three theorems giving extremal bounds on the incidence structures determined by subsets of the points and blocks of a balanced incomplete block design (BIBD). These results generalize and strengthen known bounds on the number of…