Abstract
We denote the complete design D (or the so-called trivial design) by \(S\left( {\left( {_{k - t}^{v - t}} \right);t,k,v} \right).\) A conjecture of Hartman states that one can partition D into two \(S\left( {\left( {_{k - t}^{v - t}} \right)/2;t,k,v} \right)\) designs if and only if \(\left( {_{k - i}^{v - i}} \right)\) is even for i = 0,...t. In this paper, some progress in support of the conjecture is reported.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Ajoodani-Namini, All block designs with \( b = \left( {_k^v} \right)/2\) exist, 1994, submitted.
S. Ajoodani-Namini and G.B. Khosrovshahi, More on halving the complete designs, 1992, Discrete Math., in press.
W.O. Alltop, Extending t-designs, J. Combin. Theory, Ser. A 18 (1975), 177–186.
A.Hartman, Halving the complete design, Ann. Discrete Math. 34 (1987), 207–224.
A.S. Hedayat, The theory of trade-off for t-design, in: Coding Theory and Design Theory, Part II, Design Theory (D.Ray-Chaudhuri, ed.), IMA Vol Math. Appl. 21, Springer-Verlag, 1990, 101–126.
A.S. Hedayat, G.B. Khosrovshahi, and D. Majumdar, A prospect for a general method for constructing t-designs, Discrete Appl. Math. 42 (1993), 31–50.
G.B. Khosrovshahi and S. Ajoodani-Namini, An infinite family of 6-designs exists, Sankhyã 54 (1992), 259–264.
G.B. Khosrovshahi and S. Ajoodani-Namini, A new basis for trades, SIAM J. Discrete Math. 3 (1990), 364–372.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Kluwer Academic Publishers
About this chapter
Cite this chapter
Ajoodani-Namini, S., Khosrovshahi, G.B. (1995). On a Conjecture of A. Hartman. In: Colbourn, C.J., Mahmoodian, E.S. (eds) Combinatorics Advances. Mathematics and Its Applications, vol 329. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3554-2_1
Download citation
DOI: https://doi.org/10.1007/978-1-4613-3554-2_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-3556-6
Online ISBN: 978-1-4613-3554-2
eBook Packages: Springer Book Archive