◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Eric Naslund

13 papers hereh-index 6218 citations18 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author11
  • first author1
  • middle author1

Across the 13 of 13 papers where every author was matched, so the position is known.

fields
  • math.NT7
  • math.CO6
same name
  • Eric Naslund — 1 paper

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20122022
most citedUpper bounds for sunflower-free sets

46 citations · 132 across the 13 of their papers we have counts for

collaborators
Showing 2022Show all

3 papers · 1 filter

math.CO2022

The Chromatic Number of Rn with Multiple Forbidden Distances

Eric Naslund

Let A⊂R>0​ be a finite set of distances, and let GA​(Rn) be the graph with vertex set Rn and edge set $\{(x,y)\in\mathbb{R}^{n}:\ \…

math.CO2022

Upper Bounds For Families Without Weak Delta-Systems

Eric Naslund

For k≥3, a collection of k 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 kth power. Following the polynomial method breakthrough of Croot, Lev, and…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.