𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sparse Interpolation of Symmetric Polynomials

✍ Scribed by Alexander Barvinok; Sergey Fomin

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
225 KB
Volume
18
Category
Article
ISSN
0196-8858

No coin nor oath required. For personal study only.

✦ Synopsis

We develop efficient algorithms for computing the expansion of a given symmetric polynomial into Schur functions. This problem frequently arises in applications Ž as the problem of decomposing a given representation of the symmetric or general . linear group into irreducible constituents. Our algorithms are probabilistic, and run in time which is polynomial in the sizes of the input and output. They can be used to compute Littlewood᎐Richardson coefficients, Kostka numbers, and irreducible characters of the symmetric group.

πŸ“œ SIMILAR VOLUMES

Change of basis in polynomial interpolat
Change of basis in polynomial interpolation
✍ W. Gander πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 94 KB

## Abstract Several representations for the interpolating polynomial exist: Lagrange, Newton, orthogonal polynomials, etc. Each representation is characterized by some basis functions. In this paper we investigate the transformations between the basis functions which map a specific representation t

Sparse Resultant of Composed Polynomials
Sparse Resultant of Composed Polynomials I Mixed–Unmixed Case
✍ Hoon Hong; Manfred Minimair πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 381 KB

What happens to sparse resultants under composition? More precisely, let f 1 , . . . , fn be homogeneous sparse polynomials in the variables y 1 , . . . , yn and g 1 , . . . , gn be homogeneous sparse polynomials in the variables x 1 , . . . , xn. Let f i β€’ (g 1 , . . . , gn) be the sparse homogeneo

Sparse Resultant of Composed Polynomials
Sparse Resultant of Composed Polynomials II Unmixed–Mixed Case
✍ Manfred Minimair πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 306 KB

This paper is the second in a series of papers on sparse resultants of composed polynomials. In the first paper, "Sparse Resultant of Composed Polynomials I", Hong and Minimair (2000, http://minimair.org/HM2000.ps) considered the sparse resultant of polynomials having arbitrary (mixed) supports comp