English
Related papers

Related papers: Hilbert functions and tensor analysis

200 papers

The Separation of Variables theory for the Hamilton-Jacobi equation is 'by definition' related to the use of special kinds of coordinates, for example Jacobi coordinates on the ellipsoid or St\"ackel systems in the Euclidean space. However,…

Mathematical Physics · Physics 2009-07-20 Giovanni Rastelli

We classify the twisted tensor products of a finite set algebra with a two elements set algebra using colored quivers obtained through considerations analogous to Ore extensions. This provides also a classification of entwining structures…

Rings and Algebras · Mathematics 2007-06-17 Claude Cibils

We consider the problem of separability: decide whether a Hermitian operator on a finite dimensional Hilbert tensor product is separable or entangled. We show that the tensor convolution defined for certain mappings on an almost arbitrary…

Mathematical Physics · Physics 2011-06-08 Gabriel Pietrzkowski

This chapter studies the problem of decomposing a tensor into a sum of constituent rank one tensors. While tensor decompositions are very useful in designing learning algorithms and data analysis, they are NP-hard in the worst-case. We will…

Data Structures and Algorithms · Computer Science 2020-07-31 Aravindan Vijayaraghavan

We consider the problem of learning a set from random samples. We show how relevant geometric and topological properties of a set can be studied analytically using concepts from the theory of reproducing kernel Hilbert spaces. A new kind of…

Machine Learning · Statistics 2014-11-26 Ernesto De Vito , Lorenzo Rosasco , Alessandro Toigo

In this paper we introduce the notion of linear computability as a method of finding the Waring rank of forms. We use this notion to find infinitely many new examples which satisfy Strassen's Conjecture.

Commutative Algebra · Mathematics 2015-06-15 Enrico Carlini , Maria Virginia Catalisano , Luca Chiantini , Anthony V. Geramita , Youngho Woo

A tensor $T$, in a given tensor space, is said to be $h$-identifiable if it admits a unique decomposition as a sum of $h$ rank one tensors. A criterion for $h$-identifiability is called effective if it is satisfied in a dense, open subset…

Algebraic Geometry · Mathematics 2017-03-09 Alex Massarenti , Massimiliano Mella , Giovanni Staglianò

Waring's problem, of expressing an integer as the sum of powers, has a very long history going back to the 17th century, and the problem has been studied in many different contexts. In this paper we introduce the notion of a Waring subspace…

Algebraic Geometry · Mathematics 2022-09-21 Michel Lavrauw , Ferdinando Zullo

We construct the deformation functor associated with a pair of morphisms of differential graded Lie algebras, and use it to study infinitesimal deformations of holomorphic maps of compact complex manifolds. In particular, using L-infinity…

Algebraic Geometry · Mathematics 2008-04-03 Donatella Iacono

We give a simple uniqueness criterion (and some derived criteria) for holomorphic Abel functions and show that Kneser's real analytic Abel function of the exponential is subject to this criterion.

Complex Variables · Mathematics 2010-06-22 Henryk Trappmann , Dmitrii Kouznetsov

A chopped ideal is obtained from a homogeneous ideal by considering only the generators of a fixed degree. We investigate cases in which the chopped ideal defines the same finite set of points as the original one-dimensional ideal. The…

Commutative Algebra · Mathematics 2024-12-05 Fulvio Gesmundo , Leonie Kayser , Simon Telen

In this paper a new general approach is developed to construct and study Lebesgue type decompositions of linear operators $T$ in the Hilbert space setting. The new approach allows to introduce an essentially wider class of Lebesgue type…

Functional Analysis · Mathematics 2023-09-20 Seppo Hassi , Henk de Snoo

We give an effective criterion for the identifiability of additive decompositions of homogeneous forms of degree $d$ in a fixed number of variables. Asymptotically for large $d$ it has the same order of the Kruskal's criterion adapted to…

Algebraic Geometry · Mathematics 2018-11-06 Edoardo Ballico

We introduce an inductive method for the study of the uniqueness of decompositions of tensors, by means of tensors of rank 1. The method is based on the geometric notion of weak defectivity. For three-dimensional tensors of type (a, b, c),…

Algebraic Geometry · Mathematics 2011-03-15 Luca Chiantini , Giorgio Ottaviani

We relate the condition numbers of computing three decompositions of symmetric tensors: the canonical polyadic decomposition, the Waring decomposition, and a Tucker-compressed Waring decomposition. Based on this relation we can speed up the…

Numerical Analysis · Mathematics 2024-07-02 Nick Dewaele , Paul Breiding , Nick Vannieuwenhoven

We use an algebraic approach to construct minimal decompositions of symmetric tensors with low rank. This is done by using Apolarity Theory and by studying minimal sets of reduced points apolar to a given symmetric tensor, namely, whose…

Commutative Algebra · Mathematics 2018-05-31 Bernard Mourrain , Alessandro Oneto

The Computational Algebraic Geometry applied in Algebraic Statistics; are beginning to exploring new branches and applications; in artificial intelligence and others areas. Currently, the development of the mathematics is very extensive and…

Algebraic Geometry · Mathematics 2017-08-09 M. P. Castillo-Villalba , J. O. González-Cervantes

For a semibounded sesquilinear form ${\mathfrak t}$ in a Hilbert space ${\mathfrak H}$ there exists a representing map $Q$ from ${\mathfrak H}$ to another Hilbert space ${\mathfrak K}$, such that ${\mathfrak t}[\varphi, \psi]-c(\varphi,…

Functional Analysis · Mathematics 2024-01-02 Seppo Hassi , Henk de Snoo

Compressed sensing extends from the recovery of sparse vectors from undersampled measurements via efficient algorithms to the recovery of matrices of low rank from incomplete information. Here we consider a further extension to the…

Numerical Analysis · Mathematics 2014-11-04 Holger Rauhut , Reinhold Schneider , Zeljka Stojanac

We present an algorithm for decomposing a symmetric tensor, of dimension n and order d as a sum of rank-1 symmetric tensors, extending the algorithm of Sylvester devised in 1886 for binary forms. We recall the correspondence between the…

Symbolic Computation · Computer Science 2010-11-29 Jerome Brachat , Pierre Comon , Bernard Mourrain , Elias Tsigaridas