Relative blocking in posets
Combinatorics
2008-12-15 v7
Abstract
Poset-theoretic generalizations of set-theoretic committee constructions are presented. The structure of the corresponding subposets is described. Sequences of irreducible fractions associated to the principal order ideals of finite bounded posets are considered and those related to the Boolean lattices are explored; it is shown that such sequences inherit all the familiar properties of the Farey sequences.
Cite
@article{arxiv.math/0411026,
title = {Relative blocking in posets},
author = {Andrey O. Matveev},
journal= {arXiv preprint arXiv:math/0411026},
year = {2008}
}
Comments
29 pages. Corrected version of original publication which is available at http://www.springerlink.com, see Corrigendum