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

We discuss coloring and partitioning questions related to Sperner’s Lemma, originally motivated by an application in hardness of approximation. Informally, we call a partitioning of the (k − 1)-dimensional simplex into k parts, or a labeling of a lattice inside the simplex by k colors, “Sperner-admissible” if color i avoids the face opposite to vertex i. The questions we study are of the following flavor: What is the Sperner-admissible labeling/partitioning that makes the total area of the boundary between different colors/parts as small as possible?

Sperner’s Colorings and Optimal Partitioning of the Simplex