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

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this article, we study the structure of the graph implied by a given mapon the set $S_p=\{1,2,\dots,p-1\}$, where $p$ is an odd prime. The consecutiveapplications of the map generate an integer sequence, or in graph theoreticalcontext a walk, that is linked to the discrete logarithm problem.

az eszterházy károly tanárképző főiskola tudományos közleményei. tanulmányok a matematikai tudományok köréből/az eszterházy károly főiskola tudományos közleményei. tanulmányok a matematikai tudományok köréből/annales mathematicae et informaticae

On sunlet graphs connected to a specific map on $\{1,2,\dots,p-1\}$