← All problems

Duffus’s A^A problem for finite ordered sets

For all finite, nonempty ordered sets AA and BB, let AAA^A and BBB^B denote the ordered sets of order-preserving maps A→AA\to A and B→BB\to B, respectively, ordered pointwise. Is AA≅BBA^A\cong B^B sufficient to imply A≅BA\cong B?

References

Source: arXiv

Progress summary

Refreshed
Open · solution reported

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, AAA^A and BBB^B, force AA and BB 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 PP is connected and PP≅QQP^P \cong Q^Q, then QQ is connected and P≅QP \cong Q.

October 2026 claimed solution

On October 14, 2026, Jonathan David Farley and George Grätzer submitted a preprint claiming that AA≅BBA^A \cong B^B implies A≅BA \cong B 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.

Sources

Solutions 0

No solutions have been posted yet.