Abstract
Combinatorial designs find numerous applications in computer science, and are closely related to problems in coding theory. Packing designs correspond to codes with constant weight; 4-sparse partial Steiner triple systems (4-sparse PSTSs) correspond to erasure-resilient codes able to correct all (except for “bad ones”) 4-erasures, which are useful in handling failures in large disk arrays [4,10]. The study of polytopes associated with combinatorial problems has proven to be important for both algorithms and theory. However, research on polytopes for problems in combinatorial design and coding theories have been pursued only recently [14,15,17,20,21]. In this article, polytopes associated with t-(v,k,λ) packing designs and sparse PSTSs are studied. The subpacking and sparseness inequalities are introduced. These can be regarded as rank inequalities for the independence systems associated with these designs. Conditions under which subpacking inequalities define facets are studied. Sparseness inequalities are proven to induce facets for the sparse PSTS polytope; some extremal families of PSTS known as Erdös configurations play a central role in this proof. The incorporation of these inequalities in polyhedral algorithms and their use for deriving upper bounds on the packing numbers are suggested. A sample of 4-sparse PSTS (v), v ≤ 16, obtained by such an algorithm is shown; an upper bound on the size of m-sparse PSTSs is presented.
Supported by Natural Sciences and Engineering Research Council of Canada PDF.
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
Balas, E., Zemel, E.: Critical cutsets of graphs and canonical facets of set-packing polytopes. Math. Oper. Res. 2, 15–19 (1977)
Brouwer, A.E.: Steiner triple systems without forbidden configurations. Technical Report ZW104/77, Mathematisch Centrum Amsterdam (1977)
Caprara, A., Fischetti, M.: Branch-and-cut algorithms. In: Dell’Amico, M., et al. (eds.) Annotated Bibliographies in Combinatorial Optimization. John Wiley & Sons, Chichester (1997)
Chee, Y.M., Colbourn, C.J., Ling, A.C.H.: Asymptotically optimal erasureresilient codes for large disk arrays. Discrete Appl. Math. (to appear)
Chvátal, V.: On certain polytopes associated with graphs. J. Combin. Theory. Ser. B 18, 138–154 (1975)
Colbourn, C.J., Mendelsohn, E., Rosa, A., Širáň, J.: Anti-mitre Steiner triple systems. Graphs Combin. 10, 215–224 (1994)
Cornuéjols, G., Sassano, A.: On the 0,1 facets of the set covering polytope. Math. Programming 43, 45–55 (1989)
Grannell, M.J., Griggs, T.S.: Configurations in Steiner triple systems. In: Combinatorial Designs and their applications. Chapman & Hall/CRC Res. Notes Math., vol. 403, pp. 103–126. Chapman & Hall/CRC (1999)
Grannell, M.J., Griggs, T.S., Mendelsohn, E.: A small basis for four-line configurations in Steiner triple systems. J. Combin. Des. 3(1), 51–59 (1995)
Hellerstein, L., Gibson, G.A., Karp, R.M., Katz, R.H., Paterson, D.A.: Coding techniques for handling failures in large disk arrays. Algorithmica 12, 182–208 (1994)
Laurent, M.: A generalization of antiwebs to independence systems and their canonical facets. Math. Programming 45, 97–108 (1989)
Lefmann, H., Phelps, K.T., Rödl, V.: Extremal problems for triple systems. J. Combin. Des. 1, 379–394 (1993)
Ling, A.C.H.: A direct product construction for 5-sparse triple systems. J. Combin. Des. 5, 444–447 (1997)
Moura, L.: Polyhedral methods in design theory. In: Wallis, (ed.) Computational and Constructive Design Theory, Math. Appl., vol. 368, pp. 227–254 (1996)
Moura, L.: Polyhedral Aspects of Combinatorial Designs. PhD thesis, University of Toronto (1999)
Moura, L.: Maximal s-wise t-intersecting families of sets: kernels, generating sets, and enumeration. J. Combin. Theory. Ser. A 87, 52–73 (1999)
Moura, L.: A polyhedral algorithm for packings and designs. In: Nešetřil, J. (ed.) ESA 1999. LNCS, vol. 1643, pp. 462–475. Springer, Heidelberg (1999)
Mills, W.H., Mullin, R.C.: Coverings and packings. In: Dinitz, J.H., Stinson, D.R. (eds.) Contemporary Design Theory: a collection of surveys, pp. 371–399. Wiley, Chichester (1992)
Stinson, D.R.: Packings. In: Colbourn, C.J., Dinitz, J.H. (eds.) The CRC handbook of combinatorial designs, pp. 409–413. CRC Press, Boca Raton (1996)
Wengrzik, D.: Schnittebenenverfahren für Blockdesign-Probleme. Master’s thesis, Universität Berlin (1995)
Zehendner, E.: Methoden der Polyedertheorie zur Herleitung von oberen Schranken für die Mächtigkeit von Blockcodes. Doctoral thesis, Universität Augsburg (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moura, L. (2000). Rank Inequalities for Packing Designs and Sparse Triple Systems. In: Gonnet, G.H., Viola, A. (eds) LATIN 2000: Theoretical Informatics. LATIN 2000. Lecture Notes in Computer Science, vol 1776. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719839_11
Download citation
DOI: https://doi.org/10.1007/10719839_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67306-4
Online ISBN: 978-3-540-46415-0
eBook Packages: Springer Book Archive