Identity conjecture for words with countably many profinite values
Identity conjecture for words with countably many profinite values
Let be a group-word and a profinite group. Suppose that the set of -values in is countable. Identity conjecture. Then satisfies a nontrivial group identity. The paper presents this as a potentially more tractable conjecture than the preceding finiteness conjecture, and gives no resolution.
Sources & referencesView supporting material
Primary source
Cristina Acciarri and Pavel Shumyatsky, “Coverings of commutators in profinite groups”, arXiv:1511.07843 (2015).
Progress summary
Never refreshed
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.