Chain Decomposition Theorems for Ordered Sets (and Other Musings)
组合数学
2009-09-25 v1
摘要
A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can be partitioned into chains in a ``strong'' way, is proved. The result is motivated by a conjecture of Graham's concerning probability correlation inequalities for linear extensions of finite posets.
引用
@article{arxiv.math/9707220,
title = {Chain Decomposition Theorems for Ordered Sets (and Other Musings)},
author = {Jonathan David Farley},
journal= {arXiv preprint arXiv:math/9707220},
year = {2009}
}