Reconstruction of Finite Posets of Width Three

@misc{cintioli2026reconstruction,
  title = {{Reconstruction of Finite Posets of Width Three}},
  author = {Patrizio Cintioli},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.12690},
  eprint = {2610.12690},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.12690},
}

TY  - UNPB
TI  - Reconstruction of Finite Posets of Width Three
AU  - Patrizio Cintioli
PY  - 2026
DA  - 2026/10/08
PB  - arXiv
DO  - 10.48550/arxiv.2610.12690
UR  - https://arxiv.org/abs/2610.12690
AB  - We prove that every finite ordered set of width at most three and cardinality at least four is reconstructible from its deck. This settles the width-three part of an open problem posed by Schröder in Ordered Sets; the separate question concerning ordered sets of height one is not addressed here. The new ingredient is a criterion for recovering the marked maximal deck of an ordered set with exactly three maximal elements from its unmarked maximal deck and the isomorphism type of the suborder obtained by deleting all maximal elements. We express the criterion as an orbital balance condition on the attachment ideals in this common base. Necessity follows by double counting; sufficiency uses the structure of automorphism actions in width at most three. The full-deck theorem then follows from reconstruction results of Schröder concerning maximal cards and marked maximal cards. A local reattachment argument correcting one intermediate step in the two-maximal-element case is included in an appendix.
ER  -