Improved bounds for embedding certain configurations in subsets of vector spaces over finite fields (Q6588170)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Improved bounds for embedding certain configurations in subsets of vector spaces over finite fields |
scientific article; zbMATH DE number 7897460
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved bounds for embedding certain configurations in subsets of vector spaces over finite fields |
scientific article; zbMATH DE number 7897460 |
Statements
Improved bounds for embedding certain configurations in subsets of vector spaces over finite fields (English)
0 references
15 August 2024
0 references
\textit{A. Iosevich} and \textit{H. Parshall} [J. Korean Math. Soc. 56, No. 6, 1515--1528 (2019; Zbl 1442.52013)] showed that for every \(E\subseteq \mathbb{F}_q^d\) \((d\geq2)\), and any connected graph \(G\) on \(k+1\) vertices with maximum degree \(m\), and any \(t\in \mathbb{F}_q\) with \(t\not= 0\), if \(|E|>Cq^{m+\frac{d-1}{2}}\), then there are \(k+1\) points in \(E\), such that the \(t\)-distance graph of these vertices is isomorphic to \(G\). The maximum degree in this result plays a bigger role than it deserves. The paper under review studies specific configurations of points to improve upon Iosevich and Parshall's results in certain cases.
0 references
finite point configurations
0 references
Erdős distance problem
0 references
discrete Fourier transform
0 references
character sum estimates
0 references
0 references