New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees

We study the problem of finding a temporal hybridization network for a set of phylogenetic trees that minimizes the number of reticulations. First, we introduce an FPT algorithm for this problem on an arbitrary set of t binary trees with n leaves each with a running time of O(5^k*n*m) where k is the minimum temporal hybridization number. We also...

Using the slice rank for finding upper bounds on the size of cap sets

The cap set problem consists of finding the maximum size cap sets, i.e. sets without a 3-term arithmetic progression in F₃. In this thesis several known results on the behavior of this number as n → ∞ are presented. In particular we discuss a reformulation by Terence Tao and Will Sawin of a proof found by Dion Gijswijt and Jordan Ellenberg. It...