 document

Ber, Aleksei F. (author), Borst, M.J. (author), Borst, Sander J. (author), Sukochev, F. (author)We prove that, for a finitedimensional real normed space V, every bounded mean zero function f ∈ L<sub>∞</sub>([0, 1]; V) can be written in the form f = g ◦ T − g for some g ∈ L<sub>∞</sub>([0, 1]; V) and some ergodic invertible measure preserving transformation T of [0, 1]. Our method moreover allows us to choose g, for any given ε > 0,...journal article 2023
 document

Borst, Sander (author), van Iersel, L.J.J. (author), Jones, M.E.L. (author), Kelk, Steven (author)We study the problem of finding a temporal hybridization network containing at most k reticulations, for an input consisting of a set of phylogenetic trees. First, we introduce an FPT algorithm for the problem on an arbitrary set of m binary trees with n leaves each with a running time of O(5 <sup>k</sup>· n· m). We also present the concept...journal article 2022
 document

Borst, Sander (author)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...master thesis 2020
 document

Borst, Sander (author)The cap set problem consists of finding the maximum size cap sets, i.e. sets without a 3term 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...bachelor thesis 2018