46 citations · 132 across the 13 of their papers we have counts for
13 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…
Upper bounds for sunflower-free sets
Eric Naslund, William F. Sawin
A collection of sets is said to form a -sunflower, or -system, if the intersection of any two sets from the collection is the same, and we call a family of sets $\mathcal…
Primitive points in rational polygons
Imre Bárány, Greg Martin, Eric Naslund +1
Let be a star-shaped polygon in the plane, with rational vertices, containing the origin. The number of primitive lattice points in the dilate is asympto…
A Density Increment Approach to Roth's Theorem in the Primes
Eric Naslund
We prove that if is any set of prime numbers satisfying \[ \sum_{a\in A}\frac{1}{a}=\infty, \] then must contain a -term arithmetic progression. This is accomplished by…
On Improving Roth's Theorem in the Primes
Eric Naslund
Let be a set of prime numbers containing no non-trivial arithmetic progressions. Suppose that has relative density , where $π(N…
Bounds For The Tail Distribution Of The Sum Of Digits Of Prime Numbers
Eric Naslund
Let s_q(n) denote the base q sum of digits function, which for n<x, is centered around (q-1)/2 log_q x. In Drmota, Mauduit and Rivat's 2009 paper, they look at sum of digits of pri…
The Median Largest Prime Factor
Eric Naslund
Let denote the median largest prime factor of the integers in the interval . We prove that $$M(x)=x^{\frac{1}{\sqrt{e}}\exp(-\text{li}_{f}(x)/x)}+O_ε(x^{\frac{1}{\sqr…
Integers With A Predetermined Prime Factorization
Eric Naslund
A classic question in analytic number theory is to find asymptotics for and , the number of integers with exactly prime factors, where …