Sparse interpolation of symmetric polynomials

DOI10.1006/AAMA.1996.0508MaRDI QIDQ678607zbMATH OpenOpenAlexWikidataFDO

Authors Alexander Barvinok, Sergey Fomin

Publication date 6 July 1997

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/0b8c9014d2a3dfff091c1ab66a23500fecb9c5a1

zbMATH Keywords

Schur functionssparse interpolation problem

Mathematics Subject Classification ID

Differential algebra (12H05) Interpolation in approximation theory (41A05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Sparse multivariate polynomial interpolation on the basis of Schubert polynomials
• Symmetric function algebra on a computer
• Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications
• Sparse interpolation in terms of multivariate Chebyshev polynomials

Cites work

• Fast Parallel Matrix Inversion Algorithms
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• scientific article; zbMATH DE number 3828715 (Why is no real title available?)
• scientific article; zbMATH DE number 3766017 (Why is no real title available?)
• Multiplying Schur functions
• On the computational power of pushdown automata
• The interpolation problem for \(k\)-sparse sums of eigenfunctions of operators
• The representation theory of the symmetric groups

Cited in

(12)

• Sparse multivariate polynomial interpolation on the basis of Schubert polynomials
• Sparse polynomial interpolation with finitely many values for the coefficients
• Saxl conjecture for triple hooks
• An SVD analysis of equispaced polynomial interpolation
• Sparse polynomial interpolation in Chebyshev bases
• On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
• Polynomial homotopy method for the sparse interpolation problem. I: Equally spaced sampling
• An algorithm for the multiplication of symmetric polynomials
• Interpolation with symmetric polynomials
• Deterministically approximating the volume of a Kostka polytope
• Polynomial time classical versus quantum algorithms for representation theoretic multiplicities
• The number of steps in the Robinson-Schensted algorithm

This page was built for publication: Sparse interpolation of symmetric polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q678607)