Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

The theory of convex geometries

  • Published:
Geometriae Dedicata Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Aigner, M., Combinatorial Theory, Springer-Verlag, New York, 1979.

    Google Scholar 

  2. Avann, S. P., ‘Applications of Join-Irreducible Excess Functions to Semi-modular Lattices’, Math. Ann. 142 (1961), 345–354.

    Google Scholar 

  3. Baclawski, K., ‘Cohen-Macaulay Ordered Sets’, J. Algebra 63 (1980), 226–258.

    Google Scholar 

  4. Björner, A., ‘Shellable and Cohen-Macaulay Partially Ordered Sets’, Trans. Amer. Math. Soc. 260 (1980), 159–183.

    Google Scholar 

  5. Björner, A., ‘Homotopy Type of Posets and Lattice Complementation’, J. Comb. Theory (A) 30 (1981), 90–100.

    Google Scholar 

  6. Björner, A., ‘On Matroids, Groups and Exchanges’ (preprint), Stockholm, 1983.

  7. Björner, A., Garsia, A., and Stanley, R., ‘An Introduction to Cohen-Macaulay Partially Ordered Sets’, in Ordered Sets (I. Rival (ed.)), D. Reidel, Dordrecht, 1982.

    Google Scholar 

  8. Bland, R. G. and Las Vergnas, M., ‘Orientability of Matroids’, J. Comb. Theory (B), 24 (1978), 94–123.

    Google Scholar 

  9. Cordovil, R., ‘Oriented Matroids of Rank 3 and Arrangements of Pseudolines’, Ann. Discrete Math. 17 (1983), 219–223.

    Google Scholar 

  10. Crapo, H. H., ‘Selectors’, Adv. in Math. 54 (1984), 233–277.

    Google Scholar 

  11. Danaraj, G. and Klee, V., ‘Shellings of Spheres and Polytopes’, Duke Math. J. 41 (1974), 443–451.

    Google Scholar 

  12. Dushnik, B. and Miller, E., ‘Partially Ordered Sets’, Amer. J. Math. 63 (1941), 600–610.

    Google Scholar 

  13. Dilworth, R. P., ‘Lattices with Unique Irreducible Decompositions’, Ann. Math. 41 (1940), 771–777.

    Google Scholar 

  14. Edelman, P. H., ‘The Lattice of Convex Sets of an Oriented Matroid’, J. Comb. Theory (B) 33 (1982), 239–244.

    Google Scholar 

  15. Edelman, P. H., ‘Meet-Distributive Lattices and the Anti-exchange Closure’, Alg. Univ. 10 (1980), 290–299.

    Google Scholar 

  16. Edelman, P. H., ‘Zeta Polynomials and the Möbius Function’, Europ. J. Comb. 1 (1980), 335–340.

    Google Scholar 

  17. Farber, M. and Jamison, R., ‘Convexity in Graphs and Hypergraphs’, Report CORR 83–46, University of Waterloo, 1983.

  18. Folkman, J. and Lawrence, J., ‘Oriented Matroids’, J. Comb. Theory (B) 25 (1978), 199–236.

    Google Scholar 

  19. Greene, C. and Kleitman, D. J., ‘The Structure of Sperner κ-Families’, J. Comb. Theory (A) 20 (1976), 41–68.

    Google Scholar 

  20. Goodman, J. E. and Pollack, R., ‘Helly-Type Theorems for Pseudoline Arrangements in P 2’, J. Comb. Theory (A) 32 (1982), 1–19.

    Google Scholar 

  21. Goodman, J. E. and Pollack, R., ‘On the Combinatorial Classification of Nondegenerate Configurations in the Plane’, J. Comb. Theory (A) 29 (1980), 120–235.

    Google Scholar 

  22. Goodman, J. E. and Pollack, R., ‘A Theorem of Ordered Duality’, Geom. Dedicata 12 (1982), 63–74.

    Google Scholar 

  23. Graham, R. L., Simonovitz, M. and Sos, V. T., ‘A Note on the Intersection Properties of Subsets of the Integers’, J. Comb. Theory (A) 28 (1980), 107–110.

    Google Scholar 

  24. Harary, F., Graph Theory, Addison-Wesley, London, 1969.

    Google Scholar 

  25. Hoffman, A., ‘Binding Constraints and Helly Numbers’, Ann. N.Y. Acad. Sci., Second Int. Conf. Comb. Math. 319 (1979), 284–288.

    Google Scholar 

  26. Howorka, E., ‘A Characterization of Ptolemaic Graphs; Survey of Results’, Proc. 8th SE Conf. Comb., Graph Theory and Comp., pp. 355–361.

  27. Jamison-Waldner, R. E., ‘Partition Numbers for Trees and Ordered Sets’, Pacific J. Math. 96 (1981), 115–140.

    Google Scholar 

  28. Jamison-Waldner, R. E., ‘Convexity and Block Graphs’, Congressus Numerantium 33 (1981), 129–142.

    Google Scholar 

  29. Jamison-Waldner, R. E., ‘Tietze's Convexity Theorem for Semilattices and Lattices’, Semigroup Forum 15 (1978), 357–373.

    Google Scholar 

  30. Jamison-Waldner, R. E., ‘A Perspective on Abstract Convexity: Classifying Alignments by Varieties’, in Convexity and Related Combinatorial Geometry (D. C. Kay and M. Breen (eds)), Marcel Dekker, Inc., New York, 1982.

    Google Scholar 

  31. Jamison-Waldner, R. E., ‘A Convexity Characterization of Ordered Sets’, Proc. 10th SE Conf. Comb., Graph Theory, and Comp. pp. 529–540.

  32. Jamison-Waldner, R. E., ‘Copoints in Antimatroids’, Proc. 11th SE Conf. Comb., Graph Theory, and Comput., Congressus Numerantium 29 (1980), 535–544.

    Google Scholar 

  33. Korte, B. and Lovasz, L., ‘Mathematical Structures Underlying Greedy Algorithms’, in Fundamentals of Computation Theory, Lecture Notes in Computer Science 117, Springer, Berlin, 1981, pp. 205–209.

    Google Scholar 

  34. Korte, B. and Lovasz, L., ‘Greedoids — a Structural Framework for the Greedy Algorithms’, Proc. Silver Jubilee Conf. on Combinatorics, Waterloo, June 1982, Academic Press, London.

    Google Scholar 

  35. Korte, B. and Lovasz, L., ‘Structural Properties of Greedoids’, Combinatorica 3 (1983), 359–374.

    Google Scholar 

  36. Korte, B. and Lovasz, L., ‘Shelling Structures, Convexity and a Happy End’, in Graph Theory and Combinatorics, Proceedings of the Cambridge Combinatorial Conference in honor of Paul Erdös, B. Bollobas (ed.), Academic Press, London (1984), 217–232.

    Google Scholar 

  37. Korte, B. and Lovasz, L., ‘Basis Graphs of Greedoids and Two-Connectivity’, Report No. 84324-OR, Institute of Operations Research, University of Bonn, 1984.

  38. Las Vergnas, M., ‘Convexity in Oriented Matroids’, J. Comb. Theory (B) 29 (1980), 231–243.

    Google Scholar 

  39. Rota, G.-C., ‘On the Foundations of Combinatorial Theory: I. Theory of Möbius Functions’, Z. Warsch. Verw. Gebiet 2 (1964), 340–368.

    Google Scholar 

  40. Saks, M. E. (personal communications), 1984.

  41. Stanley, R. P., ‘Combinatorial Reciprocity Theorems’, Adv. in Math. 14 (1974), 194–253.

    Google Scholar 

  42. Stanley, R. P., ‘Balanced Cohen-Macaulay Complexes’, Trans. Amer. Math. Soc. 249 (1979), 139–157.

    Google Scholar 

  43. Edelman, P. H. and Klingsberg, P., The subposet lattice and the order polynomial, Europ. J. Comb., 3 (1982), 341–346.

    Google Scholar 

  44. Berge, C., Principles of Combinatorics, Academic Press, New York, 1970.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Pennsylvania, 19104, Philadelphia, P.A., U.S.A.

    Paul H. Edelman

  2. Department of Mathematical Sciences, Clemson University, 29631, Clemson, SC, U.S.A.

    Robert E. Jamison

Authors
  1. Paul H. Edelman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert E. Jamison
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported in part by NSF Grant MCS-8301089.

Supported in part by NSF Grant ISP-8011451 (EPSCoR).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Edelman, P.H., Jamison, R.E. The theory of convex geometries. Geom Dedicata 19, 247–270 (1985). https://doi.org/10.1007/BF00149365

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00149365

Keywords

Search

Navigation