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

Some changes in a recent convolution formula are performed here in order to clean it up by using more conventional notations and by making use of more referenced and documented components (namely Sierpiński’s polynomials, the Thue-Morse sequence, the binomial modulo 2 transform and its inverse). Several variants are published here, by reading afterwards summed coefficients in another order; the last formula is then turned back from a summation to a new divide-and-conquer recursive formula.

A Non-symmetric Divide-and-Conquer Recursive Formula for the Convolution of Polynomials and Power Series