The power-compositions determinant and its application to global optimization
type: Item
instance of: scholarly article
zbMATH Open document ID: 1004.15013
DOI: 10.1137/S0895479800369141
author: Antonio Montes
author: Josep M. Brunat
published in: SIAM Journal on Matrix Analysis and Applications
publication date: 2002-04-23T00:00:00Z
Mathematics Subject Classification ID: 15A15
Mathematics Subject Classification ID: 15B36
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 1732251
zbMATH Keywords: factorization of determinant
zbMATH Keywords: Vandermonde matrix
zbMATH Keywords: homogeneous polynomial
zbMATH Keywords: powers of linear forms
zbMATH Keywords: difference of convex function
zbMATH Keywords: global optimization
MaRDI profile type: MaRDI publication profile
Recommended article: Q3985247
Recommended article: On some properties of Hamel bases connected with the continuity of polynomial functions
Recommended article: Ein topologischer Beitrag zur reellen Algebra.
Recommended article: Multinomial expansions and the pythagorean theorem
Recommended article: Q3834159
Recommended article: Positive polynomials on semi-algebraic sets
Recommended article: Comparison of the norms of homogeneous polynomials in several variables
Recommended article: Matrix solution of polynomial equations.
Recommended article: On the form of the power series for an algebraic function.
Recommended article: On commutation formulas in the algebra of quantum mechanics.
title: The power-compositions determinant and its application to global optimization
review text: Let \(C(n,p)=\{(a_1, \ldots, a_p)\in \mathbb Z_{\geq 0}^p: \sum_i a_i=n \}.\) For \(a,b\in C(n,p)\) define \(a^b=a_1^{b_1}\ldots a_n^{b_n}.\) Order the \(N={n+p-1 \choose p-1}\) elements of \(C(n,p)\) lexicographically, say, and form the \(N\times N\) matrix \(M(n,p)=(a^b).\) The main theorem is the following factorization theorem for the determinant of \(M(n,p):\) NEWLINE\[NEWLINE\det(M(n,p))=\prod_{k=1}^{\min\{n,p\}} \left(n^{{n-1\choose k}} \prod_{i=1}^{n-k+1} i^{(n-i+1){n-i-1 \choose k-2}} \right)^{{p\choose k}}.NEWLINE\]NEWLINE While this interesting theorem's proof occupies eight pages, the abstract underlines as a simple consequence that the polynomials \(p_a(x)=(a_1x_1+\ldots+a_px_p)^n\) with \(a\in C(n,p)\) form a basis for the vector space of homogeneous polynomials in \(\mathbb R[x_1,\ldots, x_p]\) of degree \(n.\) NEWLINENEWLINENEWLINEHowever, this fact is known since approximately a century as Biermann's theorem and has an easy proof: see p.31 of \textit{B. Reznick} [Sums of even powers of real linear forms, Mem. Am. Math. Soc. 463 (1992; Zbl 0762.11019)]. It is known that every \(C^2\)-function on a compact subset of \(\mathbb R^p\) can be written as a difference of convex functions; to do this constructively is in general difficult. For homogeneous polynomials Biermann's theorem yields an easy solution.
reviewed by: Alexander Kovačec
description: scientific article; zbMATH DE number 1732251