Duffus’s A^A problem for finite ordered sets
For all finite, nonempty ordered sets and , let and denote the ordered sets of order-preserving maps and , respectively, ordered pointwise. Is sufficient to imply ?
References
- The problem for finite ordered sets — arXiv — Jonathan David Farley, George Grätzer
- Two Short Proofs of the Theorem — arXiv — George Grätze
Source: arXiv
Progress summary
A new preprint claims to solve the reconstruction problem for finite ordered sets, but no independent source has checked the proof.
Duffus’s problem asks whether isomorphic ordered sets of isotone self-maps, and , force and themselves to be isomorphic. The question originated with D. Duffus in 1978; the full reconstruction claim is now made in recent preprints.
Known results
- Duffus and Wille, 1979: proved the result for finite, nonempty, connected ordered sets.
- Farley, 2023: obtained related reconstruction results.
- A later theorem showed that if is connected and , then is connected and .
October 2026 claimed solution
On October 14, 2026, Jonathan David Farley and George Grätzer submitted a preprint claiming that implies for all finite ordered sets, with extensions to repeated exponentiation. A companion preprint gives shorter proofs, but neither source provides independent mathematical verification.
Current status (as of October 2026): Earlier connected-case results are established, while the full reconstruction theorem is claimed by preprints but remains unverified.
Solutions 0
No solutions have been posted yet.