arXiv · 2610.20817
The $A^A$ problem for finite ordered sets
Abstract
For ordered sets $X$ and $Y$, let $Y^X$ denote the ordered set of order-preserving maps from $X$ to $Y$, ordered pointwise. In 1984, D. Duffus asked whether $A^A\cong B^B$ forces $A\cong B$ when $A$ and $B$ are finite ordered sets. We prove that it does. The proof combines direct decompositions with an auxiliary ordering of connected ordered sets and a careful choice of intervals of maximum height. We then extend the reconstruction result to several forms of repeated exponentiation.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jonathan David Farley, George Grätzer. 2026-11-16. The $A^A$ problem for finite ordered sets. https://searcharxiv.com/abs/2610.20817
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.