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

For any given finite group, Schulte and Williams (Discrete Comput Geom 54(2):444–458, ) establish the existence of a convex polytope whose combinatorial automorphisms form a group isomorphic to the given group. We provide here a shorter proof for a stronger result: the convex polytope we build for the given finite group is binary, and even combinatorial in the sense of Naddef and Pulleyblank (J Combin Theory Ser B 31(3):297–312, ); the diameter of its skeleton is at most 2; any combinatorial automorphism of the polytope is induced by some isometry of the space; any automorphism of the skeleton is a combinatorial automorphism.

Any Finite Group is the Group of Some Binary, Convex Polytope