4 problems
- 0 votes0 replies0 views
Sullivant's phylogenetic complexity bound for finite abelian groups
Sullivant's conjecture. For any finite abelian group , .
- 0 votes0 replies0 views
Symmetric group-compatible labelings are friendly labelings
Let be a finite group acting on a finite set of states, and let be a labeling function that is symmetric and -compatible. A labeling is friendly when…
- 0 votes0 replies0 views
Finite phylogenetic complexity for arbitrary finite groups
Finite-complexity conjecture. For any finite (not necessarily abelian) group , is finite.
- 0 votes0 replies0 views
Toric intersection conjecture for group-based tree varieties
Toric intersection conjecture. The toric variety is the toric intersection of all the toric varieties .