A minimal compact description of the diversity index polytope

Kerry Manson; Martin Frohn

arxiv: 2409.15641 · v2 · submitted 2024-09-24 · 🧮 math.OC · q-bio.PE

A minimal compact description of the diversity index polytope

Martin Frohn , Kerry Manson This is my paper

Pith reviewed 2026-05-23 21:13 UTC · model grok-4.3

classification 🧮 math.OC q-bio.PE

keywords phylogenetic diversity indicesdiversity index polytopeconvex hullbinary treesbiodiversity measurementcombinatoricspolyhedral description

0 comments

The pith

The diversity index polytope admits a minimal compact description from the combinatorics of phylogenetic diversity indices on binary trees.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper studies how phylogenetic diversity indices apportion total biodiversity across species on an edge-weighted binary tree. It uses the combinatorial structure of these indices to derive a minimal compact description of the diversity index polytope, the convex hull of all possible index images. A sympathetic reader would care because the description replaces explicit enumeration of indices or trees with a compact representation that captures all possible biodiversity allocations. The work also examines extensions of the polytope for broader biodiversity studies.

Core claim

By examining the combinatorics of phylogenetic diversity indices on binary edge-weighted trees, the authors obtain a minimal compact description of the diversity index polytope defined as the convex hull of the images of these indices.

What carries the argument

The diversity index polytope, the convex hull of images of phylogenetic diversity indices that apportion biodiversity on binary edge-weighted trees.

Load-bearing premise

The combinatorics of phylogenetic diversity indices on binary edge-weighted trees admits a minimal compact description of the convex hull of their images.

What would settle it

For a small fixed number of leaves, explicitly enumerate all phylogenetic diversity indices, compute their convex hull by standard methods, and check whether the resulting polytope matches the minimal compact description.

read the original abstract

A phylogenetic tree is an edge-weighted binary tree, with leaves labelled by a collection of species, that represents the evolutionary relationships between those species. For such a tree, a phylogenetic diversity index is a function that apportions the biodiversity of the collection across its constituent species. The diversity index polytope is the convex hull of the images of phylogenetic diversity indices. We study the combinatorics of phylogenetic diversity indices to provide a minimal compact description of the diversity index polytope. Furthermore, we discuss extensions of the polytope to expand the study of biodiversity measurement.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The abstract claims a minimal compact description of the diversity index polytope via combinatorics on binary trees, but supplies zero inequalities, proofs, or comparisons, so the actual contribution cannot be judged yet.

read the letter

The core point is that this paper sets out to characterize the convex hull of phylogenetic diversity indices on edge-weighted binary trees and to give what it calls a minimal compact description of that polytope. It also flags some extensions toward biodiversity measurement. That is the entire substance visible so far. If the description turns out to be both new and short, it could be handy for people who need to optimize or enumerate over these indices. The extension discussion at least shows the authors are thinking past the pure polytope question. Beyond that, the abstract contains no facet list, no proof sketch, and no citation to earlier polyhedral work on similar objects, so there is nothing concrete to credit or to test. The main soft spot is exactly this absence of evidence: the claim of minimality and compactness cannot be checked, and it is impossible to know whether the result improves on or repeats existing combinatorial descriptions of related polytopes. The paper sits squarely inside phylogenetic combinatorics and polyhedral methods applied to biology. Readers who already work on diversity indices or on tree polytopes might extract something useful once the actual inequalities appear. For anyone outside that narrow intersection the payoff looks small. The work deserves a serious referee because the stated goal is precise and the setting is well-defined, even though the current draft gives almost no material to referee. An editor should send it out so the combinatorics and the proof of minimality can be examined directly.

Referee Report

1 major / 0 minor

Summary. The paper studies the combinatorics of phylogenetic diversity indices on binary edge-weighted trees to provide a minimal compact description of the diversity index polytope, defined as the convex hull of the images of these indices. It also discusses extensions of the polytope for biodiversity measurement.

