Reconstruction algorithms for sums of affine powers

DOI10.1016/j.jsc.2019.07.015zbMath1450.12001arXiv1607.05420OpenAlexW2961737083WikidataQ127478143 ScholiaQ127478143MaRDI QIDQ2284961

Ignacio García-Marco, Timothée Pecatte, Pascal Koiran

Publication date: 15 January 2020

Published in: Journal of Symbolic Computation, Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.05420

zbMATH Keywords

Wronskianunivariate polynomialWaring problemreconstruction algorithmtensor rankarithmetic circuitWaring decompositionsparsest shiftrepresentation of polynomialslinear differential equations with polynomial coefficientsshifted differential equationaffine powers

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational methods for problems pertaining to field theory (12-08)

Related Items (5)

Derandomization and absolute reconstruction for sums of powers of linear forms ⋮ Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond ⋮ A nearly optimal algorithm to decompose binary forms ⋮ Semialgebraic sets and real binary forms decompositions ⋮ Reconstruction algorithms for sums of affine powers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eigenvectors of tensors and algorithms for Waring decomposition
• Lower bounds by Birkhoff interpolation
• Symmetric tensor decomposition
• Interpolation of shifted-lacunary polynomials
• On the decidability of sparse univariate polynomial interpolation
• On the ranks and border ranks of symmetric tensors
• Factoring polynomials with rational coefficients
• Waring's problem for binary forms
• Decomposition of quantics in sums of powers of linear forms
• Algorithms for computing sparse shifts for multivariate polynomials
• Power sums, Gorenstein algebras, and determinantal loci. With an appendix `The Gotzmann theorems and the Hilbert scheme' by Anthony Iarrobino and Steven L. Kleiman
• Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases
• Sparse shifts for univariate polynomials
• A nearly optimal algorithm to decompose binary forms
• Reconstruction algorithms for sums of affine powers
• Typical real ranks of binary forms
• On the Alexander-Hirschowitz theorem
• A Superfast Randomized Algorithm to Decompose Binary Forms
• Monomials as sums of powers: The real binary case
• Lower Bounds for Sums of Powers of Low Degree Univariates
• Binary forms with three different relative ranks
• Polynomial Equivalence Problems for Sum of Affine Powers
• Symmetric Tensors and Symmetric Tensor Rank
• Affine projections of polynomials

This page was built for publication: Reconstruction algorithms for sums of affine powers