Interval Decomposition Lattices are Balanced

  title={Interval Decomposition Lattices are Balanced},
  author={Stephan Foldes and S{\'a}ndor Radeleczki},
  journal={Demonstratio Mathematica},
  pages={271 - 281}
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… 

Resolutions of Convex Geometries

Convex geometries (Edelman and Jamison, 1985) are finite combinatorial structures dual to union-closed antimatroids or learning spaces.  We define an operation of resolution for convex geometries,



Semimodular Lattices: Theory and Applications

Preface 1. From Boolean algebras to semimodular lattices 2. M-symmetric lattices 3. Conditions related to semimodularity, 0-conditions and disjointness properties 4. Supersolvable and admissible

Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and Boolean functions

A broad treatment of the design of algorithms to compute the decomposition possibilities for a large class of discrete structures, including the substitution decomposition, and it is shown that for arbitrary relations the composition tree can be constructed in polynomial time.

Maeda-type Decomposition of CJ-generated Algebraic Lattices

We prove necessary and sufficient conditions for the decomposition of an arbitrary CJ-generated algebraic lattice into a direct product of subdirectly irreducible lattices. We generalize earlier

Present Problems about Intervals in Relation-Theory and Logic

On the X-join decomposition for undirected graphs


1. Preliminaries Let L be a lattice. If L contains a least or a greatest element, these elements will be denoted by 0 or 1, respectively. An element u G L — {0} is called join-irreducible iff, for

Lattice Theory: Foundation

Preface.- Introduction.- Glossary of Notation.- I First Concepts.- 1 Two Definitions of Lattices.- 2 How to Describe Lattices.- 3 Some Basic Concepts.- 4 Terms, Identities, and Inequalities.- 5 Free

On interval decomposition lattices

Graph derivatives