A Non-Messing-Up Phenomenon for Posets

Simple item page
dc.creatorTenner, Bridget Eileen
dc.date2004-04-22
dc.date2005-10-17
dc.date.accessioned2026-07-07T06:36:43Z
dc.date.available2026-07-07T06:36:43Z
dc.descriptionWe classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along both sets of chains, the labels of the chains in the first set remain sorted. We also characterize posets with more restrictive sorting properties.
dc.identifierhttps://arxiv.org/abs/math/0404396
dc.identifierhttp://arxiv.org/abs/math/0404396
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/100177
dc.subjectCombinatorics
dc.subject06A07; 05A05; 05C30
dc.titleA Non-Messing-Up Phenomenon for Posets
dc.typetext

Files

Collections

arXiv