A factorization theorem of characteristic polynomials of convex geometries

DOI10.1007/S00026-007-0303-4MaRDI QIDQ880923zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 21 May 2007

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00026-007-0303-4

zbMATH Keywords

closure systemchordal graphstrongly connectedbroken circuitNBC complex

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorics of partially ordered sets (06A07) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Axiomatic and generalized convexity (52A01) Semimodular lattices, geometric lattices (06C10)

Recommendations

• The theory of convex geometries
• Why the characteristic polynomial factors
• Description of closure operators in convex geometries of segments on the line
• Representing finite convex geometries by relatively convex sets
• Properties of the copoint graph of convex geometries

Cited in

(1)

• Pruning processes and a new characterization of convex geometries

This page was built for publication: A factorization theorem of characteristic polynomials of convex geometries

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