Interval Decomposition Lattices are Balanced
Abstract: Intervals in binary or n-ary relations or other discrete structures generalize the concept of an interval in a linearly ordered set. They are defined abstractly as closed sets of a closure system on a set, satisfying certain axioms. Join-irreducible partitions into intervals are characterized in the lattice of all interval decompositions. This result is used to show that the lattice of interval decompositions is balanced, and the case when this lattice is distributive is also characterised.
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Interval Decomposition Lattices are Balanced ; volume:49 ; number:3 ; year:2016 ; pages:271-281 ; extent:11
Demonstratio mathematica ; 49, Heft 3 (2016), 271-281 (gesamt 11)
- Urheber
-
Foldes, Stephan
Radeleczki, Sándor
- DOI
-
10.1515/dema-2016-0023
- URN
-
urn:nbn:de:101:1-2411181451432.966943337349
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:25 MESZ
Datenpartner
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Foldes, Stephan
- Radeleczki, Sándor