ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite abelian group, and let ϕ(G,n)\phi(G,n) denote its phylogenetic complexity at level nn.

Eventual constancy recurrence.

ϕ(G,n+1)=max⁡(2,ϕ(G,n)).\phi(G,n+1)=\max(2,\phi(G,n)).

The paper describes this as a strengthening of its theorem that ϕ(G,⋅)\phi(G,\cdot) is eventually constant. It also notes that, apart from the case G=Z2G=\mathbb{Z}_2 and n=3n=3, the assertion is equivalent to constancy of ϕ(G,⋅)\phi(G,\cdot); it is presented as an open 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.