Do you want to publish a course? Click here

Polynomial-exponential decomposition from moments

158   0   0.0 ( 0 )
 Added by Bernard Mourrain
 Publication date 2016
  fields
and research's language is English




Ask ChatGPT about the research

We analyze the decomposition problem of multivariate polynomial-exponential functions from truncated series and present new algorithms to compute their decomposition. Using the duality between polynomials and formal power series, we first show how the elements in the dual of an Artinian algebra correspond to polynomial-exponential functions. They are also the solutions of systems of partial differential equations with constant coefficients. We relate their representation to the inverse system of the roots of the characteristic variety. Using the properties of Hankel operators, we establish a correspondence between polynomial exponential series and Artinian Gorenstein algebras. We generalize Kronecker theorem to the multivariate case, by showing that the symbol of a Hankel operator of finite rank is a polynomial-exponential series and by connecting the rank of the Hankel operator with the decomposition of the symbol. A generalization of Pronys approach to multivariate decomposition problems is presented , exploiting eigenvector methods for solving polynomial equations. We show how to compute the frequencies and weights of a minimal polynomial-exponential decomposition , using the first coefficients of the series. A key ingredient of the approach is the flat extension criteria, which leads to a multivariate generalization of a rank condition for a Carath{e}odory-Fej{e}r decomposition of multivariate Hankel matrices. A new algorithm is given to compute a basis of the Artinian Gorenstein algebra, based on a Gram-Schmidt orthogonalization process and to decompose polynomial-exponential series. A general framework for the applications of this approach is described and illustrated in different problems. We provide Kronecker-type theorems for convolution operators, showing that a convolution operator (or a cross-correlation operator) is of finite rank, if and only if, its symbol is a polynomial-exponential function, and we relate its rank to the decomposition of its symbol. We also present Kronecker-type theorems for the reconstruction of measures as weighted sums of Dirac measures from moments and for the decomposition of polynomial-exponential functions from values. Finally, we describe an application of this method for the sparse interpolation of polylog functions from values.



rate research

Read More

201 - Rima Khouja 2021
In data processing and machine learning, an important challenge is to recover and exploit models that can represent accurately the data. We consider the problem of recovering Gaussian mixture models from datasets. We investigate symmetric tensor decomposition methods for tackling this problem, where the tensor is built from empirical moments of the data distribution. We consider identifiable tensors, which have a unique decomposition, showing that moment tensors built from spherical Gaussian mixtures have this property. We prove that symmetric tensors with interpolation degree strictly less than half their order are identifiable and we present an algorithm, based on simple linear algebra operations, to compute their decomposition. Illustrative experimentations show the impact of the tensor decomposition method for recovering Gaussian mixtures, in comparison with other state-of-the-art approaches.
Exponential varieties arise from exponential families in statistics. These real algebraic varieties have strong positivity and convexity properties, familiar from toric varieties and their moment maps. Among them are varieties of inverses of symmetric matrices satisfying linear constraints. This class includes Gaussian graphical models. We develop a general theory of exponential varieties. These are derived from hyperbolic polynomials and their integral representations. We compare the multidegrees and ML degrees of the gradient map for hyperbolic polynomials.
We study averages over squarefree moduli of the size of exponential sums with polynomial phases. We prove upper bounds on various moments of such sums, and obtain evidence of un-correlation of exponential sums associated to different suitably unrelated and generic polynomials. The proofs combine analytic arguments with the algebraic interpretation of exponential sums and their monodromy groups.
Assuming Schanuels conjecture, we prove that any polynomial exponential equation in one variable must have a solution that is transcendental over a given finitely generated field. With the help of some recent results in Diophantine geometry, we obtain the result by proving (unconditionally) that certain polynomial exponential equations have only finitely many rational solutions. This answers affirmatively a question of David Marker, who asked, and proved in the case of algebraic coefficients, whether at least the one-variable case of Zilbers strong exponential-algebraic closedness conjecture can be reduced to Schanuels conjecture.
144 - Yu-Wei Fan , Lie Fu , Genki Ouchi 2020
For classical dynamical systems, the polynomial entropy serves as a refined invariant of the topological entropy. In the setting of categorical dynamical systems, that is, triangulated categories endowed with an endofunctor, we develop the theory of categorical polynomial entropy, refining the categorical entropy defined by Dimitrov-Haiden-Katzarkov-Kontsevich. We justify this notion by showing that for an automorphism of a smooth projective variety, the categorical polynomial entropy of the pullback functor on the derived category coincides with the polynomial growth rate of the induced action on cohomology. We also establish in general a Yomdin-type lower bound for the categorical polynomial entropy of an endofunctor in terms of the induced endomorphism on the numerical Grothendieck group of the category. As examples, we compute the categorical polynomial entropy for some standard functors like shifts, Serre functors, tensoring line bundles, automorphisms, spherical twists, P-twists, and so on, illustrating clearly how categorical polynomial entropy refines the study of categorical entropy and enables us to study the phenomenon of categorical trichotomy. A parallel theory of polynomial mass growth rate is developed in the presence of Bridgeland stability conditions.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا