Ordered sets with small width and large jump number

DOI10.1007/BF00403404MaRDI QIDQ1074605zbMATH OpenOpenAlexFDO

Authors James H. Schmerl, Weixuan Li

Publication date 1986

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00403404

zbMATH Keywords

jump numbersordered setstower heightwidth

Mathematics Subject Classification ID

Partial orders, general (06A06)

Review text

It is shown that \(s(w,t)<(t+1)^{w-1}\) where s(w,t) is the maximum of the jump numbers s(P) over all ordered sets P with width \(w(P)=w\) and maximum tower height \(t(P)=t\). It is \(s(1,t)=0\), \(s(2,t)=t\) and \(s(P)\geq (t+1)^{w-1}\) whenever \(w(P)>w\) or \(t(P)>t\).

Recommendations

• Jump number and width
• scientific article; zbMATH DE number 4089612
• On the height and jump number of ordered sets
• On the size of jump-critical ordered sets
• On the Jump Number of Lexicographic Sums of Ordered Sets

Cites work

• Jump number of dags having Dilworth number 2

Cited in

(6)

• Jump number and width
• Fibres of width 3 ordered sets
• scientific article; zbMATH DE number 4089612 (Why is no real title available?)
• On the Jump Number of Lexicographic Sums of Ordered Sets
• On the height and jump number of ordered sets
• On the size of jump-critical ordered sets

This page was built for publication: Ordered sets with small width and large jump number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1074605)