Simplices over finite fields
From MaRDI portal
Abstract: We prove that, provided , every sufficiently large subset of contains an isometric copy of every -simplex that avoids spanning a nontrivial self-orthogonal subspace. We obtain comparable results for simplices exhibiting self-orthogonal behavior.
Recommendations
Cites work
- \(k\)-point configurations in sets of positive density of \(\mathbb{Z}^n\)
- A Szemerédi type theorem for sets of positive density in R^k
- Erdös distance problem in vector spaces over finite fields
- scientific article; zbMATH DE number 16111 (Why is no real title available?)
- scientific article; zbMATH DE number 2121181 (Why is no real title available?)
- scientific article; zbMATH DE number 967590 (Why is no real title available?)
- On the solvability of systems of bilinear equations in finite fields
- Pinned distance sets, k-simplices, Wolff's exponent in finite fields and sum-product estimates
- Product of simplices and sets of positive upper density in \(\mathbb{R}^d\)
- Ubiquity of simplices in subsets of vector spaces over finite fields
Cited in
(9)- Self-similar carpets over finite fields
- On k-simplexes in (2k-1)-dimensional vector spaces over finite fields
- Embedding distance graphs in finite field vector spaces
- Weak hypergraph regularity and applications to geometric Ramsey theory
- Spherical configurations over finite fields
- An improvement on the number of simplices in \(\mathbb{F}_q^d\)
- Almost spanning distance trees in subsets of finite vector spaces
- The quotient set of the quadratic distance set over finite fields
- Ubiquity of simplices in subsets of vector spaces over finite fields
This page was built for publication: Simplices over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970054)