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

\textsc{cut} is a class of partition games played on a finite number offinite piles of tokens. Each version of \textsc{cut} is specified by a cut-set$\mathcal{C}\subseteq\mathbb{N}$. A legal move consists of selecting one of thepiles and partitioning it into $d+1$ nonempty piles, where $d\in\mathcal{C}$.No tokens are removed from the game. It turns out that the nim-set for any$\mathcal{C}=\{1,2c\}$ with $c\geq 2$ is arithmetic-periodic, which answers anopen question of \cite{par}. The key step is to show that there is acorrespondence between the nim-sets of \textsc{cut} for $\mathcal{C}=\{1,6\}$and the nim-sets of \textsc{cut} for $\mathcal{C}=\{1,2c\}, c\geq 4$. Theresult easily extends to the case of $\mathcal{C} = \{1, 2c_1, 2c_2, 2c_3,...\}$, where $c_1,c_2, ... \geq 2$.

The Arithmetic-Periodicity of \textsc{cut} for $\mathcal{C}=\{1,2c\}$