Extended Linial Hyperplane Arrangements for Root Systems and a Conjecture of Postnikov and Stanley
暂无分享,去创建一个
[1] R. Carter. REFLECTION GROUPS AND COXETER GROUPS (Cambridge Studies in Advanced Mathematics 29) , 1991 .
[2] R. Stanley. What Is Enumerative Combinatorics , 1986 .
[3] Luis Paris,et al. Combinatorics of inductively factored arrangements , 1995, Eur. J. Comb..
[4] Anders Björner,et al. Subspace Arrangements over Finite Fields: Cohomological and Enumerative Aspects , 1997 .
[5] Hiroaki Terao,et al. Generalized exponents of a free arrangement of hyperplanes and Shepherd-Todd-Brieskorn formula , 1981 .
[6] Christos A. Athanasiadis. Characteristic Polynomials of Subspace Arrangements and Finite Fields , 1996 .
[7] Alexander Postnikov. Intransitive Trees , 1997, J. Comb. Theory, Ser. A.
[8] J. Humphreys. Reflection groups and coxeter groups , 1990 .
[9] R. Stanley,et al. Supersolvable lattices , 1972 .
[10] Andreas Blass,et al. Characteristic and Ehrhart Polynomials , 1998 .
[11] Norman Biggs,et al. ON THE FOUNDATIONS OF COMBINATORIAL THEORY: COMBINATORIAL GEOMETRIES , 1972 .
[12] B. Sagan. Why the characteristic polynomial factors , 1998, math/9812136.
[13] T. Zaslavsky. Facing Up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes , 1975 .
[14] R. Stanley. Hyperplane arrangements, interval orders, and trees. , 1996, Proceedings of the National Academy of Sciences of the United States of America.
[15] Christos A. Athanasiadis,et al. Algebraic combinatorics of graph spectra, subspace arrangements and Tutte polynomials , 1996 .