ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let AA be a finitely generated abelian group and let GG be a conjugacy separable group with separable cyclic subgroups. For groups with conjugacy depth function Conj⁡\operatorname{Conj}, write f⪯gf\preceq g when ff is bounded above by gg up to the standard comparison for conjugacy depth functions. The wreath-product lower-bound conjecture. If AA is finite, then

2n⪯Conj⁡A≀G(n).2^n \preceq \operatorname{Conj}_{A \wr G}(n).

Otherwise,

(log⁡(n))n⪯Conj⁡A≀G(n).(\log(n))^{n} \preceq \operatorname{Conj}_{A \wr G}(n).

These bounds are conjectured because the examples constructed using the paper's main theorems suggest that the obtained lower bounds cannot be relaxed. The source does not provide a resolution, so the conjecture remains open.

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.