Bull. Korean Math. Soc. 2017; 54(3): 1081-1094
Online first article April 12, 2017 Printed May 31, 2017
https://doi.org/10.4134/BKMS.b160501
Copyright © The Korean Mathematical Society.
Minseok Cheong
Korea University
For a poset $P=(X, \le_P)$, the linear discrepancy of $P$ is the minimum value of maximal differences of all incomparable elements for all possible labelings. In this paper, we find a lower bound and an upper bound of the linear discrepancy of a product of two posets. In order to give a lower bound, we use the known result, $\ld(\mathbf{m} \times \mathbf{n}) = \left\lceil \frac{mn}{2} \right\rceil -2$. Next, we use Dilworth's chain decomposition to obtain an upper bound of the linear discrepancy of a product of a poset and a chain. Finally, we give an example touching this upper bound.
Keywords: poset, product of posets, linear discrepancy
MSC numbers: 06A07
2018; 55(3): 777-788
2019; 56(1): 1-12
2017; 54(6): 1883-1891
2017; 54(4): 1373-1386
© 2022. The Korean Mathematical Society. Powered by INFOrang Co., Ltd