Questions in which polynomials (single or several variables) play a key role. It is typically important that this tag is combined with other tags; polynomials appear in very different contexts. Please, use at least one of the top-level tags, such as nt.number-theory, co.combinatorics, ...

learn more… | top users | synonyms

9
votes
0answers
120 views

Minimum value of $|p(1)|^2+|p(2)|^2 +…+ |p(n+3)|^2$ over all monic polynomials $p$

Let $n$ be a positive integer. Determine the smallest possible value of $|p(1)|^2+|p(2)|^2 +...+ |p(n+3)|^2$ over all monic polynomials $p$ of degree $n$. This question was proposed (problem ...
2
votes
0answers
64 views

Rank of a particular matrix

Denote $P_{2n}$ to be collection of homogeneous total degree $2$ real polynomials in exactly $2n$ variables such that coefficient of every monomial is either $1$ or $-1$. Split variable set into ...
-3
votes
0answers
66 views

How can I (iteratively) solve these equations? [on hold]

I am by no means a mathematician at all (programmer) so I need some pointers on how to solve the following equations - if someone could point me to a method that would work, that would be very ...
3
votes
0answers
54 views

Relation between linear independence of lattice vectors and the toric variety defined by that lattice

I have been reading some basic and elementary work on toric varieties, but even though people assured me that toric varieties are very well understood, several questions remained. Setup. Let ...
0
votes
0answers
37 views

Algebraic independence in normed spaces

A set of $n$ points in $\mathbb{R}^2$ is algebraically independent over $\mathbb{Q}$ if there is no polynomial dependency among the $2n$ coordinates. A result (Lemma 3.3) from "Globally linked pairs ...
-1
votes
1answer
50 views

Question on real polynomial in projective space [on hold]

Hi all I was given this question and desperately in need of help as it is part of my graduate studiess I know it is true but my instructor told me to find the right way to do it and I am really ...
-1
votes
2answers
303 views

What conditions imply that a function over $\mathbb{Z}$ is a polynomial? [on hold]

How would one prove that a function is a polynomial? I can't seem to find anything about this on the internet. I would like to know if there are any unique properties that only polynomials can ...
0
votes
0answers
71 views

How can I keep the roots of f(x)^n+g(x)^m far away from the roots of f and g?

More specifically, suppose for example I have $h(x)=\sum_{i=1}^k (x-i)^{d_i}$. Can I get any handle on the roots of $h(x)$? Can I somehow guarantee that the roots of $h(x)$ are not arbitrarily close ...
1
vote
1answer
69 views

Convergence of sequence of polynomials defined by boundary conditions

I'm sorry if my question sounds trivial, but analysis is not my field. Consider the interval $[a,b]\subset \mathbb{R}$. On $[a,b]$, for every $n\in\mathbb{N}$, $n\ge 3$, I define the polynomials ...
1
vote
0answers
62 views

The significance of the Parvaresh-Vardy curve

Even though this seems like a computer science question, it is purely mathematical and concerns polynomials and curves over finite fields. Consider the Parvaresh-Vardy list decoder. As I understand ...
4
votes
1answer
112 views

Motzkin polynomials and enumeration of chord diagrams

On page 12 of the paper Enumeration of chord diagrams on many intervals and their non-orientable analogs" by Alexeev, Andersen, Penner, and Zograf is a list of polynomials which are a refinement of ...
4
votes
3answers
88 views

counting complex roots which are root of unity times a real number

Let $p(x)$ be a monic polynomial over the integers. I want to count the number of roots which have the form $\zeta \cdot r$ where $\zeta$ is a root of unity and $r$ is a real number. To count the ...
4
votes
1answer
74 views

How to realize any non-crossing matching as $\mathrm{Re}[p(z)]=0$

Asymptotically any polynomial is $p(z) = z^n + O(z^{n-1})$. Therefore $\mathrm{Re}[p(z)]= r^n \cos(2\pi i \theta)$ which vanishes at $\theta = \frac{(k+ \frac{1}{2})\pi}{n}$. Those $2n$ line ...
-1
votes
0answers
74 views

Proving an inequality involving integer polynomial [migrated]

So we've got an integer polynomial $P$, and all we know about it is that $P(1) = 1$, $P(2) = 2$, and also $P(100) = -k$, where $k \in \mathbb{Z},\, k \geqslant 0$ - some unknown constant, which will ...
-2
votes
0answers
79 views

Given 2 bounded power series, whether one can be written as a compound power series of the other one?

Let $S(x) = \sum\limits_{i = 0}^\infty {{a_i}{x^i}} ,F(x) = \sum\limits_{i = 0}^\infty {{b_i}{x^i}} $ be two real bounded power series for all positive real $x$, and we assume: $S(x),F(x) \in ...
35
votes
0answers
2k views

How to prove this polynomial always has integer values at all integers?

Let $m$ be any positive integer. $$ P_m(x)=\sum_{i=0}^{m}\sum_{j=0}^{m}{x+j\choose j}{x-1\choose j}{j\choose i}{m\choose i}{i\choose m-j}\frac{3}{(2i-1)(2j+1)(2m-2i-1)}. $$ Question: $P_m(x)$ always ...
0
votes
0answers
52 views

An additive question on polynomials

Consider $S\cup T=\{0,1\}^n$ where $S\cap T=\emptyset$. Consider real multilinear (only monomials of form $x_ix_jx_k$) polynomials $P,Q$ such that: $$Q(S)=0\quad Q(T)\neq0\quad P(S)\neq0\quad ...
4
votes
1answer
106 views

Best polygonal approximation to a polynomial $\pm$ c

Let a planar region $R$ be defined by the vertical range bounded by a polynomial $f(x) \pm c$ with $c>0$ a constant, and with $x$ varying between the smallest and largest roots of $f(x)$. For ...
10
votes
3answers
554 views

About the prime divisors of values of polynomials

Let $P(x)$ be a polynomial having integer coefficients (and degree $\geq 3$), and let $p_1<p_2<\dots$ be the prime divisors occurring in the set of values $\{P(n):\ n\in\mathbb{Z}\}$. Is it ...
7
votes
2answers
245 views

When is $f(x^d)$ irreducible?

Let $f(x)$ be an irreducible polynomial of degree $n$ over a finite field $\mathbb F_p$. What can we say about $f(x^d)$? When is it irreducible ?
8
votes
1answer
330 views

The space of polynomials with all real roots

The question stems from an attempt to answer a question of David Speyer. Let $R \subseteq \mathbb{R}^n$ be the space of coefficients of all polynomials of degree $n$ whose all roots are real, i.e. $R ...
7
votes
0answers
191 views

Theorems proved using combinatorial nullstellensatz that have no other known proof

Alon's (or Alon and Tarsi's?) combinatorial nullstellensatz is a powerful algebraic tool with many applications in combinatorics and number theory. See this, this, this and this mathoverflow question. ...
2
votes
1answer
135 views

