ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n⩾2n\geqslant 2 and let (α2,…,αn)(\alpha_2,\ldots,\alpha_n) be an (n−1)(n-1)-tuple of nonnegative integers. Let Φ\Phi be the map from words to multisets of conjugacy classes of primitive words described above. Length bound conjecture. The number of distinct lengths of conjugacy classes of words appearing in Φ(nαn…2α2)\Phi(n^{\alpha_n}\dots 2^{\alpha_2}) is at most

⌈n−12⌉.\left\lceil\frac{n-1}{2}\right\rceil.

This conjecture concerns the possible lengths of the conjugacy classes arising from the map Φ\Phi and was expressed in the second author's thesis. Its resolution is not specified in the source.

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.