Related papers: Boolean 2-designs and the embedding of a 2-design …
This paper begins by extending the notion of a combinatorial configuration of points and lines to a combinatorial configuration of points and planes that we refer to as configurations of order $2$. We then proceed to investigate a further…
Generally, combinatorial design concerns with the arrangement of a finite set of elements into patterns (subsets, words, arrays) according to specified rules. The usefulness of this design method is that the number of input combination can…
The generalized chain geometry over the local ring $K(\epsilon;\sigma)$ of twisted dual numbers, where $K$ is a finite field, is interpreted as a divisible design obtained from an imprimitive group action. Its combinatorial properties as…
In the monotone integer dualization problem, we are given two sets of vectors in an integer box such that no vector in the first set is dominated by a vector in the second. The question is to check if the two sets of vectors cover the…
The paper presents several approaches to generalized blockmodeling of valued networks, where values of the ties are assumed to be measured on at least interval scale. The first approach is a straightforward generalization of the generalized…
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…
We determine the numerical invariants of blocks with defect group D_{2^n}\times C_{2^m}, where D_{2^n} denotes a dihedral group of order 2^n and C_{2^m} denotes a cyclic group of order 2^m. This generalizes Brauer's results for m=0. As a…
A weighted $t$-design in $\mathbb{R}^d$ is a finite weighted set that exactly integrates all polynomials of degree at most $t$ with respect to a given probability measure. A fundamental problem is to construct weighted $t$-designs with as…
Computational techniques for the construction of quasi-symmetric block designs are explored and applied to the case with $56$ points. One new $(56,16,18)$ and many new $(56,16,6)$ designs are discovered, and non-existence of $(56,12,9)$ and…
Unitary $T$-designs play an important role in quantum information, with diverse applications in quantum algorithms, benchmarking, tomography, and communication. Until now, the most efficient construction of unitary $T$-designs for $n$-qudit…
Using the connections among almost complete intersection schemes, arithmetically Gorenstein schemes and schemes that are union of complete intersections we give a structure theorem for arithmetically Cohen-Macaulay union of two complete…
This paper investigates simple $3$-$(2^n+1,13,\lambda)$ designs admitting $\mathrm{PSL}$$(2,2^n)$ as an automorphism group. We determine all possible values of $\lambda$ by systematically analyzing the orbits of $13$-element subsets under…
Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary $N$ distinct points in…
A finite subgroup of $GL(n,\mathbb C)$ is involutory if the sum of the dimensions of its irreducible complex representations is given by the number of absolute involutions in the group. A uniform combinatorial model is constructed for all…
Multiple-group data is widely used in genomic studies, finance, and social science. This study investigates a block structure that consists of covariate and response groups. It examines the block-selection problem of high-dimensional models…
This paper studies problems related to visibility among points in the plane. A point $x$ \emph{blocks} two points $v$ and $w$ if $x$ is in the interior of the line segment $\bar{vw}$. A set of points $P$ is \emph{$k$-blocked} if each point…
We determine the numerical invariants of blocks with defect group D_{2^n} * C_{2^m} = Q_{2^n} * C_{2^m} (central product), where n > 2 and m > 1. As a consequence, we prove Brauer's k(B)-conjecture, Olsson's conjecture (and more generally…
Blocking is often used to reduce known variability in designed experiments by collecting together homogeneous experimental units. A common modelling assumption for such experiments is that responses from units within a block are dependent.…
We introduce and study a new notion of patterns in Stirling and $k$-Stirling permutations, which we call block patterns. We prove a general result which allows us to compute generating functions for the occurrences of various block patterns…
The central discovery of $2d$ conformal theory was holomorphic factorization, which expressed correlation functions through bilinear combinations of conformal blocks, which are easily cut and joined without a need to sum over the entire…