Interval decomposition lattices are balanced

DOI10.1515/dema-2016-0023zbMath1352.06005arXiv1306.5503OpenAlexW2964149967MaRDI QIDQ305165

Stephan Foldes, Sándor Radeleczki

Publication date: 29 August 2016

Published in: Demonstratio Mathematica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.5503

zbMATH Keywords

semimodular latticeclosure systembalanced latticeinterval decompositionjoin-irreducible elementstrong set

Mathematics Subject Classification ID

Semimodular lattices, geometric lattices (06C10) Structure theory of lattices (06B05) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (1)

Resolutions of convex geometries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maeda-type decomposition of CJ-generated algebraic lattices
• The Kurosh-Ore exchange property
• Graph derivatives
• On the X-join decomposition for undirected graphs
• Modular decomposition and transitive orientation
• Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
• Über die X-Summe von gerichteten Graphen
• Course of mathematical logic. Vol. 1: Relation and logical formula. Translation edited by David Louvish
• Lattice Theory: Foundation
• On interval decomposition lattices
• STRONGNESS IN LATTICES
• Transitiv orientierbare Graphen

This page was built for publication: Interval decomposition lattices are balanced