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/

Global: Zendy Plus annual

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

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $E \subset {\Bbb F}_q^d$, the $d$-dimensional vector space over a finitefield with $q$ elements. Construct a graph, called the distance graph of $E$,by letting the vertices be the elements of $E$ and connect a pair of verticescorresponding to vectors $x,y \in E$ by an edge if$||x-y||={(x_1-y_1)}^2+\dots+{(x_d-y_d)}^2=1$. We shall prove that if the sizeof $E$ is sufficiently large, then the distance graph of $E$ contains longnon-overlapping paths and vertices of high degree.

Long paths in the distance graph over large subsets of vector spaces over finite fields