The interpretation conjecture for the action of profinite words on subsets
The interpretation conjecture for the action of profinite words on subsets
Let be the finite monoid under consideration, let be its generating alphabet, let be the relevant set on which acts, and let denote the power set of . For , define its interpretation recursively by the interpretation map described in the surrounding \text. If , write for the action of on . Interpretation conjecture. For every and every ,
This conjecture proposes that the action of a profinite word on a subset of is exactly captured by multiplying the subset by its interpretation in the power-set monoid .
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.