Griffin Johnston

collaborators

2 papers

math.CO2026

A base- $8$ upper bound for planar peeling sequences

André Hisatsuga, Griffin Johnston, Rafael Miyazaki

Let $g (n)$ denote the minimum number of peeling sequences among all $n$ -point sets in general position in the plane. Dumitrescu and Tóth proved an exponential upper bound with base…

math.CO2021

Upper and lower bounds on the size of $B_{k} [g]$ sets

Griffin Johnston, Michael Tait, Craig Timmons

A subset $A$ of the integers is a $B_{k} [g]$ set if the number of multisets from $A$ that sum to any fixed integer is at most $g$ . Let $F_{k, g} (n)$ denote the maximum size of a $B_k[…

A base-8 upper bound for planar peeling sequences

Upper and lower bounds on the size of Bk​[g] sets

A base- $8$ upper bound for planar peeling sequences

Upper and lower bounds on the size of $B_{k} [g]$ sets