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

Erd\H{o}s-Ginzburg-Ziv theorem is a famous theorem in additive number theory,which states any sequence of $2n-1$ integers contains a subsequence of $n$elements, with their sum being a multiple of $n$. In this article, we providean algorithm finding a solution of Erd\H{o}s-Ginzburg-Ziv theorem in$\mathcal{O}(n \log n)$ time. This is the first known deterministic$\mathcal{O}(n \log n)$ time algorithm finding a solution ofErd\H{o}s-Ginzburg-Ziv theorem.

Simple deterministic O(n log n) algorithm finding a solution of Erd\H{o}s-Ginzburg-Ziv theorem