Related papers: Mosaics of Combinatorial Designs
We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…
HCI researchers' and practitioners' awareness of intersectionality has been expanding, producing knowledge, recommendations, and prototypes for supporting intersectional populations. However, doing intersectional HCI work is uniquely…
The algebraic method provides useful techniques to identify models in designs and to understand aliasing of polynomial models. The present note surveys the topic of Gr\"obner bases in experimental design and then describes the notion of…
A $2$-$(v,k,\lambda)$ design is additive (or strongly additive) if it is possible to embed it in a suitable abelian group $G$ in such a way that its block set is contained in (or coincides with) the set of all the zero-sum $k$-subsets of…
We present a unified deterministic approach for experimental design problems using the method of interlacing polynomials. Our framework recovers the best-known approximation guarantees for the well-studied D/A/E-design problems with simple…
Using the technique of quasi difference sets we characterize geometry and automorphisms of configurations which can be presented as a join of some others, in particular - which can be presented as series of cyclically inscribed copies of…
In 1963, Shrikhande and Raghavarao published a recursive construction for designs that starts with a resolvable design (the "master design") and then uses a second design (the "indexing design") to take certain unions of blocks in each…
Designs, and in particular symmetric, informationally complete (SIC) structures, play an important role in the quantum tomographic reconstruction process and, by extension, in certain interpretations of quantum theory focusing on such a…
This paper studies inference in randomized controlled trials with multiple treatments, where treatment status is determined according to a "matched tuples" design. Here, by a matched tuples design, we mean an experimental design where units…
We show that various classical theorems of real/complex linear incidence geometry, such as the theorems of Pappus, Desargues, M\"obius, and so on, can be interpreted as special cases of a single "master theorem" that involves an arbitrary…
This paper presents a detailed symbolic approach to the study of self-similar tilings. It uses properties of addresses associated with graph-directed iterated function systems to establish conjugacy properties of tiling spaces. Tiles may be…
In this paper, we study structure theorems of algebras of symmetric functions. Based on a certain relation on elementary symmetric polynomials generating such algebras, we consider perturbation in the algebras. In particular, we understand…
In the context of algebraic statistics an experimental design is described by a set of polynomials called the design ideal. This, in turn, is generated by finite sets of polynomials. Two types of generating sets are mostly used in the…
We consider ordered pairs $(X,\mathcal{B})$ where $X$ is a finite set of size $v$ and $\mathcal{B}$ is some collection of $k$-element subsets of $X$ such that every $t$-element subset of $X$ is contained in exactly $\lambda$ "blocks" $B\in…
We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…
We investigate block designs, under the A- and MV-criteria, when each treatment can have only one or two replications due to resource constraints, as can happen, for example, in early generation varietal trials. While these are commonly…
A (q,k,t)-design matrix is an m x n matrix whose pattern of zeros/non-zeros satisfies the following design-like condition: each row has at most q non-zeros, each column has at least k non-zeros and the supports of every two columns…
Let $\mu$ be a probability measure (or corresponding random variable) such that all moments $\mu_n$ exist. Knowledge of the moments is not sufficient to determine infinite divisibility of the measure; we show also that infinitely divisible,…
Several articles deal with tilings with squares and dominoes on 2-dimensional boards, but only a few on boards in 3-dimensional space. We examine a tiling problem with colored cubes and bricks of $(2\times2\times n)$-board in three…
A $t$-$(n,d,\lambda)$ design over ${\mathbb F}_q$, or a subspace design, is a collection of $d$-dimensional subspaces of ${\mathbb F}_q^n$, called blocks, with the property that every $t$-dimensional subspace of ${\mathbb F}_q^n$ is…