# Tagged Questions

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 ...

39 views

### Number of blocks in this design $(V,\mathcal{B})$ $|V|=16$ and $\mathcal{B}$ has size $4$

Let $(V,\mathcal{B})$ be a design in which $|V|=16$, each block in $\mathcal{B}$ has size $4$, and each pair of points occurs in precisely one block. How many blocks are in this design? Try 1: ...
41 views

### Trying to find a combinatorial design which describes my problem

A group of 8 golfers would like to play in teams, split into two teams of 4, with a different arrangement of teams on each of 5 consecutive days; they would like each pair of players to be on the same ...
55 views

### Symmetric 2-Designs

We just proved that for any symmetric 2-design (or Symmetric BIBDs as most literature puts it) with parameters $(v,k,\lambda)$, any two blocks intersects at exactly $\lambda$ points. Our lecturer ...
87 views

### Find a (16,6,1) Balanced incomplete block design (BIBD)

I'm trying to find a balanced incomplete block design with the 16 items and $\lambda= 1$. I've calculated (using these defenitions) that a BIBD with 8 blocks and 6 items per block should be possible. ...
34 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 = \{v_2\},\\...
37 views

### Existence of a (40,13,4)BIBD (Balanced Incomplete Block Design)

I have been asked to prove that there exists a (40,13,4)BIBD. I admittedly have no idea where to start with this. Checking some of the necessary conditions for BIBDs shows me that if such a BIBD ...
50 views

44 views

### Permutation of people and teams

Suppose 20 people attend an event where there is 4 different activities to do. Suppose we want to split the group in subgroups, each subgroup attending one session of an activity, then moving on the ...
54 views

### Rotation of 15 people at five tables

I have five tables of four people each. At each table is a table leader who remains stationery. How do I rotate the 15 participants so that they get to meet new people each time they rotate?
67 views

### Existence of Designs

I am familiar with Keevash's proof that provided divisibility conditions hold, $t-(n,k,\lambda)$ designs exist for all but finitely many $t,n,k,\lambda$. My question is, given some $n,t,k$ does ...
29 views

### Combinatorial designs give triangulations of complete graphs

I recently attended a talk on combinatorial design theory. The speaker mentioned briefly that the Fano plane, and other designs give rise to triangulations of complete graphs (the Fano plane gives a ...
31 views

### A question involving Partial Steiner Triple Systems

I've been given the following question, which I think I've completed, but I just wanted to check whether what I've said is valid. Suppose that a PSTS(23) with a $K_5$ leave is constructed using ...
27 views

### finding confounded effects

In a (3$^3$,3$^2$) design, how to find the effects confounded given the key block (0,0,0),(0,1,2) and (1,0,1)? I have completed the key block. (0,0,0),(0,1,2),(1,0,1),(1,1,0),(2,1,1),(0,2,1),(2,0,2)(...
63 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 ...
19 views

### Constructing partial Steiner triple systems

Is there a general way to construct a partial Steiner triple system? There are algorithms to construct complete Steiner triple systems for $n \equiv 1, 3 \bmod 6$. From complete Steiner triple ...
20 views

### Hadamard matice decomposition to sparce matrices

$H_2=\begin{pmatrix} 1 & 1\\1 & -1 \end{pmatrix}$ and $H_{2n}=H_2\otimes H_n$. I am looking for decomposition of $H_n$ to sparce matrices and its proof. Is there any good source to suggest ?
21 views

### Construction of a (3v-2,3,1)-BIBD

I want to construct a $(3v - 2,3,1)$-BIBD from a $(v,3,1)$-BIBD and a quasigroup of order $v-1$. Attempt: For new BIBD, firstly, I need $3v-2$ points. Let $A$ be a block in $(3v - 2,3,1)$-BIBD and ...
39 views

### Is there a formula to rotate users through 2 positions without repeating weeks, repeating positions, or being paired with the same user?

I need to rotate through users to do 2 jobs without doing the same job for consecutive times, without doing the same job twice in a row, and without being paired with the same person twice. Is there ...
22 views

### network design: why can't an almost satisfied proper function violated by all given sets?

I'm reading a book about (survivable) network design and i have a problem understanding a lemma. Given an undirected graph G and $V(G)$ its nodes and $E(G)$ its edges. The book defines a proper ...
Consider the $2 - (4t-1, 2t, t)$ design where $t$ is an odd number and $A$ is the incidence matrix. I suspect that the number of elements with value $1$ in each row of $A$ is equal to $2t$ but I can't ...
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 ...