English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

For $E \subset {\Bbb F}_q^d$, $d \ge 2$, where ${\Bbb F}_q$ is the finitefield with $q$ elements, we consider the distance graph ${\mathcalG}^{dist}_t(E)$, $t \not=0$, where the vertices are the elements of $E$, andtwo 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_kq^{\frac{d+2}{2}}$, then ${\mathcal G}^{dist}_t(E)$ contains a statisticallycorrect number of cycles of length $k$. We are also going to consider thedot-product graph ${\mathcal G}^{prod}_t(E)$, $t \not=0$, where the verticesare the elements of $E$, and two vertices $x$, $y$ are connected by an edge if$x \cdot y \equiv x_1y_1+\dots+x_dy_d=t$. We obtain similar results in thiscase using more sophisticated methods necessitated by the fact that thefunction $x \cdot y$ is not translation invariant. The exponent $\frac{d+2}{2}$is improved for sufficiently long cycles.

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