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

Suppose $C$ is a compact, $n$-edged two-cell of the centered dualdecomposition of a locally finite set in the hyperbolic plane, a coarsening ofthe Delaunay tessellation which was introduced in the author's prior work. Wedescribe an effectively computable lower bound on the area of $C$, given an$n$-tuple of positive real numbers bounding the lengths of the edges of $C$below. The ancillary materials contain Python code implementing (for $n<10$) analgorithm to compute this bound. For geometrically reasonable edge lengthbounds, we expect the given area bound to be sharp or near-sharp.

Bounding the area of a centered dual two-cell below, given lower bounds on its side lengths