ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be an integer. A group is perfect if it equals its commutator subgroup, and it has commutator width at most nn if every element can be written as a product of nn commutators. A class of groups is Q.U.P. if every ultraproduct of groups in the class is quasirandom.

Pyber's conjecture. The class of perfect groups with commutator width at most nn is Q.U.P.

The conjecture was suggested by László Pyber. It arises because the classes considered in the paper have bounded commutator width; the supplied text gives no resolution of the conjecture.

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.