A Generalization of Semimodular Supersolvable Lattices
A Generalization of Semimodular Supersolvable Lattices
复制标题
半模超可解晶格的推广
DOI:
--
复制
发表时间:
1995
期刊:
影响因子:
--
通讯作者:
B. Sagan
中科院分区:
文献类型:
--
作者:
C. Bennett;B. Sagan
Stanley (Algebra Universalis 2, 1972, 197-217) introduced the notion of a supersolvable lattice, L, in part to eombinatorially explain the faetorization of its characteristic polynomial over the integers when L is also semimodular. He did this by showing that the roots of the polynomial count certain sets of atoms of the lattice. In the present work we define an object called an atom decision tree. The class of semimodular lattices with atom decision trees strictly contains the class of supersolvable lattices, but their characteristic polynomials still factor for combinatorial reasons. We then apply this notion to prove the factorization of polynomials associated with various hyperplane arrangements having non-supersolvable lattices. © 1995 Academic Press, Inc.
DOI:
--
发表时间:
2010
期刊:
影响因子:
--
作者:
Taku Ishii;Miki Hirano;Tadashi Miyazaki;Shu Kawaguchi;石井卓・平野幹・宮崎直;平之内俊郎;Takuro Abe;鈴木正俊;山崎義徳;川口周;阿部拓郎;平之内俊郎;山崎義徳;鈴木正俊;Takuro Abe
通讯作者:
Takuro Abe