Exact threshold conjecture for the Semple–Steel bound with r-state characters
Statement
Let be the maximum, over all binary phylogenetic trees with leaves, of the minimum number of -state characters required to define the tree. Let be the least integer such that the Semple–Steel lower bound is attained for every , namely . Exact threshold conjecture. For every ,
Moreover, whenever , there is an explicit construction of
-state characters defining any prescribed binary phylogenetic tree with leaves. The paper proves the lower bound and an upper bound of order ; the conjecture asserts that the lower bound is exact and that the bound can be attained constructively from this threshold onward.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.