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

An encoding of directed acyclic graphs (DAGs) on labeled vertices isproposed, which is a generalisation of the Pr\"ufer code for labeled trees, ifa certain orienation on the edges of the tree is introduced. Hence it is shownthat the number of sequences $S_1, S_2, \ldots, S_{n-1}$ of subsets of $\{1, 2,\ldots, n\}$ with the property that $|\bigcup_{i=1}^kS_i|\leq k$ for every$1\leq k \leq n-1$, is equal to the number of DAGs on $n$ labeled vertices.

A problem equivalent to counting directed acyclic graphs on labeled vertices