Skip to main content
SpringerLink
Log in

Free hyperplane arrangements betweenA n−1 andB n

  • Published:
Mathematische Zeitschrift 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

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

Instant access to the full article PDF.

Institutional subscriptions

References

  • [BZ] Björner, A., Ziegler, G.: Broken circuit complexes: factorizations and generalizations. J. Comb. Theory, Ser. B2, 214–217 (1992)

    Google Scholar 

  • [CH] Chvátal, V., Hammer, P.L.: Aggregation of inequalities in integer programming. Ann. Discrete Math.1, 145–162 (1977)

    Article  Google Scholar 

  • [Di] Dirac, G.A.: On rigid circuit graphs. Abh. Math. Semin. Univ. Hamburg25, 71–76 (1961)

    MATH  MathSciNet  Google Scholar 

  • [ER] Edelman, P.H., Reiner, V.: A counterexample to Orlik's conjecture. Proc. Am. Math. Soc.118, 927–929 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  • [FG] Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pac. J. Math.15, 835–855 (1965)

    MATH  MathSciNet  Google Scholar 

  • [Go] Golumbic, M.: Algorithmic graph theory and perfect graphs. New York: Academic Press 1980

    MATH  Google Scholar 

  • [HIS] Hammer, P.L., Ibaraki, T., Siméone, B.: Threshold sequences. SIAM J. Algebraic Discrete Methods2, 39–49 (1981)

    MATH  MathSciNet  Google Scholar 

  • [JS] Jósefiak, T., Sagan, B.: Basic derivations for subarrangements of Coxeter arrangements. J. Algebraic Combinatorics2, 291–320 (1993)

    Article  Google Scholar 

  • [Or] Orlik, P.: Introduction to Arrangements. (CBMS Ser., no. 72) Providence, RI: Am. Math. Soc. 1989

    Google Scholar 

  • [OT] Orlik, P., Terao, H.: Arrangements of hyperplanes. Berlin, Heidelberg, New York: Springer 1992

    MATH  Google Scholar 

  • [St1] Stanley, R.P.: Supersolvable lattices. Algebra Univers.2, 197–217 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  • [St2] Stanley, R.P.: Enumerative Combinatorics, vol. I. Monterey, CA: Wadsworth & Brooks/Cole 1986

    Google Scholar 

  • [Te] Terao, H.: Modular elements of lattices and topological fibration. Adv. Math.62, 135–154 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  • [Th] Thrall, R.M.: A combinatorial problem. Mich. J. Math.1, 81–88 (1952)

    Article  MATH  MathSciNet  Google Scholar 

  • [Za] Zaslavsky, T.: The geometry of root systems and signed graphs. Am. Math. Monthly88, 88–105 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  • [Zi] Ziegler, G.: Matroid representations and free arrangements. Trans. Am. Math. Soc.320, 525–541 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics, University of Minnesota, 55455, Minneapolis, MN, USA

    Paul H. Edelman & Victor Reiner

Authors
  1. Paul H. Edelman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Victor Reiner
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Partially supported by NSF grant DMS-9201490

Partially supported by an NSF Postdoctoral Fellowship

Rights and permissions

Reprints and permissions

About this article

Cite this article

Edelman, P.H., Reiner, V. Free hyperplane arrangements betweenA n−1 andB n . Math Z 215, 347–365 (1994). https://doi.org/10.1007/BF02571719

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Keywords

Search

Navigation