On a decomposition of polynomials in several variables (Q558139): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The polynomial method and restricted sums of congruence classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nonlinear Functions of Linear Combinations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Waring's problem for binary forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse system of a symbolic power. II: The Waring problem for forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal reconstruction of a function from its projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of even powers of real linear forms / rank
 
Normal rank

Revision as of 12:12, 10 June 2024

scientific article
Language Label Description Also known as
English
On a decomposition of polynomials in several variables
scientific article

    Statements

    On a decomposition of polynomials in several variables (English)
    0 references
    0 references
    30 June 2005
    0 references
    In the theory of polynomial approximation, one uses the following lemma: for every sequence of \(d+1\) pairwise linearly independent vectors \((\alpha_\mu,\beta_\mu)\) of real numbers and every polynomial \(F(X,Y)\) with complex coefficients there exist univariate polynomials \(f_\mu\) with complex coefficients (\(1\leq \mu \leq d+1)\) such that \[ F(X,Y)=\sum_{\mu =1}^ {d+1} f_\mu(\alpha_\mu X+\beta_\mu Y). \] The author considers generalizations and refinements of this lemma. He considers polynomials in several variables of total degree at most \(d\) and with coefficients in a field of characteristic zero or \({}>d\). In particular he shows that a naive generalization of this lemma does not hold, but obtains sufficient conditions for similar decompositions to exist. In such a generality, the problem appears to be quite difficult.
    0 references
    polynomial approximation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references