The rank conjecture for groups recognised by Cho automata
Statement
Let be a group and let be a nonnegative integer. A -counter Cho automaton is a Cho automaton with counters whose accepted language includes the word problem of . A group is virtually free abelian of rank if it has a finite-index free abelian subgroup of rank .
Rank conjecture. If the word problem of is accepted by a -counter or -counter Cho automaton, then is virtually free abelian of rank .
This is the proposed strengthening of the lower-bound statement discussed immediately beforehand: the known argument gives virtual free abelianness of rank at most the counter parameter, while this conjecture predicts an exact rank under the stated - or -counter hypothesis. The source gives no resolution.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.