ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an abelian group written as a sum of invariant factors

G=⨁i=1rCni,G=\bigoplus_{i=1}^r C_{n_i},

where ni∣njn_i\mid n_j if i≤ji\leq j and n1>1n_1>1. Let N1(G)N_1(G) denote the maximum length of a unique factorization indexed multiset over G∖{0}G\setminus\{0\}. Narkiewicz's conjecture.

N1(G)=∑i=1rni.N_1(G)=\sum_{i=1}^r n_i.

The conjecture gives an explicit formula for the first Narkiewicz constant. The paper says that a resolution still seems far away, although the formula is known for cyclic groups, elementary 22- and 33-groups, and groups of the form Cp2C_p^2.

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.