Chebyshev Polynomials

Given $$-\frac{1}2<a<\alpha<0<\beta<b<+\frac{1}2$$ $$+\frac{1}2<c<\gamma<1<\delta<d<+\frac{3}2$$ I want to find a polynomial $f(x)\in\Bbb R[x]$ such that ...
-6
votes
1answer
221 views

Quintic Equation [closed]

Can we solve the following polynomial quintic equation by radicals x^5 + x^4 = 1 I found one real root which is algebraic solution (no approximation method ...
2
votes
2answers
283 views

Can one estimate the distribution of eigenvalues of a matrix by its Cauchy/Stieltje transform?

Given a real symmetric $n$ dimensional matrix $A$, with eigenvalues $\lambda_i$ I am defining its Cauchy transform as the function, $f_A(z) = \sum_i \frac{1}{z-\lambda_i}\,$ Is there any information ...
21
votes
0answers
406 views

Finding a path through real rooted polynomials

This is a lemma I wanted in order to solve Patrizio Neff's conjecture. It turned out to be the wrong way to think about it, but I am still curious if it is true. Let $z^n+a_{n-1} z^{n-1} + \cdots + ...
1
vote
0answers
55 views

About properties of polynomials with common interlacing

Say $\{a_1,a_2,..,a_n\}$ and $\{b_1,b_2,...,b_n\}$ be the real roots of two monic polynomials of degree $n$ which have a common interlacing. (say I have arranged the roots in increasing order) Can ...
1
vote
0answers
51 views

Multivariable polynomial interpolation via evaluations from entrywise powers of a point

I am interested in multivariate polynomial interpolation. Within computational complexity theory, I use it to create efficient reductions between counting problems. In the univariate case, there is ...
35
votes
4answers
2k views

The sum of squared logarithms conjecture

I am searching for the first proof of (or counterexample to) the following conjecture. (The sum of squared logarithms conjecture) For all natural numbers $n$ and positive numbers $x_1,x_2, \ldots , ...
0
votes
1answer
126 views

When can two Cauchy transforms intersect?

Given two polynomials $p$ and $q$ over reals and being guaranteed that both have all roots real I want to know if there is any characterization of the solutions of the equation $\frac{p'}{p} = ...
0
votes
1answer
167 views

Find all possible rational pairs of a parametric sextic and all cases where it is reducible for either parameter

Find all possible rational solutions pairs $(z,a)$ of the equation $a^6 + a^4 (-18368 + 9184 z - 2912 z^2) + a^2 (61702144 - 61702144 z + 36814848 z^2 - 10694656 z^3 + 1748992 z^4) - z^2 ...
5
votes
2answers
183 views

Continuous map from connected subset of R^n to one of the real zero of an odd degree polynomial whose coefficients are polynoms of the variables

Let take a real multivariate polynomial $P(x_1, \ldots, x_n, y)$ such as the degree of P relatively to the variable $y$ is odd. Thus, for each $X = x_1,\ldots,x_n \in\mathbb{R}^n$, the univariate ...
1
vote
1answer
40 views

Splines linearly independent

Let $N_1:=\chi_{[0,1]}$ be defined as this characteristic function and $N_n:=N_{n-1}*N_1$ then this leads to polynomials with support $[0,n]$. These splines are well-studied click for wikipedia My ...
4
votes
1answer
175 views

Macaulay's example of prime ideals in $\mathbb C[X_1,X_2,X_3]$ having large number of generators

There is a famous example of Macaulay which shows that there are prime ideals of height two in $\mathbb C[X_1,X_2,X_3]$ having at least $l$ generators for any $l\ge 3$. In Macaulay's words, the ...
1
vote
1answer
49 views

Dimension of a certain subspace of univariate polynomials

Let $\mathbb{F}$ be an arbitrary field. For a polynomial $f\in\mathbb{F}[x]$, we use $Z(f)$ to denote set of roots of $f$ in $\mathbb{F}$. Let $S$ and $T$ be sets of elements of $\mathbb{F}$ of size ...
1
vote
1answer
210 views

Composition of rational functions

Given a rational function $R\in\Bbb R(x_1,\dots,x_n)$ with multilinear numerator and denominator, is there always a rational function $G\in\Bbb R(x)$ such that $G\circ R\in\Bbb R[x_1,\dots,x_n]$, ...
2
votes
0answers
102 views

What are the general zonal spherical functions for ${\rm SO}(n)/{\rm SO}(n-1)$?

The zonal spherical functions [1] on the sphere $(G={\rm SO}(n)$, $K={\rm SO}(n-1))$ are the Gegenbauer or ultraspherical polynomials if one considers the irreducible representations of ${\rm SO}(n)$ ...
5
votes
0answers
158 views

Degree of Chebyshev polynomial necessary

In general, given $0<a<1$, I want to find a polynomial $f(x)\in\Bbb R[x]$ such that $f(x)\in[1-\frac{a}2,1+\frac{a}2]$ at every $x\in[1-a,1+a]$ and $f(0)=0$. What is minimum degree that is ...
0
votes
1answer
285 views

cup-length of the first Chern class of complex grassmannian

Let $G_2(\mathbb{C}^{n+1})$ be the complex grassmannian. Then the cohomology ring $H^*(G_2(\mathbb{C}^{n+1});\mathbb{C})=\mathbb{C}[c_1,c_2]/(f_n,f_{n+1})$, where ...
8
votes
3answers
465 views

Degree necessary of a polynomial?

Given $-1<a<b<0$, I want to find a polynomial $f(x)\in\Bbb R[x]$ such that $f(x)\in[a,b]$ at every $x\in[b^2,a^2]$ and $f(0)=0$. What is minimum degree that is needed and maximum degree that ...
1
vote
1answer
167 views

a problem about ideals of polynomial rings

Let $\{f_n\}_{n=1}^\infty\in \mathbb{C}[x,y]$ be a sequence of polynomials given by the following expressions $$ f_n(x,y)=\sum_{i=0}^{[\dfrac{n}{2}]}(-1)^{n-i}{{n-i}\choose i}x^{n-2i}y^i. $$ Let ...
13
votes
1answer
376 views

Positive roots of a polynomial

Let $a_i>0$, $i=1,\dots,n$, and put $\overline{a}:=\frac{1}{n}\sum_{i=1}^n a_i$. Assuming not all $a_i$'s are equal, take $$ p(x):=\sum_{i=1}^n a_i (a_i-\overline{a})\prod_{k=1,\dots,n\;k\neq i} ...
9
votes
3answers
349 views

Computing minimal polynomials using LLL

I would like to use the Lenstra–Lenstra–Lovász lattice basis reduction algorithm (LLL algorithm) to compute the minimal polynomial of a (real) algebraic number $\alpha$ from a decimal approximation ...
0
votes
2answers
116 views

Irreducibles in polynomial rings

Let R be a reduced ring with characteristic zero which is not an integral domain. Is "x" necessarily non irreducible in R[x]?
2
votes
1answer
178 views

Smallest degree of approximating polynomial

Let $\{0,1\}^n=S_0\cup S_1$ withh $S_0\cap S_1=\emptyset$. Let $\epsilon\in[\frac{1}2,1)$. Let $f:\Bbb R^n\rightarrow\Bbb R$ be a polynomial such that $$f(S_0)=0,\mbox{ ...
0
votes
0answers
72 views

Factoring a polynomial in a specific manner

Let $f(x,y,z) = ax^d + b y^k z^{d-k} + c$, where $a,b,c \in \mathbb{C}$ and $abc \ne 0$, and $d \geq 3$. Let $d'$ denote the smallest non-negative integer $l$ such that there does not exist a positive ...
1
vote
0answers
84 views

Generalization of Schur polynomials

I am making a list of generalizations of Schur polynomials and other closely related polynomials that appear in representation theory. My motivation is to eventually make a nice poster of ...
2
votes
3answers
207 views

ideals of polynomial ring with complex number coefficients

Let $\mathbb{C}[x,y]$ be the polynomial ring with variables $x,y$ and coefficient in $\mathbb{C}$. Let $f,g\in \mathbb{C}[x,y]$. Let $(f,g)$ be the ideal of $\mathbb{C}[x,y]$ generated by $f,g$. ...
13
votes
4answers
762 views

Random Diophantine polynomials: Percent solvable?

Suppose one generates a random polynomial of degree $d$ with integer coefficients uniformly distributed within $[-c_\max,c_\max]$. For example, for $d=8$, $|c_\max|=100$, here is one random ...
4
votes
1answer
169 views

Multivariable function analysis

Sorry if the terms I'm going to use is not professional enough:) This is about the complexity analysis of an algorithm. Let $\alpha$ be the greatest real root of the polynomial ...