For questions about Combinatorial design theory, a part of combinatorial mathematics that deals with the existence, construction and properties of systems of finite sets whose arrangements satisfy generalized concepts of balance and/or symmetry. The theory has applications in the area of the design ...

learn more… | top users | synonyms

1
vote
2answers
53 views

Choosing sets of vectors on a complex sphere

Consider a complex $t$ dimensional unit sphere. Can we have $t$ sets of $2^t$ vectors $v_{ij}\in \Bbb C^t$ on the sphere where $i=1$ to $t$ and $j=1$ to $2^t$ on this with inner products satisfying ...
1
vote
1answer
19 views

balanced incomplete designs

My textbook said a balanced design with covalency 0 is a complete design. I don't understand this, because $$\begin{gather} \text{set of varieties}=\{v_1,v_2,v_3\}\\ B_1 = \{v_1\},\\ B_2 = ...
0
votes
1answer
39 views

Decomposing $K_v - K_u$ into Hamilton paths where $v = u^2 - u + 1$.

A decomposition of a graph $G$ into subgraphs $H$ is a collection of graphs all isomorphic to $H$ which are edge-disjoint in $G$ and together cover all the edges of $G$. Let $u \geq 1$ and $v = u^2 ...
2
votes
0answers
65 views

Out of all combinations (n,k), largest set such that each combination overlaps with others by d or less.

This problem is relevant to determining the number of discriminable combinations of components in a sensory perception task. Suppose that there are N components to choose from, and we are only ...
2
votes
0answers
47 views

Configuration analogues of projective spaces?

In a configuration, each point is incident to the same number of lines and each line is incident to the same number of points. The Fano plane is a configuration, with 3 points on each line, and 3 ...
2
votes
0answers
35 views

Question related to designs where t= 2

1)Let D be a 2−(v,k,λ) design with b blocks and r blocks through every point. Let B be any block. How to show that the number of blocks that meet B is at least $k(r−1)^2/[(k−1)(λ−1)+(r−1)]$ 2) How to ...
1
vote
0answers
31 views

Upper bound for constant weight code L(n,d,w), with n=128, d=4

I would like to find an upper bound: L(n,d,w) <= f(n,d,w) for a constant weight code L(n,d,w), where w is the maximum weight, d is the Hamming distance between codes, and n is the code length. I ...
0
votes
0answers
3 views

Intersection of blocks of the symmetric BIBD $PG(d,q)$

The definition of a Balance Incomplete block design $(v,k,\lambda)$-BIBD can be found here. It is a well known fact (also see the link above) that every two blocks of a symmetric $(v,k,\lambda)$-BIBD ...
0
votes
0answers
3 views

Design theory question

The question is: Prove that no (6, 3, 2)-BIBD can contain repeated blocks? I could not find a condition that determines whether a design has repeated blocks or not.
0
votes
0answers
24 views

Collection of subsets of $S$ where any $t$ have union equal to $S$ but any $t-1$ do not.

This recent question had me thinking about a generalization. Suppose we have a set of $n$ elements $S$. Suppose that we can assign the elements of $S$ to $b$ subsets $\{B_1,\ \cdots,\ B_b\}$ of $k$ ...
0
votes
0answers
11 views

Applications of Steiner Systems

I am looking for mathematical applications of Steiner systems (and other mathematical designs). The wikipedia article says that: This area is one of the oldest parts of combinatorics, such as in ...
0
votes
0answers
38 views

Name for a type of combinatorial design?

Let $X$ be a ground set, and consider a collection $\mathscr{S}$ of subsets of $X$, $\mathscr{S} = \{S_1, \dots, S_n\}$. We would like to find a collection $\mathscr{S}'$ with the property that for ...
-1
votes
0answers
13 views

Combinatorial Designs 1-Factorizations

Construct a starter of order 5 (on Z12) and from it construct a 1-factorization for K14.