Interval decomposition lattices are balanced
classification
🧮 math.CO
keywords
intervalintervalsbalanceddecompositionslatticeaxiomaticallybinarycharacterization
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.