Questions tagged [multivariate-polynomial]

Let $R$ be a ring. A multivariate polynomial $p(x_1,\ldots,x_n)$ over $R$ is a finite sum of powers of the $x_i$s multiplied by coefficients in $R$.

A multivariate polynomial $p(x_1,\cdots,x_n)\in R[x]$ is a generalization of the one-variable version, namely a finite sum of terms of the form $x_1^{d_1}\cdot \ldots \cdot x_n^{d_n}$, where each $d_i\in \mathbb{N}^0$. We say the degree of this term is $\sum_i d_i$ and the degree of $p$ is the maximal degree of its terms. The notation is somewhat cumbersome; a system called index notation is usually used for the general case.

Over $\mathbb{R}$ and $\mathbb{C}$, multivariate polynomials are analytic, as one would expect, and multivariate polynomials can be differentiated formally over other fields as well.

Many, but interestingly not all, results about single-variable polynomials generalize to the multivariate case. For instance, compare:

The Fundamental Theorem of Algebra: Every degree $d$ polynomial in $\mathbb{C}[x]$ has $d$ roots, counted with multiplicity.

Bezout's Theorem: (paraphrased from here) If $C,D$ are complex projective curves with no common components, then if $i(C\cap D,p)$ is the intersection multiplicity of $C$ and $D$ at $p$, we have $$ \sum_{p\in C\cap D} i(C\cap D,p)= \deg(C)\deg(D) $$The two theorems are similar if we extend our notions of where ($\mathbb{C}$ must be extended to the projective plane) and what (defining intersection multiplicity is slightly involved).

An interesting example where the analogous property of one-variable polynomials is from the 1969 Putnam exam:

$\mathbb{R}^2$ represents the usual plane $(x, y)$ with $-\infty<x,y<\infty$. $p: \mathbb{R}^2 \to \mathbb{R}$ is a polynomial with real coefficients. What are the possibilities for the image $p(\mathbb{R}^2)$?

For $a\in\mathbb{R}$, the usual images $\{\{a\},\mathbb{R},[a,\infty),(-\infty,a]\}$ are retained. However, two variable polynomials can have images of the form $(a,\infty)$ or $(-\infty,a)$, i.e. they do not attain a min/max value, such as $p(x,y)=x^2+y^2+(1-xy)^2$.

187 questions
22
votes
2 answers

Division algorithm for multivariate polynomials?

We know that if $F$ is a field and $f(X)$ a non-zero polynomial in $F[X]$, then for every polynomial $g(X)$ we can find $q(X),r(X)$ such that $$g(X)=f(X)\cdot q(X)+r(X)$$ with $r(X)$ the zero polynomial or $\deg r(X)<\deg f(X)$. My question is: the…
18
votes
14 answers

How to prove $a^2 + b^2 + c^2 \ge ab + bc + ca$?

How can the following inequation be proven? $$a^2 + b^2 + c^2 \ge ab + bc + ca$$
14
votes
0 answers

On the properties of sum-of-squares polynomials

Definition 1. If a multivariate polynomial $f$ can be written as a finite sum of squared polynomials, i.e., $f(x)=\sum_{i = 1}^n g_i^2(x)$, then $f$ is SOS. Definition 2. If an $n$-variate polynomial $f$ is nonnegative on $\Bbb R^n$, then $f$ is…
14
votes
1 answer

Does there exist a bivariate polynomial that is positive exclusively in the 1st quadrant?

Does there exist a bivariate polynomial $p \in \Bbb R[x,y]$ that is positive iff $x, y > 0$? My motivation was originally to state multiple positivity conditions with one expression but now I'm just curious and unable to find the answer via search.
10
votes
2 answers

Number of coefficients of a multivariable polynomial

Let $g \in \mathbb{F}[x_1, \dots, x_n]$ be a polynomial of degree $d$ with $n$ variables. Number of its coefficients is ${n+d \choose d}$ Is there an easy proof? It clearly holds for univariate polynomial $n=1$. It holds even for some polynomials I…
9
votes
1 answer

Are multivariate polynomials determined by their values on a lattice?

In one variable, a polynomial (of any degree) is determined by its values on a finite set of points. More specifically if $p$ is a polynomial of degree $k$, and $x_0 , \dots x_{k}$ are points for which we know the values $\{p(x_{i})\}_{i=0}^{k}$,…
8
votes
1 answer

