Loops of Clutters

  • Michel Marie Deza
  • Komei Fukuda
Part of the The IMA Volumes in Mathematics and Its Applications book series (IMA, volume 20)


For a clutter \( (C) \) on a finite set E, let \( f(C) \) be the clutter of maximal subsets of E not containing any member of \( (C) \). The loop \( L(C)\) of a clutter C is the finite sequence of clutters \( C,f(C),f^2 (C), \ldots ,f^t (C), \), where t (the length of the loop) is the minimum positive integer with \( f^t (C)\; = \;C. \). Our motivation of the study of the loop lies on the fact that when \( C \) is the set of circuits of a matroid, the loop contains other critical information associated with the matroid, e.g., the set of bases \( f (C) \) and the set of hyperplanes \( f^2 (C). \) We investigate various properties of the loops, in particular, the possible lengths for fixed |E|, the dualities and the symmetries. Our preliminary investigations indicate that there are many interesting problems on the loops whose resolution may provide us with a new insight into Sperner Theory, Matroid Theory and Extremal Set Theory.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [B]
    A.E. Brouwer, On dual pairs of antichains, Math. Centrum report ZW 40/74, Amsterdam, (1975).zbMATHGoogle Scholar
  2. [B-Sc]
    A.E. Brouwer and Schrijver, On the period of an operator defined on antichains, Math. Centrum report ZW 24/74, Amsterdam (1974).zbMATHGoogle Scholar
  3. [D-F1]
    M. Deza and K. Fukuda, On bouqets of matroids and orientations, Pub. R.I.M.S., Kyoto Univ. (1986), 110–129.Google Scholar
  4. [D-F2]
    M. Deza and K. Fukuda, Loops of clutters II, in preparation.Google Scholar
  5. [Du]
    P. Duchet, Sur les hypergraphes invariants, Discrete Mathematics 8 (1974), 269–280.MathSciNetzbMATHCrossRefGoogle Scholar
  6. [E-Fu]
    J. Edmonds and D.R. Fulkerson, Bottleneck extrema, J. Combin. Theory 8 (1970), 299–306.MathSciNetzbMATHCrossRefGoogle Scholar
  7. [En-G]
    K. Engel and H. -D. O.F. Gronau, Sperner theory in partially ordered sets, Leipzig (1985).zbMATHGoogle Scholar
  8. [G-K]
    C. Green and D.J. Kleitman, Proof techniques in the theory of finite sets, in Studies in Combinatorics, MAA Studies in Math. 17 (G.-C. Rota, Ed.), 22–79, Washington, D.C. (1978).Google Scholar
  9. [S]
    P. Seymour, Forbidden minors of binary clutters, J. London Math. Soc. 12 (1976), 356–360.MathSciNetzbMATHCrossRefGoogle Scholar
  10. [V]
    P. Vaderlind, Clutters and semimatroids, Europ. J. Combinatorics 7 (1986), 271–282.MathSciNetzbMATHGoogle Scholar
  11. [W]
    D. Welsh, Matroid Theory, Academic Press, New York (1976).zbMATHGoogle Scholar

Copyright information

© Springer-Verlag New York, Inc. 1990

Authors and Affiliations

  • Michel Marie Deza
    • 1
  • Komei Fukuda
    • 2
  1. 1.ParisFrance
  2. 2.Department of Information SciencesTokyo Institute of TechnologyOh-okayama, Meguro-ku, TokyoJapan

Personalised recommendations