Finite phylogenetic complexity and combinatorics of tables
Combinatorics
2017-02-01 v2 Algebraic Geometry
Abstract
We prove that the phylogenetic complexity -- an invariant introduced by Sturmfels and Sullivant -- of any finite abelian group is finite.
Cite
@article{arxiv.1606.07263,
title = {Finite phylogenetic complexity and combinatorics of tables},
author = {Mateusz Michałek and Emanuele Ventura},
journal= {arXiv preprint arXiv:1606.07263},
year = {2017}
}
Comments
Improved exposition