Ubiquity of simplices in subsets of vector spaces over finite fields (Q949887): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Szemerédi type theorem for sets of positive density in \(\mathbb R^k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sum-product estimate in finite fields, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The primes contain arbitrarily long arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdös distance problem in vector spaces over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-point configurations in sets of positive density of \(\mathbb{Z}^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5431586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sets of integers containing k elements in arithmetic progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Exponential Sums / rank
 
Normal rank

Latest revision as of 18:48, 28 June 2024

scientific article
Language Label Description Also known as
English
Ubiquity of simplices in subsets of vector spaces over finite fields
scientific article

    Statements

    Ubiquity of simplices in subsets of vector spaces over finite fields (English)
    0 references
    21 October 2008
    0 references
    Let \(V\) be a \(d\)-dimensional vector space over a finite field \(\mathbb F_q\) with odd characteristic. A \(k\)-simplex is a set comprising \((k+1)\) points in \(V\) arranged in such a way that for any \(n\leq k\), no \((n+1)\) of the points lie in a subspace of dimension \((n-1)\). In this paper it is shown that for \(d>\binom{k+1}{2}\) any subset with at least \(Cq^{kd/(k+1)}q^{k/2}\) elements for some sufficiently large \(C\) must contain an isometric copy of every \(k\)-simplex. The proof uses Fourier analysis and Weil estimates for Kloosterman sums. This may be viewed as a finite field analogue of a result due to \textit{J.~Bourgain} [Isr. J. Math. 54, 307-316 (1986; Zbl 0609.10043)]; in the finite field version the hypothesis of positive density can be replaced by a weaker assumption on the cardinality of the set.
    0 references
    vector space
    0 references
    finite field
    0 references
    simplex
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references