A generalization of semimodular supersolvable lattice

DOI10.1016/0097-3165(95)90061-6MaRDI QIDQ1903005zbMATH OpenOpenAlexFDO

Authors Bruce E. Sagan, Curtis D. Bennett

Publication date 20 February 1996

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(95)90061-6

zbMATH Keywords

factorizationcharacteristic polynomialshyperplane arrangementssemimodular latticesupersolvable latticeatom decision tree

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Semimodular lattices, geometric lattices (06C10)

Recommendations

• A modular characterization of supersolvable lattices
• Some results on semimodular lattices
• scientific article; zbMATH DE number 6112829
• scientific article; zbMATH DE number 1313604
• scientific article; zbMATH DE number 5610899
• scientific article; zbMATH DE number 4066965
• Supermodular programming on finite lattices
• scientific article; zbMATH DE number 1013851
• A note on supermodular sublattices in finite relatively complemented lattices
• Supermodular functions on finite lattices

Cites work

• scientific article; zbMATH DE number 3815664 (Why is no real title available?)
• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 4089545 (Why is no real title available?)
• scientific article; zbMATH DE number 3759046 (Why is no real title available?)
• scientific article; zbMATH DE number 3766017 (Why is no real title available?)
• scientific article; zbMATH DE number 3771666 (Why is no real title available?)
• scientific article; zbMATH DE number 52944 (Why is no real title available?)
• scientific article; zbMATH DE number 67325 (Why is no real title available?)
• A generalization of Rota's NBC theorem
• Algebraic groups and modular Lie algebras
• Basic derivations for subarrangements of Coxeter arrangements
• Broken circuit complexes: Factorizations and generalizations
• Free arrangements of hyperplanes and supersolvable lattices
• Free arrangements of hyperplanes and unitary reflection groups
• Matroid Representations and free Arrangements
• Non-broken circuits of reflection groups and factorization in \(D_ n\)
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• Partitions into Even and Odd Block Size and Some Unusual Characters of the Symmetric Groups
• Signed graphs
• Supersolvable frame-matroid and graphic-lift lattices
• Supersolvable lattices
• The Generalized Dowling Lattices
• The Geometry of Root Systems and Signed Graphs
• Tractable partially ordered sets derived from root systems and biased graphs

Cited in

(14)

• Why the characteristic polynomial factors
• Irreducible representations of semisimple algebraic groups and supersolvable lattices.
• Note on pseudolattices, lattices and submodular linear programs
• Supersolvable LL-lattices of binary trees
• Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP
• scientific article; zbMATH DE number 6112829 (Why is no real title available?)
• scientific article; zbMATH DE number 4033805 (Why is no real title available?)
• Supersolvable frame-matroid and graphic-lift lattices
• Basic derivations for subarrangements of Coxeter arrangements
• Non-broken circuits of reflection groups and factorization in \(D_ n\)
• Left-modular elements of lattices
• Supermodular programming on lattices
• On valuations, the characteristic polynomial, and complex subspace arrangements
• A modular characterization of supersolvable lattices

This page was built for publication: A generalization of semimodular supersolvable lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1903005)