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 strongly concise in GG if ∣w{G}∣<2ℵ0|w\{G\}|<2^{\aleph_0} implies that w(G)w(G) is finite. Strong conciseness conjecture. Every word is strongly concise in the class of profinite groups. This strengthens ordinary conciseness by replacing finiteness of the word-value set with cardinality strictly below the continuum; the supplied text does not state whether this conjecture has been resolved.

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.