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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The Erd\H os-Falconer distance problem in $\mathbb{Z}_q^d$ asks one to showthat if $E \subset \mathbb{Z}_q^d$ is of sufficiently large cardinality, then$\Delta(E) := \{(x_1 - y_1)^2 + \dots + (x_d - y_d)^2 : x, y \in E\}$ satisfies$\Delta(E) = \mathbb{Z}_q$. Here, $\mathbb{Z}_q$ is the set of integers modulo$q$, and $\mathbb{Z}_q^d$ is the free module of rank $d$ over $\mathbb{Z}_q$.We extend known results in two directions. Previous results were known only inthe setting $q = p^{\ell}$, where $p$ is an odd prime, and as such only showedthat all units were obtained in the distance set. We remove the constrictionthat $q$ is a power of a prime, and despite this, shows that the distance setof $E$ contains \emph{all} of $\mathbb{Z}_q$ whenever $E$ is sufficientlylarge.

Results on the Erd\H os-Falconer distance problem in $\mathbb{Z}_q^d$ for odd $q$