On the jump number of lexicographic sums of ordered sets
Czechoslovak Mathematical Journal (2003)
- Volume: 53, Issue: 2, page 343-349
- ISSN: 0011-4642
Access Full Article
top
Abstract
topHow to cite
topJung, Hyung Chan, and Lee, Jeh Gwon. "On the jump number of lexicographic sums of ordered sets." Czechoslovak Mathematical Journal 53.2 (2003): 343-349. <http://eudml.org/doc/30781>.
@article{Jung2003,
abstract = {Let $Q$ be the lexicographic sum of finite ordered sets $Q_x$ over a finite ordered set $P$. For some $P$ we can give a formula for the jump number of $Q$ in terms of the jump numbers of $Q_x$ and $P$, that is, $s(Q)=s(P)+ \sum _\{x\in P\} s(Q_x)$, where $s(X)$ denotes the jump number of an ordered set $X$. We first show that $w(P)-1+\sum _\{x\in P\} s(Q_x)\le s(Q) \le s(P)+ \sum _\{x\in P\} s(Q_x)$, where $w(X)$ denotes the width of an ordered set $X$. Consequently, if $P$ is a Dilworth ordered set, that is, $s(P) = w(P)-1$, then the formula holds. We also show that it holds again if $P$ is bipartite. Finally, we prove that the lexicographic sum of certain jump-critical ordered sets is also jump-critical.},
author = {Jung, Hyung Chan, Lee, Jeh Gwon},
journal = {Czechoslovak Mathematical Journal},
keywords = {ordered set; jump (setup) number; lexicographic sum; jump-critical; ordered set; jump number; lexicographic sum; jump-critical set},
language = {eng},
number = {2},
pages = {343-349},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {On the jump number of lexicographic sums of ordered sets},
url = {http://eudml.org/doc/30781},
volume = {53},
year = {2003},
}
TY - JOUR
AU - Jung, Hyung Chan
AU - Lee, Jeh Gwon
TI - On the jump number of lexicographic sums of ordered sets
JO - Czechoslovak Mathematical Journal
PY - 2003
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 53
IS - 2
SP - 343
EP - 349
AB - Let $Q$ be the lexicographic sum of finite ordered sets $Q_x$ over a finite ordered set $P$. For some $P$ we can give a formula for the jump number of $Q$ in terms of the jump numbers of $Q_x$ and $P$, that is, $s(Q)=s(P)+ \sum _{x\in P} s(Q_x)$, where $s(X)$ denotes the jump number of an ordered set $X$. We first show that $w(P)-1+\sum _{x\in P} s(Q_x)\le s(Q) \le s(P)+ \sum _{x\in P} s(Q_x)$, where $w(X)$ denotes the width of an ordered set $X$. Consequently, if $P$ is a Dilworth ordered set, that is, $s(P) = w(P)-1$, then the formula holds. We also show that it holds again if $P$ is bipartite. Finally, we prove that the lexicographic sum of certain jump-critical ordered sets is also jump-critical.
LA - eng
KW - ordered set; jump (setup) number; lexicographic sum; jump-critical; ordered set; jump number; lexicographic sum; jump-critical set
UR - http://eudml.org/doc/30781
ER -
References
top- 10.1016/S0167-5060(08)70060-8, Ann. Discrete Math. 9 (1980), 189–194. (1980) MR0597371DOI10.1016/S0167-5060(08)70060-8
- 10.2307/1969503, Ann. Math. 51 (1950), 161–166. (1950) Zbl0038.02003MR0032578DOI10.2307/1969503
- 10.1137/0606069, SIAM J. Alg. Disc. Math. 6 (1985), 713–720. (1985) MR0801000DOI10.1137/0606069
- 10.1007/BF00396268, Order 1 (1984), 3–5. (1984) MR0745584DOI10.1007/BF00396268
- Comparability invariants, Ann. Discrete Math. 23 (1984), 371–386. (1984) Zbl0561.05046MR0779861
- 10.1016/0012-365X(87)90006-9, Discrete Math. 63 (1987), 157–182. (1987) MR0885495DOI10.1016/0012-365X(87)90006-9
- On the products of some posets: jump number, greediness, Ars Combin. 40 (1995), 109–120. (1995) MR1352773
- 10.4064/fm-16-1-386-389, Fund. Math. 16 (1930), 386–389. (1930) DOI10.4064/fm-16-1-386-389
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.