Significance. A verified minimal compact description of the polytope could contribute to combinatorial methods in mathematical biology and optimization of biodiversity indices. However, the manuscript as presented supplies no theorems, derivations, facet descriptions, or proofs, so significance cannot be assessed.

major comments (1)

[Abstract] Abstract: The abstract states the goal of studying the combinatorics but supplies no derivations, proofs, or evidence of any minimal compact description (e.g., no facet inequalities, combinatorial characterization, or proof of minimality); the central claim cannot be evaluated.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their comments on our manuscript. We address the single major comment below.

read point-by-point responses

Referee: [Abstract] Abstract: The abstract states the goal of studying the combinatorics but supplies no derivations, proofs, or evidence of any minimal compact description (e.g., no facet inequalities, combinatorial characterization, or proof of minimality); the central claim cannot be evaluated.

Authors: The abstract is a concise summary and is not intended to contain derivations or proofs. The full manuscript develops the combinatorics of phylogenetic diversity indices on binary edge-weighted trees and supplies the minimal compact description of the diversity index polytope, including explicit facet inequalities, a combinatorial characterization, and proofs of minimality. These appear in the body of the paper (beyond the abstract). We are prepared to revise the abstract to include forward references to the specific theorems and inequalities if that would assist evaluation. revision: partial

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The abstract states the goal of studying combinatorics of phylogenetic diversity indices on binary edge-weighted trees to describe the convex hull of their images, but supplies no equations, theorems, facet inequalities, or constructions. No load-bearing steps, self-citations, fitted parameters renamed as predictions, or self-definitional reductions are present in the provided text. The claimed minimal compact description cannot be examined for equivalence to inputs, so the derivation is treated as self-contained with no circularity.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

No information in the abstract to populate free parameters, axioms, or invented entities.

pith-pipeline@v0.9.0 · 5608 in / 785 out tokens · 21459 ms · 2026-05-23T21:13:06.532457+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We study the combinatorics of phylogenetic diversity indices to provide a minimal compact description of the diversity index polytope.
IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

The diversity index polytope is the convex hull of the images of phylogenetic diversity indices.

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

11 extracted references · 11 canonical work pages

[1]

Ben-Tal, A

A. Ben-Tal, A. Nemirovski, and L. E. Ghaoui , Robust Optimization , Princeton University Press, 2009

work page 2009
[2]

Problems in theoretical cybernetics

G. Bolotashvili and M. Kovalev , The partial order polytope , Proceedings of the VIII conference "Problems in theoretical cybernetics", (1988)

work page 1988
[3]

Bolotashvili, M

G. Bolotashvili, M. Kovalev, and E. Girlich , New facets of the linear ordering polytope , SIAM Journal on Discrete Mathematics, 12 (1999), pp. 326--336

work page 1999
[4]

Bordewich and C

M. Bordewich and C. Semple , Quantifying the difference between phylogenetic diversity and diversity indices , Journal of Mathematical Biology, 88 (2024), pp. 1--25

work page 2024
[5]

Fischer, A

M. Fischer, A. Francis, and K. Wicke , Phylogenetic diversity rankings in the face of extinctions: T he robustness of the fair proportion index , Systematic Biology, 72 (2023), pp. 606--615

work page 2023
[6]

Gumbs, C

R. Gumbs, C. L. Gray, O. R. Wearn, and N. R. Owen , Tertapods on the EDGE : Overcoming data limitations to identify phylogenetic conservation priorities , PLoS One, 13 (2018), p. e0194680

work page 2018
[7]

Manson , The robustness of phylogenetic diversity indices to extinctions , Journal of Mathematical Biology, 89 (2024), p

K. Manson , The robustness of phylogenetic diversity indices to extinctions , Journal of Mathematical Biology, 89 (2024), p. 5

work page 2024
[8]

Manson and M

K. Manson and M. Steel , Spaces of phylogenetic diversity indices: combinatorial and geometric properties , Bulletin of Mathematical Biology, 85 (2023)

