The jump number and the lattice of maximal antichains
type: Item
instance of: scholarly article
title: The jump number and the lattice of maximal antichains
zbMATH Open document ID: 0731.06003
DOI: 10.1016/0012-365X(91)90016-U
author: Klaus Reuter
published in: Discrete Mathematics
publication date: 1991-01-01T00:00:00Z
review text: The author explains the relation between the jump number s(P) and the length of the lattice of maximal antichains l(MA(P)) of an ordered set P: \[ | P| -l(MA(P))-1\leq s(P)\leq | P| -l(MA(P)). \] If P has height one or is N-free, then s(P) equals \(| P| -l(MA(P))\).
Mathematics Subject Classification ID: 06A07
Mathematics Subject Classification ID: 06A06
zbMATH DE Number: 4208124
zbMATH Keywords: jump number
zbMATH Keywords: length of the lattice of maximal antichains
MaRDI profile type: Publication
cites work: Q3804752
cites work: Q4918389
cites work: Q3890731
cites work: The Jump Number of Dags and Posets: An Introduction
cites work: Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
cites work: Algorithmic Approaches to Setup Minimization
cites work: Interval orders without odd crowns are defect optimal
cites work: Setup optimization problems with matroid structure
cites work: S-verklebte Summen von Verbänden
cites work: Optimal Linear Extensions by Interchanging Chains
cites work: Jump number problem: The role of matroids
cites work: Q3952147
cites work: Q3698849
cites work: Q3676181
full work available at URL: 0012-365x(91)90016-u
OpenAlex ID: W2082567911
description: scientific article; zbMATH DE number 4208124