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 investigate isometric embeddings of finite metric trees into$(\mathbb{R}^n,d_{1})$ and $( \mathbb{R}^n, d_{\infty})$. We prove that afinite metric tree can be isometrically embedded into $(\mathbb{R}^n,d_{1})$ ifand only if the number of its leaves is at most $2n$. We show that a finitestar tree with at most $2^n$ leaves can be isometrically embedded into$(\mathbb{R}^{n}, d_{\infty})$ and a finite metric tree with more than $2^n$leaves cannot be isometrically embedded into $(\mathbb{R}^{n}, d_{\infty})$. Weconjecture that an arbitrary finite metric tree with at most $2^n$ leaves canbe isometrically embedded into $(\mathbb{R}^{n}, d_{\infty})$.

Isometric Embeddings of Finite Metric Trees into $(\mathbb{R}^n,d_{1})$ and $(\mathbb{R}^n,d_{\infty})$