Relative blocking in posets

Simple item page
dc.creatorMatveev, Andrey O.
dc.date2004-11-01
dc.date2008-12-14
dc.date.accessioned2026-07-07T12:12:32Z
dc.date.available2026-07-07T12:12:32Z
dc.descriptionPoset-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.
dc.description29 pages. Corrected version of original publication which is available at http://www.springerlink.com, see Corrigendum
dc.identifierhttps://arxiv.org/abs/math/0411026
dc.identifierhttp://arxiv.org/abs/math/0411026
dc.identifierJournal of Combinatorial Optimization, Volume 13 (2007), Issue 4, Pages 379-403
dc.identifierdoi:10.1007/s10878-006-9028-2
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/210574
dc.subjectCombinatorics
dc.subject05A05, 06A07, 11B57, 90C27
dc.titleRelative blocking in posets
dc.typetext

Files

Collections

arXiv