Lander Verlinde

collaborators

4 papers

math.CO2026

Sumsets of random sets

Rajko Nenadov, Lander Verlinde

Given $m \in N$ and a $p$ -random subset $A \subseteq N$ , we asymptotically determine $lo g Pr (∣ N ∖ (A + A) ∣ \geq m)$ for $p$ above the threshold…

math.CO2026

ErdÅs-Szekeres Maker-Breaker Games

Aleksa DÅ¾uklevski, DÃ¶mÃ¶tÃ¶r PÃ¡lvÃ¶lgyi, Alexey Pokrovskiy +3

We present new results on Maker-Breaker games arising from the ErdÅs-Szekeres problem in planar geometry. This classical problem asks how large a set in general position has to be…

math.CO2025

Multipartite nearly orthogonal sets over finite fields

Rajko Nenadov, Lander Verlinde

For a field $F$ and integers $d, k$ and $ℓ$ , a set $A \subseteq F^{d}$ is called $(k, ℓ)$ -nearly orthogonal if all vectors in $A$ are non-self-orthogonal and e…

math.OC2025

Optimal routing and transmission strategies for UAV reconnaissance missions with detection threats

Riley Badenbroek, Relinde Jurrius, Lander Verlinde

We consider an autonomous reconnaissance mission where an Unmanned Aerial Vehicle (UAV) has to visit several points of interest and communicate the intel back to the base. At every…

Sumsets of random sets

ErdÅs-Szekeres Maker-Breaker Games

Multipartite nearly orthogonal sets over finite fields

Optimal routing and transmission strategies for UAV reconnaissance missions with detection threats

ErdÅs-Szekeres Maker-Breaker Games