46 citations · 132 across the 13 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math.CO2022
The Chromatic Number of with Multiple Forbidden Distances
Eric Naslund
Let be a finite set of distances, and let be the graph with vertex set and edge set $\{(x,y)\in\mathbb{R}^{n}:\ \…
math.CO2022
Upper Bounds For Families Without Weak Delta-Systems
Eric Naslund
For , a collection of sets is said to form a \emph{weak -system} if the intersection of any two sets from the collection has the same size. Erdős and Szemerédi asked…
math.NT2022★ 2 cited
Paley Graphs and Sárközy's Theorem In Function Fields
Eric Naslund
Sárközy's theorem states that dense sets of integers must contain two elements whose difference is a power. Following the polynomial method breakthrough of Croot, Lev, and…