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

We improve the lower bound on the extremal version of the Maximum AgreementSubtree problem. Namely we prove that two binary trees on the same $n$ leaveshave subtrees with the same $\geq c\log\log n$ leaves which are homeomorphic,such that homeomorphism is identity on the leaves.

An improved bound on the Maximum Agreement Subtree problem