Skip to main content
SpringerLink
Log in

Flag Numbers and FLAGTOOL

  • Chapter
Polytopes — Combinatorics and Computation

Part of the book series: DMV Seminar ((OWS,volume 29))

  • 1144 Accesses

Abstract

FLAGTOOL is a computer program for proving automatically theorems about the combinatorial structure of polytopes of dimensions at most 10. Its starting point is the known linear relations (equalities and inequalities) for flag number of polytopes. After describing the state of the art concerning such linear relations we describe various applications of FLAGTOOL and we conclude by indicating several directions for future research and automation. As an appendix we describe FLAGTOOL’s main tools and demonstrate one working session with the program.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.95
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Adin: A new cubical h-vectorDiscreteMath. 157(1996), 3–14.

    Article  MathSciNet  MATH  Google Scholar 

  2. E. Babson, L. J. Billera and C. Chan. Neighborly cubical spheres and a cubical lower bound conjectureIsrael J.Math. 102(1997), 297–315.

    Article  MathSciNet  MATH  Google Scholar 

  3. D. W. Barnette: A proof of the lower bound conjecture for convex polytopesPacific J. Math. 46(1971), 349–354.

    Article  MathSciNet  Google Scholar 

  4. D. W. Barnette: The projection of the f-vectors of 4-polytopes onto the(E S)-plane,Discrete Math.10 (1974), 201–216.

    Article  MathSciNet  MATH  Google Scholar 

  5. D. W. Barnette: Nonfacets for shellable spheresIsrael J. Math. 35(1980), 286–288.

    Article  MathSciNet  MATH  Google Scholar 

  6. V. V. Batyrev and L. A. Borisov: Mirror duality and string theoretic Hodge numbersInvent.Math. 126(1996), 183–203.

    Article  MathSciNet  MATH  Google Scholar 

  7. M. M. Bayer: The extended f-vectors of 4-polytopesJ. Combinat. Theory Ser. A 44(1987), 141–151.

    Article  MathSciNet  MATH  Google Scholar 

  8. M. M. Bayer: Equidecomposable and weakly neighborly polytopesIsrael J. Math. 81(1993), 301–320.

    Article  MathSciNet  MATH  Google Scholar 

  9. M. M. Bayer: Face numbers and subdivisions of convex polytopes, in: “Polytopes: Abstract, Convex and Computational” (T. Bisztriczky et al., eds.) Kluwer 1994, 155–172.

    Google Scholar 

  10. M. M. Bayer: An upper bound theorem for rational polytopesJ. Combinat. Theory Ser. A 83(1998), 141–145.

    Article  MathSciNet  MATH  Google Scholar 

  11. M. M. Bayer and L. J. Billera: Generalized Dehn-Sommerville relation for polytopes, spheres and Eulerian partially ordered setsInvent.Math. 79(1985), 143–157.

    Article  MathSciNet  MATH  Google Scholar 

  12. M. M. Bayer and R. Ehrenborg: On the toric h-vectors of partially ordered setsTransactions Amer. Math. Soc.to appear.

    Google Scholar 

  13. M. M. Bayer and G. Hetyei: Flag vectors of Eulerian partially ordered sets, preprint, 1999.

    Google Scholar 

  14. M. M. Bayer and A. Klapper: A new index for polytopesDiscrete Comput Geometry 6(1991), 33–47.

    Article  MathSciNet  MATH  Google Scholar 

  15. M. M. Bayer and C. Lee: Convex polytopes, in:Handbook of Convex Geometry(P. Gruber and J. Wills, eds.), Vol. A, North-Holland (Elsevier Science Publishers), Amsterdam, 1993, 485–534.

    Google Scholar 

  16. A. Bezdek, K. Bezdek, E. Makai and P. McMullen: Facets with fewest verticesMonatshefte Math. 109(1990), 89–96.

    Article  MathSciNet  MATH  Google Scholar 

  17. L. J. Billera and A. Björner: Face Numbers of Polytopes and Complexes, in:Handbook of Discrete and Computational Geometry(J.E. Goodman, J. O’Rourke, eds.), CRC Press, Boca Raton, New York 1997, 291–310.

    Google Scholar 

  18. L. J. Billera and C. W. Lee: A proof of the sufficiency of McMullen’s conditions for f-vectors of simplicial convex polytopesJ. Combinat. Theory Ser. A 31(1981), 237–255.

    Article  MathSciNet  MATH  Google Scholar 

  19. L. J. Billera and R. Ehrenborg: Monotonicity of the cd-index for polytopesMath. Z. 233 (2000), 421–444.

    Article  MathSciNet  MATH  Google Scholar 

  20. L. J. Billera, R. Ehrenborg and M. Readdy: The c-2d-index of oriented matroidsJ. Combinat. Theory Ser. A 80(1997), 79–105.

    Article  MathSciNet  MATH  Google Scholar 

  21. L. J. Billera, R. Ehrenborg and M. Readdy: The cd-index of zonotopes and arrangements MathematicalEssays in Honor of Gian-CarloRota, B. Sagan and R. Stanley, eds.), Birkhäuser, Boston 1998, 23–40.

    Google Scholar 

  22. L. J. Billera and G. Hetyei: Linear inequalities for flags in graded partially ordered setsJ. Combinat. Theory Ser. A 89 (2000), 77–104.

    Article  MathSciNet  MATH  Google Scholar 

  23. L. J. Billera and G. Hetyei: Decompositions of partially ordered sets, preprint 1998.

    Google Scholar 

  24. L. J. Billera and N. Liu: Noncommutative enumeration in ranked posetsJ. Algebraic Combinatoricsto appear.

    Google Scholar 

  25. A. Björner: Partial unimodality for f-vectors of simplicial polytopes and spheresContemporaryMath. 178(1994), 45–54.

    Google Scholar 

  26. A. Björner and G. Kalai: Extended Euler Poincare relations for cell complexes, in: “Applied Geometry and Discrete Mathematics, The Klee Festschrift,”DIMACS Series in Discrete Mathematics and Computer Science 4(1991), 81–89.

    Google Scholar 

  27. G. Blind and R. Blind: Convex polytopes without triangular facesIsrael J.Math. 71(1990), 129–134.

    Article  MathSciNet  MATH  Google Scholar 

  28. T. Braden and R. D. MacPherson: Intersection homology of toric varieties and a conjecture of KalaiCommentarii Math. Helv. 74 (1999), 442–455.

    Article  MathSciNet  MATH  Google Scholar 

  29. R. Descartes: De Solidorum Elementis, in:Oeuvres de DescartesVol. 10, 265–276, published by C. Adam and P. Tannery, Paris 1897–1913.

    Google Scholar 

  30. B. Grünbaum: Convex Polytopes, Interscience, London 1967.

    MATH  Google Scholar 

  31. B. Grünbaum: Polytopes, graphs and complexesBulletin Amer. Math. Soc. 97(1970), 1131–1201.

    Article  Google Scholar 

  32. B. Grünbaum: Arrangements and SpreadsCBMS Regional Conference Series in Math. 10Amer. Math. Soc., Providence RI 1972.

    Google Scholar 

  33. M. Joswig and G. M. Ziegler: Neighborly cubical polytopes, in: “Grünbaum Festschrift” (G. Kalai, V. Klee, eds.)Discrete Comput. Geometryto appear.

    Google Scholar 

  34. G. Kalai: Rigidity and the lower bound theorem IInvent. Math. 88(1987), 125–151.

    Article  MathSciNet  Google Scholar 

  35. G. Kalai: A new basis of polytopesJ. Combinat. Theory Ser. A 49 (1988), 191–209.

    Article  MathSciNet  MATH  Google Scholar 

  36. G. Kalai: On low-dimensional faces that high-dimensional polytopes must haveCombinatorica 10(1990), 271–280.

    Article  MathSciNet  MATH  Google Scholar 

  37. G. Kalai: The diameter of graphs of convex polytopes and f-vector theory, in: “Applied Geometry and Discrete Mathematics, The Klee Festschrift,”DIMACS Series in Discrete Mathematics and Computer Science 4(1991), 387–411.

    MathSciNet  Google Scholar 

  38. A. G. Khovanskii: Hyperplane sections of polyhedra, toroidal manifolds, and discrete groups in Lobachevskij spaceFunct. Anal. Appl. 20(1986), 41–50.

    Article  MathSciNet  Google Scholar 

  39. P. McMullen: The maximum numbers of faces of a convex polytopes, Matematika17(1970), 179–184.

    Article  MathSciNet  MATH  Google Scholar 

  40. P. McMullen: The numbers of faces of simplicial polytopesIsrael J. Math. 9(1971), 559–570.

    Article  MathSciNet  MATH  Google Scholar 

  41. P. McMullen: On simple polytopesInvent.Math. 113(1993), 419–444.

    Article  MathSciNet  MATH  Google Scholar 

  42. G. Meisinger: Flag Numbers and Quotients of Convex Polytopes, Schuch-Verlag, Weiden 1994.

    Google Scholar 

  43. G. Meisinger, P. Kleinschmidt and G. Kalai: Three theorems, with computer-aided proofs, on three-dimensional faces and quotients of polytopesDiscrete Comput. Geometryto appear.

    Google Scholar 

  44. V. V. Nikulin: Discrete reflection groups in Lobachevsky spaces and algebraic surfaces, in:Proc. Int. Congress of Math. Berkeley 1986Vol. 1, 654–671.

    MathSciNet  Google Scholar 

  45. P. Seymour: On the points-lines-planes conjectureJ. Combinat. Theory Ser. B 33 (1982), 17–26.

    Article  MathSciNet  MATH  Google Scholar 

  46. R. P. Stanley, The number of faces of simplicial convex polytopesAdvances Math.35 (1980), 236–238.

    Article  MathSciNet  MATH  Google Scholar 

  47. R. P. Stanley: Generalizedh-vectors, intersection cohomology of toric varieties, and related results, in: “Commutative Algebra and Combinatorics” (M. Nagata and H. Matsumura, eds.),Advanced Studies in Pure Mathematics 11Kinokuniya, Tokyo, and North-Holland, Amsterdam/New York 1987, 187–213.

    Google Scholar 

  48. R. P. Stanley: Subdivisions and localh-vectorsJ. Amer. Math.Soc. 5 (1992), 805–851.

    MathSciNet  MATH  Google Scholar 

  49. R. P. Stanley: Combinatorics and Commutative Algebra, Second Edition, Birkhäuser, Boston 1994.

    Google Scholar 

  50. R. P. Stanley: Flag vectors and the CD-indexMath. Z. 216(1994), 483–499.

    Article  MathSciNet  MATH  Google Scholar 

  51. R. P. Stanley: A survey of Eulerian posets, in: “Polytopes: Abstract, Convex and Computational” (T. Bisztriczky et al., eds.) Kluwer 1994, 301–333.

    Google Scholar 

  52. G. M. Ziegler: Lectures on Polytopes, Graduate TextsinMath. 152, Springer-Verlag, New York 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, The Hebrew University, 91904, Jerusalem, ISRAEL

    Gil Kalai

  2. Wirtschaftswissenschaftliche Fakultät, Universität Passau, Passau, 94032, GERMANY

    Peter Kleinschmidt

  3. Serkem GmbH, Watzmannsdorfer Ring 27, 94136 Thyrnau, GERMANY

    Günter Meisinger

Authors
  1. Gil Kalai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Kleinschmidt
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Günter Meisinger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics and Computer Science, The Hebrew University, Givat Ram, 91904, Jerusalem, Israel

    Gil Kalai

  2. Fachbereich Mathematik MA 7-1, Technische Universität Berlin, Strasse des 17. Juni 135, D-10623, Berlin, Germany

    Günter M. Ziegler

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Basel AG

About this chapter

Cite this chapter

Kalai, G., Kleinschmidt, P., Meisinger, G. (2000). Flag Numbers and FLAGTOOL. In: Kalai, G., Ziegler, G.M. (eds) Polytopes — Combinatorics and Computation. DMV Seminar, vol 29. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8438-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-8438-9_3

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-7643-6351-2

  • Online ISBN: 978-3-0348-8438-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation