Order-condition characterization of affine interval exchange codings

From papers

Let WW be a set of words, let F(W)F(W) denote the associated object, and let (<A,<D)(<_A,<_D) be the pair of orders used in the order condition. Order-condition characterization conjecture. F(W)F(W)) satisfies the order condition for (<A,<D)(<_A,<_D) if and only if WW is produced, through the natural coding, by an affine interval exchange transformation with the same orders. The statement is presented as an unresolved question about the optimality and characterization of the interval-exchange construction; no resolution is supplied in the source.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Sébastien Ferenczi and Luca Q. Zamboni, “Clustering, order conditions, and languages of interval exchanges”, arXiv:2507.17370 (2026).

Solutions 0

No solutions have been posted yet.