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 inductively describe an embedding of a complete ternary tree T h of height h into a hypercube Q of dimension at most (1.6)h + 1 with load 1, dilation 2, node congestion 2 and edge congestion 2. This is an improvement over the known embedding of T h into Q. And it is very close to a conjectured embedding of Havel [3] which states that there exists an embedding of T h into its optimal hypercube with load 1 and dilation 2. The optimal hypercube has dimension (log 2 3)h (= (1.585)h) or (log 2 3)h + 1.

Embedding complete ternary trees into hypercubes