Finite phylogenetic complexity and combinatorics of tables
  We prove that the phylogenetic complexity -- an invariant introduced by Sturmfels and Sullivant -- of any finite abelian group is finite. 
Mateusz Micha{\l}ek, Emanuele Ventura
math.CO math.AG