33 citations · 131 across the 23 of their papers we have counts for
6 papers · 1 filter
Subset sums in abelian groups
Eric Balandraud, Benjamin Girard, Simon Griffiths +1
Denoting by Sigma(S) the set of subset sums of a subset S of a finite abelian group G, we prove that |Sigma(S)| >= |S|(|S|+2)/4-1 whenever S is symmetric, |G| is odd and Sigma(S) i…
k-Sums in abelian groups
Benjamin Girard, Simon Griffiths, Yahya Ould Hamidoune
Given a finite subset A of an abelian group G, we study the set k \wedge A of all sums of k distinct elements of A. In this paper, we prove that |k \wedge A| >= |A| for all k in {2…
The chromatic thresholds of graphs
Peter Allen, Julia Böttcher, Simon Griffiths +2
The chromatic threshold delta_chi(H) of a graph H is the infimum of d>0 such that there exists C=C(H,d) for which every H-free graph G with minimum degree at least d|G| satisfies c…
Noise Sensitivity in Continuum Percolation
Daniel Ahlberg, Erik Broman, Simon Griffiths +1
We prove that the Poisson Boolean model, also known as the Gilbert disc model, is noise sensitive at criticality. This is the first such result for a Continuum Percolation model, a…
On explosions in heavy-tailed branching random walks
Omid Amini, Luc Devroye, Simon Griffiths +1
Consider a branching random walk on , with offspring distribution Z and nonnegative displacement distribution W. We say that explosion occurs if an infinite number of p…
Quasi-random oriented graphs
Simon Griffiths
We show that a number of conditions on oriented graphs, all of which are satisfied with high probability by randomly oriented graphs, are equivalent. These equivalences are similar…