One-stabilization conjecture for generating graphs of finite groups
Statement
Let be a finite group, let and be elements of , the graph of generating -tuples. Consider the tuples obtained by adjoining the identity element:
One-stabilization conjecture. The tuples and are connected in .
This is presented as an intermediate, more feasible form of Wiegold's conjecture. The statement is known for finite simple groups and finite solvable groups, but remains open for general finite 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.