On the number of dot product chains in finite fields and rings
From MaRDI portal
Publication:2696014
DOI10.1007/978-3-031-10796-2_1OpenAlexW3118533004MaRDI QIDQ2696014
Ethan Lynch, Vincent Blevins, David Crosby, Steven Senger
Publication date: 5 April 2023
Full work available at URL: https://arxiv.org/abs/2101.03277
Other combinatorial number theory (11B75) Orthogonal arrays, Latin squares, Room squares (05B15) Erd?s problems and related topics of discrete geometry (52C10) Additive bases, including sumsets (11B13) Arithmetic combinatorics; higher degree uniformity (11B30)
Cites Work
- Unnamed Item
- Finite chains inside thin subsets of \(\mathbb{R}^d\)
- Pinned distance sets, \(k\)-simplices, Wolff's exponent in finite fields and sum-product estimates
- Orthogonal systems in vector spaces over finite rings
- On the Erdős distinct distances problem in the plane
- A Furstenberg-Katznelson-Weiss type theorem on \((d+1)\)-point configurations in sets of positive density in finite field geometries
- Orthogonal systems in vector spaces over finite fields
- A sum-product estimate in finite fields, and applications
- Geometric configurations in the ring of integers modulo p^{ell}
- Averages over hyperplanes, sum-product theory in vector spaces over finite fields and the Erdős-Falconer distance conjecture
- Research Problems in Discrete Geometry
- Erdös distance problem in vector spaces over finite fields
- Upper bounds on pairs of dot products
- Bounds on Point Configurations Determined by Distances and Dot Products
- On the number of discrete chains
- Pairs of Dot Products in Finite Fields and Rings
- On Sets of Distances of n Points
This page was built for publication: On the number of dot product chains in finite fields and rings