Skip to main content
SpringerLink
Log in

A Simplicial elimination scheme for ⋀-semidistributive lattices and interval collapsing

  • Original Paper
  • Published:
algebra universalis Aims and scope Submit manuscript

Abstract.

The purpose of this paper is first to show that ⋀-semidistributive lattices can be characterized by a simplicial elimination scheme in the same sense as upper locally distributive lattices or antimatroids. Secondly, we show that this elimination scheme leads to an interval collapsing algorithm and a constructing algorithm for semidistributive lattices.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. LIRMM, Université Montpellier 2, 161 rue Ada, 34392, Montpellier Cedex, France

    Philippe Janssen

  2. LIMOS, Université Blaise Pascal, Campus des czeaux, 63173, Aubire, France

    Lhouari Nourine

Authors
  1. Philippe Janssen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lhouari Nourine
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Philippe Janssen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Janssen, P., Nourine, L. A Simplicial elimination scheme for ⋀-semidistributive lattices and interval collapsing. Algebra univers. 50, 171–178 (2003). https://doi.org/10.1007/s00012-003-1833-1

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00012-003-1833-1

Mathematics Subject Classification (2000):

Keywords:

Search

Navigation