The interpretation conjecture for the action of profinite words on subsets

Let MM be the finite monoid under consideration, let XX be its generating alphabet, let RR be the relevant set on which Omega(X) Omega(X) acts, and let P(M)P(M) denote the power set of MM. For τΩ(X) \tau\in\Omega(X), define its interpretation τΛP(M) \tau\Lambda\in P(M) recursively by the interpretation map described in the surrounding \text. If YRY\subseteq R, write YτY\cdot\tau for the action of τ \tau on YY. Interpretation conjecture. For every τΩ(X) \tau\in\Omega(X) and every YRY\subseteq R,

Yτ=Y(τΛ).Y\cdot\tau=Y(\tau\Lambda).

This conjecture proposes that the action of a profinite word on a subset of RR is exactly captured by multiplying the subset by its interpretation in the power-set monoid P(M)P(M).

Sources & referencesView supporting material

Primary source

Karsten Henckell, John Rhodes and Benjamin Steinberg, “An Effective Lower Bound for Group Complexity of Finite Semigroups and Automata”, arXiv:0812.3499 (2008).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.