work page 2023
[9]

Mooers, O

A. Mooers, O. Gascuel, T. Stadler, H. Li, and M. Steel , Branch lengths on birth-death trees and the expected loss of phylogenetic diversity , Systematic Biology, 61 (2012), pp. 195--203

work page 2012
[10]

D. W. Redding, K. Hartmann, A. Mimoto, D. Bokal, M. DeVos, and A. . Mooers , Evolutionarily distinctive species often capture more phylogenetic diversity than expected , Journal of theoretical biology, 251 (2008), pp. 606--615

work page 2008
[11]

write newline

" write newline "" before.all 'output.state := FUNCTION fin.entry add.period write newline FUNCTION new.block output.state before.all = 'skip after.block 'output.state := if FUNCTION not #0 #1 if FUNCTION and 'skip pop #0 if FUNCTION or pop #1 'skip if FUNCTION new.block.checka empty 'skip 'new.block if FUNCTION field.or.null duplicate empty pop "" 'skip ...

work page

[1] [1]

Ben-Tal, A

A. Ben-Tal, A. Nemirovski, and L. E. Ghaoui , Robust Optimization , Princeton University Press, 2009

work page 2009

[2] [2]

Problems in theoretical cybernetics

G. Bolotashvili and M. Kovalev , The partial order polytope , Proceedings of the VIII conference "Problems in theoretical cybernetics", (1988)

work page 1988

[3] [3]

Bolotashvili, M

G. Bolotashvili, M. Kovalev, and E. Girlich , New facets of the linear ordering polytope , SIAM Journal on Discrete Mathematics, 12 (1999), pp. 326--336

work page 1999

[4] [4]

Bordewich and C

M. Bordewich and C. Semple , Quantifying the difference between phylogenetic diversity and diversity indices , Journal of Mathematical Biology, 88 (2024), pp. 1--25

work page 2024

[5] [5]

Fischer, A

M. Fischer, A. Francis, and K. Wicke , Phylogenetic diversity rankings in the face of extinctions: T he robustness of the fair proportion index , Systematic Biology, 72 (2023), pp. 606--615

work page 2023

[6] [6]

Gumbs, C

R. Gumbs, C. L. Gray, O. R. Wearn, and N. R. Owen , Tertapods on the EDGE : Overcoming data limitations to identify phylogenetic conservation priorities , PLoS One, 13 (2018), p. e0194680

work page 2018

[7] [7]

Manson , The robustness of phylogenetic diversity indices to extinctions , Journal of Mathematical Biology, 89 (2024), p

K. Manson , The robustness of phylogenetic diversity indices to extinctions , Journal of Mathematical Biology, 89 (2024), p. 5

work page 2024

[8] [8]

Manson and M

K. Manson and M. Steel , Spaces of phylogenetic diversity indices: combinatorial and geometric properties , Bulletin of Mathematical Biology, 85 (2023)

work page 2023

[9] [9]

Mooers, O

A. Mooers, O. Gascuel, T. Stadler, H. Li, and M. Steel , Branch lengths on birth-death trees and the expected loss of phylogenetic diversity , Systematic Biology, 61 (2012), pp. 195--203

work page 2012

[10] [10]

D. W. Redding, K. Hartmann, A. Mimoto, D. Bokal, M. DeVos, and A. . Mooers , Evolutionarily distinctive species often capture more phylogenetic diversity than expected , Journal of theoretical biology, 251 (2008), pp. 606--615

work page 2008

[11] [11]

write newline

" write newline "" before.all 'output.state := FUNCTION fin.entry add.period write newline FUNCTION new.block output.state before.all = 'skip after.block 'output.state := if FUNCTION not #0 #1 if FUNCTION and 'skip pop #0 if FUNCTION or pop #1 'skip if FUNCTION new.block.checka empty 'skip 'new.block if FUNCTION field.or.null duplicate empty pop "" 'skip ...

work page