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
42 views

Terminology - variant of a hypergraph

In a hypergraph, we have vertices $V$ and hyperedges $H$, where each hyperedge is a subset of $V$. Suppose that we would like the hyperedges to be (ordered) tuples, rather than subsets. Does this ...
0
votes
2answers
79 views

Orthogonal arrays - relation to software testing, is that sample true?

When doing ortohognal arrays testing, the process is like this: Consider a function with 3 variables,each with 3 options. 3 pairs, each with 3*3 values = 27 parametric pairs. Each "function call" ...
3
votes
1answer
24 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 ...
1
vote
1answer
49 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. ...
1
vote
1answer
28 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
24 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: ...
0
votes
1answer
50 views

Symmetric Balanced Incomplete Block Design Example with (56,7,1)

Can someone give an example of Symmetric Balanced Incomplete Block design with (56,7,1). That is v=b=56,k=r=7, $\Lambda = 1$.
0
votes
1answer
45 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
56 views

$24$ people in groups of $3$ where everyone meets exactly once at the end of some number of rounds

I was presented with this problem at work. Say you have $24$ people and $8$ tables in a room. You want to set people at these tables in groups of three such that during each new round (where people ...
2
votes
0answers
87 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
73 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
42 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
30 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?
1
vote
0answers
48 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 ...
1
vote
0answers
21 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 ...
1
vote
0answers
27 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 ...
1
vote
0answers
22 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. ...
1
vote
0answers
32 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 ...
1
vote
0answers
52 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
12 views

Isomorphic Designs

In lectures we were told: "If two designs are isomorphic, then they have the same parameters. However, the converse does not hold" Could someone provide an example were two designs have the same ...
0
votes
0answers
59 views

How to count minimum rows required for combination of pairs

In another thread, I asked a question whether 75 binary options can be tested just by using 4 rows when arranged using an orthogonal array (i.e. contain all pairwise combinations). 4 is the lower ...
0
votes
0answers
17 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 ...
0
votes
0answers
44 views

Nullifying columns of a matrix by nullifying rows

Let $A$ be a real rectangular matrix. Each column of $A$ is a nonzero vector. Now each row of $A$ is nullified with probability $p$, all independently of each other. What is the probability that ...
0
votes
0answers
34 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 ...
0
votes
0answers
42 views

A question regarding a combinatorial design.

I've been given the following question, and it almost seems too simple, so I'm not really too sure whether I'm just trying to overthink things. Let $B_0$ be a block of a $(v,k,1)$-design $(X, ...
0
votes
0answers
42 views

A proof regarding a symmetric $(v, k, \lambda)$-design.

I've been asked to prove the following; Consider a symmetric $(v,k,\lambda)$-design where $2k < v$. Prove that $2\lambda < k$. Now, being a symmetric design, I know that $v = b$, $r = k$, ...
0
votes
0answers
17 views

Estimate time it takes the minimum mean cycle cancelling algorithm to converge

This particular algorithm solves the circulation problem, equivalent to the minimum-capacitated flow. My question rather than only from this particular algorithm, but for combinatorial solutions in ...
0
votes
0answers
17 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 ...
0
votes
0answers
41 views

Counting the 1s in each row of the incidence matrix of a 2-design

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 ...
0
votes
0answers
50 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 ...