Peter van Hintum

activity

20182026

most citedThe bunkbed conjecture on the complete graph

7 citations · 8 across the 8 of their papers we have counts for

collaborators

12 papers

math.MG2026

The sharp threshold for Hausdorff convexification under Minkowski addition

Peter van Hintum

The Dyn-Farkhi conjecture asserts that the square of the Hausdorff distance from a compact set to its convex hull is subadditive with respect to Minkowski addition. The conjecture…

math.CO2025

From Brunn-Minkowski to Prékopa-Leindler and Borell-Brascamp-Lieb: discrete inequalities

Peter van Hintum

We consider a general way to obtain Prékopa-Leindler and Borell-Brascamp-Lieb type inequalities from Brunn-Minkowski type inequalities and provide numerous examples. We use the sam…

math.NT2024

Additive Bases: Change of Domain

Boris Bukh, Peter van Hintum, Peter Keevash

We consider two questions of Ruzsa on how the minimum size of an additive basis $B$ of a given set $A$ depends on the domain of $B$ . To state these questions, for an abelian group…

math.CO2020

Capture times in the Bridge-burning Cops and Robbers game

Rebekah Herrman, Peter van Hintum, Stephen G. Z. Smith

In this paper, we consider a variant of the cops and robbers game on a graph, introduced by Kinnersley and Peterson, in which every time the robber uses an edge, it is removed from…

math.CO2020

Radius, Girth and Minimum Degree

Vojtěch Dvořák, Peter van Hintum, Amy Shaw +1

Given a connected graph $G$ on $n$ vertices, with minimum degree $δ \geq 2$ and girth at least $g \geq 4$ , what is the maximum radius $r$ this graph can have? Erdős, Pach, Pollack a…

math.CO2020

Improved Bound for Tomaszewski's Problem

Vojtěch Dvořák, Peter van Hintum, Marius Tiba

In 1986, Tomaszewski made the following conjecture. Given $n$ real numbers $a_{1}, ..., a_{n}$ with $\sum_{i = 1}^{n} a_{i}^{2} = 1$ , then of the $2^{n}$ signed sums $\pm a_{1} \pm ... \p…