Finite phylogenetic complexity and combinatorics of tables

arxiv: 1606.07263 · v2 · pith:MF23JHYDnew · submitted 2016-06-23 · 🧮 math.CO · math.AG

Mateusz Micha{\l}ek , Emanuele Ventura This is my paper

classification 🧮 math.CO math.AG

keywords finitecomplexityphylogeneticabeliancombinatoricsgroupintroducedinvariant

0 comments

read the original abstract

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

This paper has not been read by Pith yet.