Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
0 answers
317 views

Prime Hadamard matrices

Assume that $n$ is a sufficiently large number. Is there a Hadamard matrix $H_{4n \times 4n}=(h_{ij})$ with the last row and the last cloumn $J$ (thet is, for every $k$, $h_{k,4n}=1$ and $h_{4n, k}=1$)...
Arash Ahadi's user avatar
5 votes
2 answers
660 views

Can we sometimes define the parity of a set?

Suppose that ${n\choose k}, {n-1\choose k-1}, \ldots, {n-k+1\choose 1}$ are all even. (This happens for example if $k=2^\alpha-1$ and $n=2k$.) In this case, can we select ${n\choose k}/2$ sets of size ...
domotorp's user avatar
  • 18.8k
1 vote
1 answer
834 views

Known results on cyclic difference sets

Is there any infinite family of $v$ for which all the $(v,k,\lambda)$-cyclic difference sets with $k-\lambda$ a prime power coprime to $v$ have been determined? A subset $D=\{a_1,\ldots,a_k\}$ of $\...
Binzhou Xia's user avatar
1 vote
5 answers
374 views

Pairwise balanced designs with $r=\lambda^{2}$

A while ago I asked how to construct an infinite family of $(v,b,r,k,\lambda)$-designs satisfying $r=\lambda^{2}$ and got very good answers from Yuichiro Fujiwara and Ken W. Smith. Now I'd like to up ...
Felix Goldberg's user avatar
4 votes
2 answers
331 views

Is there an infinite number of combinatorial designs with $r=\lambda^{2}$

A quick look at Ed Spence's page reveals two such examples: (7,3,3) and (16,6,3). If there is a known classification and/or name by which such designs go, I'd love to know about them too. EDIT: I ...
Felix Goldberg's user avatar