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/

Zendy Plus

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

Zendy Tools

Zendy Open

A finite subset of a Euclidean space is called an $s$-distance set if thereexist exactly $s$ values of the Euclidean distances between two distinct pointsin the set. In this paper, we prove that the maximum cardinality among all5-distance sets in $\mathbb{R}^3$ is 20, and every $5$-distance set in$\mathbb{R}^3$ with $20$ points is similar to the vertex set of a regulardodecahedron.

A proof of a Dodecahedron conjecture for distance sets