ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let w(x1,…,xk)w(x_1,\dots,x_k) be a word in kk variables, and let GG be a profinite group. Write w{G}w\{G\} for the set of word-values of ww in GG, and w(G)=⟨w{G}⟩w(G)=\langle w\{G\}\rangle for the verbal subgroup. A word is concise in GG if finiteness of w{G}w\{G\} implies finiteness of w(G)w(G). P. Hall's conjecture. Every word is concise in the class of profinite groups. P. Hall's original conjecture that every word is concise in every group was disproved by Ivanov, but the profinite case remains open and is relevant to the study of verbal subgroups in profinite groups.

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.