TOPICS
Search

Poset Reconstruction


Poset reconstruction is the determination of a finite partially ordered set, up to order isomorphism, from its deck. The deck is the multiset of order isomorphism types of the induced partially ordered sets obtained by deleting one element at a time (Cintioli 2026).

Cintioli (2026) proved that every partially ordered set with at least four elements and width at most three is reconstructible from its deck. Here width is the maximum number of elements in an antichain. The theorem does not settle reconstruction for arbitrary width. Cintioli (2026) attributes discovery and development of the proof to ChatGPT, with adversarial review by Claude, and assumes responsibility for its correctness.


See also

Antichain, Graph Reconstruction Conjecture, Order Isomorphic, Order Isomorphism, Partially Ordered Set, Poset Power

Explore with Wolfram|Alpha

References

Cintioli, P. "Reconstruction of Finite Posets of Width Three." 8 Oct 2026. https://arxiv.org/abs/2610.12690.

Cite this as:

Weisstein, Eric W. "Poset Reconstruction." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/PosetReconstruction.html

Subject classifications