Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. On $k$-simplexes in ...
Conference paper

On $k$-simplexes in $(2k-1)$-dimensional vector spaces over finite fields

Le Anh Vinh (1)
(1) Department of Mathematics [Cambridge]
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2008
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009)
Proceedings
DOI
10.46298/dmtcs.2701
License
https://about.hal.science/hal-authorisation-v1
Indicators
565
Views
672
Downloads

On $k$-simplexes in $(2k-1)$-dimensional vector spaces over finite fields

Le Anh Vinh (1)
(1) Department of Mathematics [Cambridge]
Abstract
English
We show that if the cardinality of a subset of the $(2k-1)$-dimensional vector space over a finite field with $q$ elements is $\gg q^{2k-1-\frac{1}{ 2k}}$, then it contains a positive proportional of all $k$-simplexes up to congruence.
French
Nous montrons que si la cardinalité d'un sous-ensemble de l'espace vectoriel à $(2k-1)$ dimensions sur un corps fini à $q$ éléments est $\gg q^{2k-1-\frac{1}{ 2k}}$, alors il contient une proportion non-nulle de tous les $k$-simplexes de congruence.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • distance problem
  • finite Euclidean graphs
  • finite non-Euclidean graphs
  • spectral graphs
Cited by

Source: OpenCitations

  • On a Furstenberg-Katznelson-Weiss Type Theorem over Finite Fields

    Annals of Combinatorics

    Authors : Le Anh Vinh ORCID

    Journal reference : Volume 15, 2011, pp. 541-547

    DOI : 10.1007/s00026-011-0107-4
Preview
Loading PDF preview...