Finite phylogenetic complexity of and invariants for
arXiv:1508.04177 · doi:10.1016/j.ejc.2016.08.007
Abstract
We study phylogenetic complexity of finite abelian groups - an invariant introduced by Sturmfels and Sullivant. The invariant is hard to compute - so far it was only known for , in which case it equals . We prove that phylogenetic complexity of any group , where is prime, is finite. We also show, as conjectured by Sturmfels and Sullivant, that the phylogenetic complexity of equals .
References in corpus (13)
- On the toric ideal of a matroid
- Bounded-rank tensors are defined in bounded degree
- A generalization of Combinatorial Nullstellensatz
- Algebraic varieties representing group-based Markov processes on trees
- Constructive degree bounds for group-based models
- A short proof of Combinatorial Nullstellensatz
- Toric geometry of the 3-Kimura model for any tree
- The quest for counterexamples in toric geometry
- 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
- On the graph labellings arising from phylogenetics
- H-Representation of the Kimura-3 Polytope