Lagrange interpolation of multivariate polynomials

Given a univariate polynomial of degree $n$ with coefficients from a field, the polynomial is uniquely defined by $n+1$ evaluation points. That is, given $n+1$ points $(i, f(i))$, one can uniquely determine $f$. Is there a similar statement for…
7
votes
1 answer

Show any root of an elementary symmetric polynomial does not have positive imaginary part in all it's components

We define $H=\{u \in \mathbb{C}: \text{im}(u)>0\}$ to be the open upper half plane. For $n \in \mathbb{N}$ and $k = 1, \ldots n$ let $e_{n,k}(x_1,\ldots,x_n)=\sum\limits_{1 \leq j_1 < \ldots < j_k \leq n}~\prod\limits_{r=1}^k~x_{j_r}$ be the…
7
votes
1 answer

There exist polynomials $p_1, p_2, p_3, p_4 \in {\Bbb R} [x,y,z]$ so that $(x^2+y^2+z^2)^3-8(z^3x^3+x^3y^3+y^3z^3)=p_1^2+p_2^2+p_3^2+p_4^2$

Ji Chen posted the following on AoPS: Prove that there exist four polynomials $p_{1}, p_{2}, p_{3}, p_{4}$ in $x, y, z$ so that $$\left ( x^{2}+ y^{2}+ z^{2} \right )^{3}- 8\left ( z^{3}x^{3}+ x^{3}y^{3}+ y^{3}z^{3} \right )= p_{1}^{2}+ p_{2}^{2}+…
6
votes
1 answer

Is $R[[x]][[y]]$ the same as $R[[x,y]]?$

Let $x,y$ be two central indeterminates in $R$, is $R[[x]][[y]]=R[[x,y]]$? My take on this is: Let $f(x,y) \in R[[x]][[y]]$, then $f(x,y) = \sum_{i=0}^{\infty}g_i(x)y^i = \sum_{i=0}^{\infty}\sum_{j=0}^{\infty}r_{i,j}x^jy^i \in R[[x,y]]$. So…
6
votes
1 answer

$x^a+ y^b + z^c$ is irreducible in $\mathbb C[x,y,z]$

Let $a,b,c$ be positive integers. Then $f = x^a + y^b + z^c$ is irreducible in $\mathbb{C}[x,y,z]$. By Gauss, $f$ is irreducible in $\mathbb{C}[x,y,z]$ iff is so in $\mathbb{C}(z)[x,y]$, and so iff in $\mathbb{C}(y, z)[x]$. So by Eisenstein, it…
6
votes
2 answers

Multivariate polynomial functional equation

I’m having some difficulties solving the following functional equation: Find all polynomials $P(x,y)\in\mathbb{R}[X,Y]$ for which: $P(x,y)$ is homogeneous (so $\exists n\in\mathbb{N}, \forall x,y,t\in\mathbb{R}: P(tx,ty)=t^n\cdot…
5
votes
0 answers

Number of monomials in product of total-degree-bounded dense polynomials and connection to Fuss–Catalan numbers

I have a combinatorial question involving multivariate polynomials. Let $n$ be a positive integer, and consider $n$ polynomials $p_1, p_2, \ldots, p_n$, where each $p_k$ is a dense polynomial in $k$ variables $x_1, \ldots, x_k$, consisting of all…
5
votes
1 answer

Is $x^my^n+x^py^q+1$ irreducible in $\mathbb{C}[x,y]$?

I am trying to prove that the bivariate polynomial $ x^m y^n + x^p y^q+ 1 $ is irreducible in $ \mathbb{C}[x, y] $, where $ m, n, p, q \in \mathbb{Z}_+ $, $m$ is coprime to $p$ , $n$ is coprime to $q$ , and $mq-np\neq 0$. For special cases of the…
5
votes
0 answers

How can I integrate over the product of two multivariate normal distributions?

Suppose that $\mathbf{y} \sim N(\mathbf{n},\sigma^2\mathbf{I})$ and $\mathbf{n} \sim N(\boldsymbol{\mu},\boldsymbol{\Sigma})$. I want to integrate the following: $$\int [\mathbf{y}\mid\mathbf{n},\sigma^2][\mathbf{n} \mid…
1
2 3
12 13