19 citations · 82 across the 27 of their papers we have counts for
32 papers
A combinatorial approach to point-flat incidences over finite fields
Ben Lund, Tao Zhang
We establish new bounds for incidences between a point set P and a family L of n-flats in PG(n+d,q). For fixed dimensions, our bound on the incidence discrepancy has an explicit pi…
Two-sided linear hashing and quadratic density bounds for smooth lattice coverings
Ben Lund
We study random linear projections of a finite-field subset for which every fiber has cardinality close to its mean. We bound the mean fiber size needed to ensure that all fibers s…
Almost spanning distance trees in subsets of finite vector spaces
Debsoumya Chakraborti, Ben Lund
For and an odd prime power , consider the vector space over the finite field , where the distance between two points a…
Rainbow saturation for complete graphs
Debsoumya Chakraborti, Kevin Hendrey, Ben Lund +1
We call an edge-colored graph rainbow if all of its edges receive distinct colors. An edge-colored graph is called -rainbow saturated if does not contain a rainbow copy…
Radial projection theorems in finite spaces
Ben Lund, Thang Pham, Vu Thi Huong Thu
Motivated by recent results on radial projections and applications to the celebrated Falconer distance problem, we study radial projections in the setting of finite fields. More pr…
Threshold functions for incidence properties in finite vector spaces
Jeong Han Kim, Ben Lund, Thang Pham +1
The main purpose of this paper is to provide threshold functions for the events that a random subset of the points of a finite vector space has certain properties related to point-…