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

Some general properties of strongly asymmetric sequences generated by m ? 1 elements (m-SAS) are given. Computational experience with two algorithms-for listing of all 4-SASs of a given length n and for generating the smallest 4-SAS of length ii 1, 2, * * . -supports the conjecture that there exists an infinite 4-SAS. The smallest 4-SAS of length 592 is presented. Let us put

Strongly asymmetric sequences generated by four elements