18.315 | Fall 2004 | Graduate

Combinatorial Theory: Hyperplane Arrangements

Readings

Below is a bibliography for Hyperplane Arrangements.

Athanasiadis, C. A. “Algebraic Combinatorics of Graph Spectra, Subspace Arrangements and Tutte Polynomials.” Ph.D. Thesis, MIT, 1996.

———. “Characteristic Polynomials of Subspace Arrangements and Finite Fields.” Advances in Math. 122 (1996): 193-233.

Barcelo, H., and E. Ihrig. “Lattices of Parabolic Subgroups in Connection with Hyperplane Arrangements.” J. Algebraic Combinatorics 9 (1999): 5-24.

Björner, A., and F. Brenti. Combinatorics of Coxeter Groups. (To appear)

Björner, A., M. Las Vergnas, B. Sturmfels, N. White, and G. Ziegler. Oriented Matroids. 2nd ed_. Encyclopedia of Mathematics and Its Applications_ 46_._ Cambridge: Cambridge University Press, 1999.

Blass, A., and B. Sagan. “Characteristic and Ehrhart Polynomials.” J. Algebraic Combinatorics 7 (1998): 115-126.

Bourbaki, N. “Groupes et Algèbres de Lie.” Éléments de Mathématique, Fasc. 34. Paris: Hermann, 1968.

Chandon, J. L., J. Lemaire, and J. Pouget. “Dénombrement des Quasi-ordres sur un Ensemble fini.” Math. Inform. Sci. Humaines 62 (1978): 61-80, 83.

Crapo, H., and G.-C. Rota. On the Foundations of Combinatorial Theory: Combinatorial Geometries. Preliminary edition. Cambridge, MA: MIT Press, 1970.

Fishburn, P. C. Interval Orders and Interval Graphs. New York: Wiley-Interscience, 1985.

Greene, C. “On the Möbius Algebra of a Partially Ordered Set.” Advances in Math. 10 (1973): 177-187.

Humphreys, J. E. Reflection Groups and Coxeter Groups. Cambridge: Cambridge University Press, 1990.

Orlik, P., and H. Terao. Arrangements of Hyperplanes. Berlin: Springer-Verlag, 1992.

Postnikov, A., and R. Stanley. “Deformations of Coxeter Hyperplane Arrangements.” J. Combinatorial Theory (A) 91 (2000): 544-597.

Shi, J.-Y. “The Kazhdan-Lusztig Cells in Certain Affine Weyl Groups.” Lecture Notes in Mathematics. Vol. 1179. Berlin: Springer-Verlag, 1986.

Stanley, R. “Modular Elements of Geometric Lattices.” Algebra Universalis 1 (1971): 214-217.

———. “Supersolvable Lattices.” Algebra Universalis 2 (1972): 197-217.

———. Enumerative Combinatorics. Vol. 1. Pacific Grove, CA: Wadsworth and Brooks/Cole, 1986. Second printing, Cambridge: Cambridge University Press, 1996.

———. Enumerative Combinatorics. Vol. 2. Cambridge: Cambridge University Press, 1999.

———. “Hyperplane Arrangements, Interval Orders, and Trees.” Proc. Nat. Acad. Sci. 93 (1996): 2620-2625.

Terao, H. “Free Arrangements of Hyperplanes and Unitary Reflection Groups.” Proc. Japan Acac., Ser. A 56 (1980): 389-392.

———. “Generalized Exponents of a Free Arrangement of Hyperplanes and Shepherd[sic]-Todd-Brieskorn Formula.” Invent. Math. 63 (1981): 159-179.

Trotter, W. T. Combinatorics and Partially Ordered Sets. Baltimore/London: The Johns Hopkins Univ. Press, 1992.

Wine, R. L., and J. E. Freund. “On the Enumeration of Decision Patterns Involving n Means.” Ann. Math. Stat. 28: 256-259.

Course Info

Departments
As Taught In
Fall 2004
Level
Learning Resource Types
Lecture Notes
Problem Sets