Search arXivSearch

arXiv · math/0211176

Convexity properties of the cone of nonnegative polynomials

Abstract

We study metric properties of the cone of homogeneous non-negative multivariate polynomials and the cone of sums of powers of linear forms, and the relationship between the two cones. We compute the maximum volume ellipsoid of the natural base of the cone of non-negative polynomials and the minimum volume ellipsoid of the natural base of the cone of powers of linear forms and compute the coefficients of symmetry of the bases. The multiplication by (x_1^2 + ... + x_n^2)^m induces an isometric embedding of the space of polynomials of degree $2k$ into the space of polynomials of degree 2(k+m), which allows us to compare the cone of non-negative polynomials of degree $2k$ and the cone of sums of 2(k+m)-powers of linear forms. We estimate the volume ratio of the bases of the two cones and the rate at which it approaches 1 as m grows.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Grigoriy Blekherman. 2002-11-11. Convexity properties of the cone of nonnegative polynomials. https://arxiv.org/abs/math/0211176

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO