ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be an odd prime and let ii be a positive integer. For n≥2in\geq 2i, define

Ti(n)=(p−1)(2E(i)pn−(⌊i/2⌋+2)+(n−2i)pi−1),T_i(n)=(p-1)\left(2^{E(i)}p^{n-(\left\lfloor i/2\right\rfloor+2)}+(n-2i)p^{i-1}\right),

where E(i)E(i) is 11 if ii is even and 00 if it is odd. Let SK1(Z[Cpn×Cpn])SK_1(\mathbb Z[C_{p^n}\times C_{p^n}]) be the Whitehead group under consideration. Multiplicity conjecture. For an integer n≥2n\geq 2 and an odd prime pp, the multiplicity of CpiC_{p^i}, for 0<i<n0<i<n, in the decomposition of SK1(Z[Cpn×Cpn])SK_1(\mathbb Z[C_{p^n}\times C_{p^n}]) as a product of cyclic groups is Ti(n)T_i(n) if 2i≤n2i\leq n, and Tn−i(2(n−i))T_{n-i}(2(n-i)) otherwise. In particular, the multiplicity of CpC_p is T1(n)=(pn−2+n−2)(p−1)T_1(n)=(p^{n-2}+n-2)(p-1), while the multiplicity of Cpn−1C_{p^{n-1}} is always T1(2)=p−1T_1(2)=p-1. The conjecture is motivated by explicit computations for n=2,3,4,5,6n=2,3,4,5,6; the exponent is known to be pn−1p^{n-1}, so the multiplicity of CpnC_{p^n} is zero. The general decomposition remains conjectural.

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.