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/

Zendy Plus

Presents the zaia usage as premium feature

ZAIA

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the access of premium content as premium feature

Premium Content

Zendy Tools

Zendy Open

Let  T  be a general complex tensor of format(   n  1   ,  …  ,   n  d   ){(n_{1},\dots,n_{d})}   . When the fraction∏  in  i   /   [   1  +    ∑  i    (    n  i   -  1   )]{\prod_{i}n_{i}/[1+\sum_{i}(n_{i}-1)]}    is an integer, and a natural inequality (called balancedness) is satisfied, it is expected that  T  has finitely many minimal decomposition as a sum of decomposable tensors. We show how homotopy techniques allow us to find all the decompositions of  T , starting from a given one. Computationally, this gives a guess regarding the total number of such decompositions. This guess matches exactly with all cases previously known, and predicts several unknown cases. Some surprising experiments yielded two new cases of generic identifiability: formats(  3  ,  4  ,  5  ){(3,4,5)}    and(  2  ,  2  ,  2  ,  3  ){(2,2,2,3)}    which have a unique decomposition as the sum of six and four decomposable tensors, respectively. We conjecture that these two cases together with the classically known matrix pencils are the only cases where generic identifiability holds, i.e., the only  identifiable  cases. Building on the computational experiments, we use algebraic geometry to prove these two new cases are indeed generically identifiable.

Homotopy techniques for tensor decomposition and perfect identifiability