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 $\tau_{m,n}$ denote the maximal number of points on the discrete torus(discrete toric grid) of sizes $m \times n$ with no three collinear points. Thevalue $\tau_{m,n}$ is known for the case where $\gcd(m,n)$ is prime. It is alsoknown that $\tau_{m,n} \leq 2\gcd(m,n)$.  In this paper we generalize some of the known tools for determining$\tau_{m,n}$ and also show some new. Using these tools we prove that thesequence $(\tau_{z,n})_{n \in \mathbb{N}}$ is periodic for all fixed $z > 1$.In general, we do not know the period; however, if $z = p^a$ for $p$ prime,then we can bound it. We prove that $\tau_{p^a,p^{(a-1)p+2}} = 2p^a$ whichimplies that the period for the sequence is $p^b$ where $b$ is at most$(a-1)p+2$.

No-three-in-line problem on a torus: periodicity