Interval decomposition lattices are balanced
Preprint
Abstract
Intervals in binary or n-ary relations or other discrete structures generalize the concept of interval in a linearly ordered set. Join-irreducible partitions into intervals are characterized in the lattice of all interval decompositions of a set, in a general sense of intervals defined axiomatically. This characterization is used to show that the lattice of interval decompositions is balanced.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Notes on CD-independent subsetsActa Scientiarum Mathematicarum, 2012
- Modular decomposition and transitive orientationDiscrete Mathematics, 1999
- Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and Boolean functionsAnnals of Operations Research, 1985
- Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization1984
- On the X-join decomposition for undirected graphsDiscrete Applied Mathematics, 1979
- Course of Mathematical Logic1974
- Transitiv orientierbare GraphenActa Mathematica Hungarica, 1967
- Grundz ge einer Theorie der geordneten MengenMathematische Annalen, 1908