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 consider the number of cyclic vertices in a random single-valued mapping of a set of size  n  whose graph contains  m  cycles. We obtain a theorem that describes the limit behaviour of this characteristic as  n  → ∞,  m  / ln n  → ∞,  m  / ln n  =  O (ln n ).

The limit distribution of the number of cyclic vertices in a random mapping in a special case