Distance graphs in vector spaces over finite fields, coloring and pseudo-randomness

Simple item page
dc.creatorHart, Derrick
dc.creatorIosevich, Alex
dc.creatorKoh, Doowon
dc.creatorSenger, Steve
dc.creatorUriarte-Tuero, Ignacio
dc.date2008-04-18
dc.date.accessioned2026-07-07T09:33:29Z
dc.date.available2026-07-07T09:33:29Z
dc.descriptionIn this paper we systematically study various properties of the distance graph in ${\Bbb F}_q^d$, the $d$-dimensional vector space over the finite field ${\Bbb F}_q$ with $q$ elements. In the process we compute the diameter of distance graphs and show that sufficiently large subsets of $d$-dimensional vector spaces over finite fields contain every possible finite configurations.
dc.identifierhttps://arxiv.org/abs/0804.3036
dc.identifierhttp://arxiv.org/abs/0804.3036
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/159148
dc.subjectCombinatorics
dc.titleDistance graphs in vector spaces over finite fields, coloring and pseudo-randomness
dc.typetext

Files

Collections

arXiv