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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The core entropy of polynomials, recently introduced by W. Thurston, is ady-namical invariant extending topological entropy for real maps to complexpolynomials, whence providing a new tool to study the parameter space ofpolynomials. The base is a combinatorial algorithm allowing for the computationof the core entropy given by Thurston, but without supplying a proof. In thispaper, we will describe his algorithm and prove its validity.

On thurston's core entropy algorithm dedicated to the memory of tan lei