Simplicial elimination schemes, extremal lattices and maximal antichain lattices
type: Item
instance of: scholarly article
title: Simplicial elimination schemes, extremal lattices and maximal antichain lattices
zbMATH Open document ID: 0859.06005
DOI: 10.1007/BF00389839
author: M. Morvan
author: Lhouari Nourine
published in: Order
publication date: 1997-04-07T00:00:00Z
Mathematics Subject Classification ID: 06A06
Mathematics Subject Classification ID: 06D99
Mathematics Subject Classification ID: 06B99
Mathematics Subject Classification ID: 03E20
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 947532
zbMATH Keywords: finite partially ordered set
zbMATH Keywords: bipartite orders
zbMATH Keywords: lattice of maximal antichains
zbMATH Keywords: poset of irreducibles
zbMATH Keywords: strong simplicial elimination scheme
zbMATH Keywords: extremal lattices
zbMATH Keywords: greedy algorithms
zbMATH Keywords: distributivity checking
zbMATH Keywords: lattice recognition
zbMATH Keywords: jump number computation
Wikidata QID: Q40664393
MaRDI profile type: Publication
cites work: A linear time and space algorithm to recognize interval orders
cites work: Q3804752
cites work: Q5841991
cites work: Q5581652
cites work: Q3890731
cites work: Q3360916
cites work: Computing on-line the lattice of maximal antichains of posets
cites work: Q4055674
cites work: The Factorization and Representation of Lattices
cites work: Primes, irreducibles and extremal lattices
cites work: Q3142965
cites work: Boolean and distributive ordered sets: Characterization and representation by sets
cites work: The jump number and the lattice of maximal antichains
cites work: Q3952147
full work available at URL: https://doi.org/10.1007/bf00389839
OpenAlex ID: W2069446057
description: scientific article; zbMATH DE number 947532