Ben Lund
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ben Lund has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- George B. Purdy
University of Cincinnati
4 shared publications - Justin W. Smith
University of Cincinnati
4 shared publications - Adam Sheffer
CUNY: Baruch College NY USA
2 shared publications - Alexander Magazinov
Yandex
2 shared publications - Frank de Zeeuw
Department of Mathematics, EPFL, Lausanne, Switzerland
2 shared publications - Manik Dhar
Department of Computer Science Princeton University
2 shared publications
Latest Publications
- Open Access
Sphere intersections and incidences over finite fields
We bound the number of incidences between points and spheres in finite vector spaces by bounding the sum of the number of points in the pairwise intersections of the spheres. We obtain new incidence bounds that are interesting when the number of spheres is not too large. Our approach also leads to an elementary proof of the Iosevich-Rudnev bound on the Erdős-Falconer distance problem in odd dimensions.
Open AccessSphere intersections and incidences over finite fields
We bound the number of incidences between points and spheres in finite vector spaces by bounding the sum of the number of points in the pairwise intersections of the spheres. We obtain new incidence bounds that are interesting when the number of spheres is not too large. Our approach also leads to an elementary proof of the Iosevich-Rudnev bound on the Erdős-Falconer distance problem in odd dimensions.
- 29 November 2023
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 71 (2) , 327-357
Furstenberg Sets in Finite Fields: Explaining and Improving the Ellenberg–Erman Proof
- 29 November 2023
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 71 (2) , 327-357
Furstenberg Sets in Finite Fields: Explaining and Improving the Ellenberg–Erman Proof
- Open Access
Furstenberg sets in finite fields: Explaining and improving the Ellenberg-Erman proof
A $(k,m)$-Furstenberg set is a subset $S \subset \mathbb{F}_q^n$ with the property that each $k$-dimensional subspace of $\mathbb{F}_q^n$ can be translated so that it intersects $S$ in at least $m$ points. Ellenberg and Erman proved that $(k,m)$-Furstenberg sets must have size at least $C_{n,k}m^{n/k}$, where $C_{n,k}$ is a constant depending only $n$ and $k$. In this paper, we adopt the same proof strategy as Ellenberg and Erman, but use more elementary techniques than their scheme-theoretic method. By modifying certain parts of the argument, we obtain an improved bound on $C_{n,k}$, and our improved bound is nearly optimal for an algebraic generalization the main combinatorial result. We also extend our analysis to give lower bounds for sets that have large intersection with shifts of a specific family of higher-degree co-dimension $n-k$ varieties, instead of just co-dimension $n-k$ subspaces.Open AccessFurstenberg sets in finite fields: Explaining and improving the Ellenberg-Erman proof
A $(k,m)$-Furstenberg set is a subset $S \subset \mathbb{F}_q^n$ with the property that each $k$-dimensional subspace of $\mathbb{F}_q^n$ can be translated so that it intersects $S$ in at least $m$ points. Ellenberg and Erman proved that $(k,m)$-Furstenberg sets must have size at least $C_{n,k}m^{n/k}$, where $C_{n,k}$ is a constant depending only $n$ and $k$. In this paper, we adopt the same proof strategy as Ellenberg and Erman, but use more elementary techniques than their scheme-theoretic method. By modifying certain parts of the argument, we obtain an improved bound on $C_{n,k}$, and our improved bound is nearly optimal for an algebraic generalization the main combinatorial result. We also extend our analysis to give lower bounds for sets that have large intersection with shifts of a specific family of higher-degree co-dimension $n-k$ varieties, instead of just co-dimension $n-k$ subspaces. - Open Access
An improved sum-product bound for quaternions
We show that there exists an absolute constant $c > 0$, such that, for any finite set $A$ of quaternions, \[ \max\{|A+A, |AA| \} \gtrsim |A|^{4/3 + c}. \] This generalizes a sum-product bound for real numbers proved by Konyagin and Shkredov.Open AccessAn improved sum-product bound for quaternions
We show that there exists an absolute constant $c > 0$, such that, for any finite set $A$ of quaternions, \[ \max\{|A+A, |AA| \} \gtrsim |A|^{4/3 + c}. \] This generalizes a sum-product bound for real numbers proved by Konyagin and Shkredov. - 6 January 2021
- Published by Wiley in Journal of Graph Theory
- Vol. 97 (2) , 340-354
Perfect matchings and derangements on graphs
We show that each perfect matching in a bipartite graph intersects at least half of the perfect matchings in . This result has equivalent formulations in terms of the permanent of the adjacency matrix of a graph, and in terms of derangements and permutations on graphs. We give several related results and open questions.- 6 January 2021
- Published by Wiley in Journal of Graph Theory
- Vol. 97 (2) , 340-354
Perfect matchings and derangements on graphs
We show that each perfect matching in a bipartite graph intersects at least half of the perfect matchings in . This result has equivalent formulations in terms of the permanent of the adjacency matrix of a graph, and in terms of derangements and permutations on graphs. We give several related results and open questions.- Open Access
A note on the largest induced matching in graphs avoiding a fixed bipartite graph
We give a simple proof that every $n$-vertex graph $d$-regular graph that does not contain a fixed bipartite graph as a subgraph has an induced matching of size $\Omega((n/d)(\log d))$.Open AccessA note on the largest induced matching in graphs avoiding a fixed bipartite graph
We give a simple proof that every $n$-vertex graph $d$-regular graph that does not contain a fixed bipartite graph as a subgraph has an induced matching of size $\Omega((n/d)(\log d))$. - Open Access
On the list recoverability of randomly punctured codes
We show that a random puncturing of a code with good distance is list recoverable beyond the Johnson bound. In particular, this implies that there are Reed-Solomon codes that are list recoverable beyond the Johnson bound. It was previously known that there are Reed-Solomon codes that do not have this property. As an immediate corollary to our main theorem, we obtain better degree bounds on unbalanced expanders that come from Reed-Solomon codes.
Open AccessOn the list recoverability of randomly punctured codes
We show that a random puncturing of a code with good distance is list recoverable beyond the Johnson bound. In particular, this implies that there are Reed-Solomon codes that are list recoverable beyond the Johnson bound. It was previously known that there are Reed-Solomon codes that do not have this property. As an immediate corollary to our main theorem, we obtain better degree bounds on unbalanced expanders that come from Reed-Solomon codes.
- 26 June 2020
- Published by Elsevier in Computational Geometry
- Vol. 92, 101681
Two theorems on point-flat incidences
- 26 June 2020
- Published by Elsevier in Computational Geometry
- Vol. 92, 101681
Two theorems on point-flat incidences
- 14 January 2020
- Published by Springer Nature in Annals of Combinatorics
- Vol. 24 (2) , 225-235
A Refined Energy Bound for Distinct Perpendicular Bisectors
- 14 January 2020
- Published by Springer Nature in Annals of Combinatorics
- Vol. 24 (2) , 225-235
A Refined Energy Bound for Distinct Perpendicular Bisectors
- 23 August 2019
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 64 (3) , 995-1012
Bisectors and Pinned Distances
- 23 August 2019
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 64 (3) , 995-1012
Bisectors and Pinned Distances