JCT
2006
14 years 12 days ago
2006
We show that a near resolvable 2-(2k + 1, k, k - 1) design exists if and only if a conference matrix of order 2k + 2 does. A known result on conference matrices then allows us to ...
EJC
2008
14 years 16 days ago
2008
Abstract. In this paper we enumerate the number of ways of selecting k objects from n objects arrayed in a line such that no two selected ones are separated by m-1, 2m-1,