Finite phylogenetic complexity and combinatorics of tables
arXiv:1606.07263 · doi:10.2140/ant.2017.11.235
Abstract
We prove that the phylogenetic complexity -- an invariant introduced by Sturmfels and Sullivant -- of any finite abelian group is finite.
arXiv commentImproved exposition
References in corpus (12)
- GL-equivariant modules over polynomial rings in infinitely many variables
- Syzygies of Segre embeddings and Delta-modules
- Phylogenetic Algebraic Geometry
- Bounded-rank tensors are defined in bounded degree
- Algebraic varieties representing group-based Markov processes on trees
- Constructive degree bounds for group-based models
- Toric geometry of the 3-Kimura model for any tree
- Coordinate rings for the moduli of $SL_2(\C)$ quasi-parabolic principal bundles on a curve and toric fiber products
- Finiteness results for Abelian tree models
- The algebra of conformal blocks
- Complete intersection for equivariant models
- Finite phylogenetic complexity of and invariants for