Finite phylogenetic complexity and combinatorics of tables

Abstract

We prove that the phylogenetic complexity -- an invariant introduced by Sturmfels and Sullivant -- of any finite abelian group is finite.

Improved exposition

References in corpus (2)

• Complete intersection for equivariant models
• Finite phylogenetic complexity of $Z_p$ and invariants for $Z_3$

Cited by in corpus (2)

• Selected topics on Toric Varieties
• When is a polynomial ideal binomial after an ambient automorphism?