A non-messing-up phenomenon for posets

DOI10.1007/S00026-007-0308-ZzbMATH Open1114.06003arXivmath/0404396OpenAlexW2099643326MaRDI QIDQ880929FDOQ880929

Authors: Bridget Eileen Tenner 

Publication date: 21 May 2007

Published in: Annals of Combinatorics (Search for Journal in Brave)

Abstract: We 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.

Full work available at URL: https://arxiv.org/abs/math/0404396

Recommendations

• scientific article; zbMATH DE number 966840
• A counterexample about poset reconstruction
• scientific article; zbMATH DE number 2099597
• THE FIXED POINT PROPERTY FOR SUMS OF POSETS
• A fixed-point theorem for \(R\)-posets
• Total nonnegativity and (3+1)-free posets
• scientific article; zbMATH DE number 2052742
• Persistence Over Posets
• Axiomatisability problems for \(S\)-posets
• On Quillen's theorem A for posets

zbMATH Keywords

partially ordered setsortinglinear extensionnon-messing-up

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Combinatorics of partially ordered sets (06A07)

Cited In (5)

• Strong convergence in posets
• A \(\Delta^{0}_{2}\)-poset with no positive presentation
• A non-iterative formula for straightening fillings of Young diagrams
• A counterexample about poset reconstruction
• Sort-invariant non-messing-up

This page was built for publication: A non-messing-up phenomenon for posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q880929)