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 $T(\Z_m \times \Z_n)$ denote the maximal number of points that can beplaced on an $m \times n$ discrete torus with "no three in a line," meaning nothree in a coset of a cyclic subgroup of $\Z_m \times \Z_n$. By proving upperbounds and providing explicit constructions, for distinct primes $p$ and $q$,we show that $T(\Z_p \times \Z_{p^2}) = 2p$ and $T(\Z_p \times \Z_{pq}) = p+1$.Via Gr\"obner bases, we compute $T(\Z_m \times \Z_n)$ for $2 \leq m \leq 7$ and$2 \leq n \leq 19$.

The no-three-in-line problem on a torus