TUTCRIS - Tampereen teknillinen yliopisto

TUTCRIS

Interval decomposition lattices are balanced

Tutkimustuotosvertaisarvioitu

Standard

Interval decomposition lattices are balanced. / Foldes, Stephane; Radeleczki, Sándor.

julkaisussa: DEMONSTRATIO MATHEMATICA, Vuosikerta 49, Nro 3, 01.09.2016, s. 271-281.

Tutkimustuotosvertaisarvioitu

Harvard

Foldes, S & Radeleczki, S 2016, 'Interval decomposition lattices are balanced', DEMONSTRATIO MATHEMATICA, Vuosikerta. 49, Nro 3, Sivut 271-281. https://doi.org/10.1515/dema-2016-0023

APA

Foldes, S., & Radeleczki, S. (2016). Interval decomposition lattices are balanced. DEMONSTRATIO MATHEMATICA, 49(3), 271-281. https://doi.org/10.1515/dema-2016-0023

Vancouver

Foldes S, Radeleczki S. Interval decomposition lattices are balanced. DEMONSTRATIO MATHEMATICA. 2016 syys 1;49(3):271-281. https://doi.org/10.1515/dema-2016-0023

Author

Foldes, Stephane ; Radeleczki, Sándor. / Interval decomposition lattices are balanced. Julkaisussa: DEMONSTRATIO MATHEMATICA. 2016 ; Vuosikerta 49, Nro 3. Sivut 271-281.

Bibtex - Lataa

@article{fc6256287ef44b6e9b59c16f5f50c4e2,
title = "Interval decomposition lattices are balanced",
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 characterised.",
keywords = "Balanced lattice, Closure system, Interval decomposition, Join-irreducible element, Semimodular lattice, Strong set",
author = "Stephane Foldes and S{\'a}ndor Radeleczki",
year = "2016",
month = "9",
day = "1",
doi = "10.1515/dema-2016-0023",
language = "English",
volume = "49",
pages = "271--281",
journal = "DEMONSTRATIO MATHEMATICA",
issn = "0420-1213",
publisher = "Politechnika Warszawska",
number = "3",

}

RIS (suitable for import to EndNote) - Lataa

TY - JOUR

T1 - Interval decomposition lattices are balanced

AU - Foldes, Stephane

AU - Radeleczki, Sándor

PY - 2016/9/1

Y1 - 2016/9/1

N2 - 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 characterised.

AB - 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 characterised.

KW - Balanced lattice

KW - Closure system

KW - Interval decomposition

KW - Join-irreducible element

KW - Semimodular lattice

KW - Strong set

U2 - 10.1515/dema-2016-0023

DO - 10.1515/dema-2016-0023

M3 - Article

VL - 49

SP - 271

EP - 281

JO - DEMONSTRATIO MATHEMATICA

JF - DEMONSTRATIO MATHEMATICA

SN - 0420-1213

IS - 3

ER -