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

A small polygon is a polygon of unit diameter. The maximal area of a smallpolygon with $n=2m$ vertices is not known when $m \ge 7$. In this paper, weconstruct, for each $n=2m$ and $m\ge 3$, a small $n$-gon whose area is themaximal value of a one-variable function. We show that, for all even $n\ge 6$,the area obtained improves by $O(1/n^5)$ that of the best prior small $n$-gonconstructed by Mossinghoff. In particular, for $n=6$, the small $6$-gonconstructed has maximal area.

Tight bounds on the maximal area of small polygons: Improved Mossinghoff polygons