Cycles of arbitrary length in distance graphs on \mathbb{F}_q^d

DOI10.1134/S0081543821040027MaRDI QIDQ6357487arXivFDO

Authors Alex Iosevich, G. Jardine, Brian Mcdonald

Publication date 3 January 2021

Published in arXiv

Full work available at URL https://doi.org/10.1134/S0081543821040027

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Erd?s problems and related topics of discrete geometry (52C10)

arXiv classification

math.CO

Abstract: For $Esubset{BbbF}_q^d$, $dge2$, where ${BbbF}_q$ is the finite field with $q$ elements, we consider the distance graph ${mathcalG}_t^{dist}(E)$, $tot=0$, where the vertices are the elements of $E$, and two vertices $x$, $y$ are connected by an edge if $||x-y||equiv{(x_1-y_1)}^2+dots+{(x_d-y_d)}^2=t$. We prove that if $|E|ge{C}_k{q}^{fracd+22}$, then ${mathcalG}_t^{dist}(E)$ contains a statistically correct number of cycles of length $k$. We are also going to consider the dot-product graph ${mathcalG}_t^{prod}(E)$, $tot=0$, where the vertices are the elements of $E$, and two vertices $x$, $y$ are connected by an edge if $xcdotyequiv{x}_1{y}_1+dots+x_d{y}_d=t$. We obtain similar results in this case using more sophisticated methods necessitated by the fact that the function $xcdoty$ is not translation invariant. The exponent $fracd+22$ is improved for sufficiently long cycles.

This page was built for publication: Cycles of arbitrary length in distance graphs on $\mathbb{F}_q^d$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6357487)