Interval Decomposition Lattices are Balanced
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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2016-09-01
|
| Series: | Demonstratio Mathematica |
| Subjects: | |
| Online Access: | http://www.degruyter.com/view/j/dema.2016.49.issue-3/dema-2016-0023/dema-2016-0023.xml?format=INT |