ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a group and let kk be a nonnegative integer. A kk-counter Cho automaton is a Cho automaton with kk counters whose accepted language includes the word problem of HH. A group is virtually free abelian of rank kk if it has a finite-index free abelian subgroup of rank kk.

Rank conjecture. If the word problem of HH is accepted by a 2k2k-counter or (2k+1)(2k+1)-counter Cho automaton, then HH is virtually free abelian of rank kk.

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 2k2k- or (2k+1)(2k+1)-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.