LONG PATHS IN THE DISTANCE GRAPH OVER LARGE SUBSETS OF VECTOR SPACES OVER FINITE FIELDS

DOI10.4134/JKMS.2016.53.1.115zbMath1338.52018arXiv1406.0107OpenAlexW2964335955MaRDI QIDQ2794875

David J. Covert, Jonathan Pakianathan, Jeremy Chapman, Alexander Iosevich, Michael Bennett, Derrick N. Hart

Publication date: 11 March 2016

Published in: Journal of the Korean Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.0107

zbMATH Keywords

finite fieldsgraph theoryErdős distance problem

Mathematics Subject Classification ID

Exponential sums (11T23) Erd?s problems and related topics of discrete geometry (52C10)

Related Items (8)

Embedding distance graphs in finite field vector spaces ⋮ 𝑘-chain configurations of points over 𝑝-adic rings ⋮ Embeddings of weighted graphs in Erdős-type settings ⋮ Distribution of pinned distance trees in the plane \(\mathbb{F}_p^2\) ⋮ Большие пути в дистанционных графах в векторных пространствах над конечным полем ⋮ Embedding bipartite distance graphs under Hamming metric in finite fields ⋮ Angle chains and pinned variants ⋮ Cycles of arbitrary length in distance graphs on \(\mathbb{F}_q^d\)

This page was built for publication: LONG PATHS IN THE DISTANCE GRAPH OVER LARGE SUBSETS OF VECTOR SPACES OVER FINITE FIELDS