A generalization of semimodular supersolvable lattice

DOI10.1016/0097-3165(95)90061-6zbMATH Open0831.06003OpenAlexW2123229309MaRDI QIDQ1903005FDOQ1903005

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

Recommendations

• A modular characterization of supersolvable lattices
• Some results on semimodular lattices
• scientific article
• scientific article; zbMATH DE number 1313604
• scientific article
• 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

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)

Cites Work

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

Cited In (14)

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

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)