Sándor Radeleczki

On interval decomposition lattices

Joint work with S. Földes (Math. Institute, Tampere University of Technology)

Intervals in binary or n-ary relations or other discrete structures generalise the concept of interval in a linearly ordered set. They are defined abstractly as closed sets of a closure system on a set V, satisfying certain axioms. Decompositions are partitions of V whose blocks are intervals, and they form an algebraic semimodular lattice. The properties of this lattice are explored.