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

On a convex polygonal chessboard, the number of combinatorial types ofnonattacking configuration of three identical chess riders with $r$ moves, suchas queens, bishops, or nightriders, equals $r(r^2+3r-1)/3$, as conjectured byChaiken, Hanusa, and Zaslavsky (2019). Similarly, for any number of identical3-move riders the number of combinatorial types is independent of the actualmoves.

A q-queens problem. VII. Combinatorial types of nonattacking chess riders