On kaleidoscopic pseudo-randomness of finite Euclidean graphs
From MaRDI portal
Publication:4647869
DOI10.7151/DMGT.1597zbMATH Open1255.05086arXiv0807.2689OpenAlexW2963009082MaRDI QIDQ4647869FDOQ4647869
Authors: Le Anh Vinh 
Publication date: 8 November 2012
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Abstract: In this paper we study the kaleidoscopic pseudo-randomness of finite Euclidean graphs using probabilistic methods. Roughly speaking, we show that sufficiently large subsets of d-dimensional vector spaces over finite fields contain every possible finite configurations.
Full work available at URL: https://arxiv.org/abs/0807.2689
Recommendations
- Distance graphs in vector spaces over finite fields
- Finite Euclidean graphs over rings
- Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces
- Embedding distance graphs in finite field vector spaces
- Cycles of arbitrary length in distance graphs on \(\mathbb{F}_q^d\)
Cited In (11)
- Dot-product sets and simplices over finite rings
- The number of occurrences of a fixed spread among \(n\) directions in vector spaces over finite fields
- Distribution of the determinants of sums of matrices
- Pinned distance sets, \(k\)-simplices, Wolff's exponent in finite fields and sum-product estimates
- The quotient set of the quadratic distance set over finite fields
- Pseudo-random properties of self-complementary symmetric graphs
- Embedding distance graphs in finite field vector spaces
- Distance graphs in vector spaces over finite fields
- Embedding bipartite distance graphs under Hamming metric in finite fields
- An improvement on the number of simplices in \(\mathbb{F}_q^d\)
- Parallelograms and the VC-dimension of the distance sets
This page was built for publication: On kaleidoscopic pseudo-randomness of finite Euclidean graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4647869)
