Pith. sign in

REVIEW

The minimum value of the Colless index

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1903.11670 v4 pith:NPHNWJ34 submitted 2019-03-27 q-bio.PE cs.DMmath.CO

The minimum value of the Colless index

classification q-bio.PE cs.DMmath.CO
keywords minimumcollessindextreesvaluebifurcatingmathcalrooted
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The Colless index is one of the oldest and most widely used balance indices for rooted bifurcating trees. Despite its popularity, its minimum value on the space $\mathcal{T}_n$ of rooted bifurcating trees with $n$ leaves is only known when $n$ is a power of 2. In this paper we fill this gap in the literature, by providing a formula that computes, for each $n$, the minimum Colless index on $\mathcal{T}_n$, and characterizing those trees where this minimum value is reached.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.