12 citations · 14 across the 4 of their papers we have counts for
8 papers
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}:\ \…
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…
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…
Monochromatic Equilateral Triangles in the Unit Distance Graph
Eric Naslund
Let denote the minimum number of colors needed to color so that there will not be a monochromatic equilateral triangle with side length .…
Exponential Bounds for the Erdős-Ginzburg-Ziv Constant
Eric Naslund
The Erdős-Ginzburg-Ziv constant of an abelian group , denoted , is the smallest such that any sequence of elements of of length contain…
The Partition Rank of a Tensor and -Right Corners in
Eric Naslund
Following the breakthrough of Croot, Lev, and Pach, Tao introduced a symmetrized version of their argument, which is now known as the slice rank method. In this paper, we introduce…