Questions tagged [polynomials]
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, ac.commutative-algebra, in addition to it. Also, note the more specific tags for some special types of polynomials, e.g., orthogonal-polynomials, symmetric-polynomials.
2,819 questions
3
votes
0
answers
110
views
Characterize nonzero integers via a polynomial in two variables
In a paper published in 1985, Shih-Ping Tung observed that an integer $m$ is nonzero if and only if $m=(2x+1)(3y+1)$ for some $x,y\in\mathbb Z$. In fact, we can write a nonzero integer $m$ as
$\pm3^a(...
0
votes
0
answers
43
views
Linear-Disjointness of the field obtained upon iterated pre-images
Suppose $K$ is a number field and we have finitely many elements $\alpha_{1}, \ldots, \alpha_{k} \in K$ and a polynomial $f(x)\in K[x]$ of degree $\geq 2$. Given $m \geq 1$, we define $K_{m}(\alpha_{i}...
1
vote
0
answers
156
views
Zeros of the partial sums $\sum_{k=0}^n (-1)^k/(z-k)$
let
$$
D_n(z)=\sum_{k=0}^n \frac{(-1)^k}{z-k}
=\frac{P_n(z)}{Q_n(z)}, \qquad
Q_n(z) = \prod_{k=0}^n (z-k).
$$
We have $\deg P_n = n$ ($n$ even), and $\deg P_n = n-1$ ($n$ odd). Moreover, using the ...
2
votes
1
answer
307
views
How close can general algebraic curves get to rational curves?
Let $K$ be a field (one may assume that $K$ has characteristic zero and is algebraically closed, if this helps), and let $f \in K[x,y]$. Suppose that the curve $C_f : f(x,y) = 0$ is not a rational ...
3
votes
0
answers
144
views
+50
Many degree $d$ nilpotent elements of quotients of polynomial rings and non-vanishing product
Generalization of this question.
Let $n$ be positive integer and $f_1(x_1,...,x_k), \dots, f_m(x_1,...x_k)$
polynomials with integer coefficients.
Let $K=\mathbb{Z}/n\mathbb{Z}[x_1,...,x_k]/\langle ...
2
votes
1
answer
660
views
A question about positive polynomials
Are there some $P,Q \in \mathbb R_+[x]$ with $(x+10)^{2025}=(x+2025)^2P(x)+(x+2024)^2Q(x)$ ?
PS : the AI give an negative answer in the case $(x+1)^{2025}$
I have posted the question here (*), but no ...
2
votes
0
answers
91
views
Can $w^2+bx^2+cy^2+dz^2$ be universal over a sparse subset of $\mathbb N$?
Let $b,c,d\in\mathbb N=\{0,1,2,\ldots\}$ with $1\le b\le c\le d$. For a subset $S$ of $\mathbb N=\{0,1,2,\ldots\}$, if
$$\{w^2+bx^2+cy^2+dz^2:\ w,x,y,z\in S\}=\mathbb N$$
then we say that $w^2+bx^2+cy^...
2
votes
0
answers
80
views
About shapes of bivariate polynomials
Let $f \in \mathbb{C}[x,y]$. It is known that $f$ can be factored into Puiseux series. Indeed, if we write
$$\displaystyle f(x,y) = \sum_{j=0}^n a_j(x) y^j,$$
then we can obtain a factorization of the ...
1
vote
0
answers
48
views
Effective bounds for degree and height in algebraic number enumeration
I am considering a specific enumeration of all complex algebraic numbers within the unit ball, defined as follows:
Enumerate all primitive, irreducible polynomials in $\mathbb{Z}[x]$ with positive ...
2
votes
0
answers
80
views
Asymptotic of dimensions of subvarieties of linear spaces that are nearly norm-dense in the unit balls
This is a follow-up to this question. I will start with the problem statement first (here, $B_n$ denotes the closed Euclidean unit ball of $\mathbb{R}^n$):
Fix sufficiently small $\varepsilon > 0$....
2
votes
0
answers
172
views
Irreducibility of a degree-$27$ polynomial through Newton polygon or residual reduction
Let $K=\mathbb{Q}_3(t)$ be the finite extension of the $3$-adic number field $\mathbb{Q}_3$, where $t=3^{1/13}$. I want to know if the polynomial $$f(x)=(x^9-t^2)^3-3^4x+3^3t^5 \in K[x]$$ is ...
3
votes
1
answer
385
views
Question about common zeros of hypersurfaces in projective space
Let $V$ be a vector space of homogeneous polynomials of degree $d$ in $n$ variables, or equivalently a subspace of the linear system of degree $d$ hypersurfaces in projective space $\mathbb{P}^{n-1}(\...
1
vote
0
answers
49
views
Degree of multidimensional resultant arising from a "traceless" polynomial decomposition
In the course of my PhD project, I have encountered the following problem concerning multidimensional resultants.
I am interested in characteristic polynomials of traceless matrices, i.e., univariate ...
0
votes
0
answers
36
views
$O(1)$ algorithm for factoring integers of the form $n=X (X^D+O(X^{D-1}))$
Factorization of integers of special forms are of both theoretical
interest and cryptographic implications.
Experimentally we found a seemingly "large" set of integers for which a divisor ...
1
vote
0
answers
103
views
Determinantal elimination for $f_i=x_i(y+t_i)-1$: is there an analogue for $f_i=x_i(y+t_i z+s_i)-1$?
Consider the polynomials
$$
f_i = x_i (y + t_i) - 1,
$$
where the variables are $x_i$ and $y$.
Experiments indicate that, if the coefficients $t_i$ are algebraically independent, then there exists a ...
2
votes
0
answers
107
views
Calculating Polynomial Resultants Quickly
I'm working on a project that requires quickly calculating the resultant of two polynomials in $\mathbb{Z}[x]$ of large degree $d,e$. On the Wikipedia article for polynomial resultants, it says that
...
4
votes
1
answer
259
views
Is $\mathbb{Z}_{>0}$ diophantine in $(\mathbb{Q}_{>0},+,\cdot,1)$?
It is well known that we can define $\mathbb{N}$ in $(\mathbb{Z},+,\cdot)$ via an existentially quantified equality, as follows. Letting $n$ be an integer parameter
$$
n\in \mathbb{N} \...
0
votes
0
answers
177
views
On quadratic equations over the Gaussian ring $\mathbb Z[i]$
In 1972 C. L. Siegel proved that there is an algorithm to decide for any polynomial $P(x_1,\ldots,x_n)\in\mathbb Z[x_1,\ldots,x_n]$ with $\deg P=2$ whether
$$P(x_1,\ldots,x_n)=0$$ for some $x_1,\ldots,...
0
votes
0
answers
61
views
Divided differences of TP kernels yield distinct, real-rooted polynomials
Let $\{w_j:~1\le j\le N\}$ be a set of non-zero real numbers with $\sum_{j} \frac{1}{|w_j|}<\infty$. We define a polynomial $P(\xi,z)=\sum_{k=0}^{N-1}f_s(\xi)z^{s}$, where $f_s(\xi)$ is a real ...
7
votes
0
answers
280
views
Polynomial identification of natural numbers
Let $n$ be an integer parameter. Is there a polynomial $f(x,y,n)\in \mathbb{Z}[x,y,n]$ such that
$$
n\in \mathbb{N} \Longleftrightarrow \exists x,y\in \mathbb{Z}, f(x,y,n)=0?
$$
This is a generalized ...
1
vote
0
answers
117
views
On the largest Eigenvalue of a certain "graph Laplacian"
I am interested in the following problem, which came up while working on this paper about estimating Betti numbers of Kähler manifolds, where we were not able to solve it and had to resort to ...
5
votes
1
answer
202
views
Remez-type inequality
This question is about a statement on a Remez-type inequality from the paper Polynomial Inequalities on Measurable Sets and Their Applications by M. I. Ganzburg (Constr. Approx. (2001) 17: 275–306).
...
0
votes
1
answer
133
views
Must $x (x^D+1) -n=0$ have at most one root over the integers for $D>1$?
Let $D>1,n>0$ be integers. For all $D,n$, must $x (x^D+1) -n=0$ have at most one integer root?
Experimental data for $D \in \{2,3\}$ and $n=x_0 (x_0^D+1)$ there is only one solution for $1 < ...
0
votes
0
answers
158
views
On factoring integers of the form $n=(x^D+1)(y^D+1)$ and $n=(x^D+a_{D-2}x^{D-2}+\cdots+ a_0) (y^D+b_{D-2}y^{D-2}+... b_0)$ with $x,y$ of the same size
From our preprint On factoring integers of the form $n=(x^D+1)(y^D+1)$ and $n=(x^D+a_{D-2}x^{D-2}+\cdots+ a_0) (y^D+b_{D-2}y^{D-2}+ \cdots+b_0)$ with $x,y$ of the same size.
We got plausible ...
1
vote
0
answers
118
views
Heuristics for spectral norm of directed adjacency matrix connected to prime numbers?
Are there any heuristics to compute the spectral norm of the adjacency matrix of this directed graph connected to prime numbers?
Let $p$ be a prime and $n$ be a natural number.
Define inductively for ...
3
votes
0
answers
111
views
Link between Schur polynomials and generators of the Virasoro algebra
I am currently studying Schur polynomials in the context of a representation of the Virasoro algebra for bosons (with central charge $c=1$). The generators of the algebra are denoted $L_k^{(n)}$, in ...
2
votes
0
answers
98
views
Regularity of a variant of elementary symmetric polynomials
Let $Y_1, Y_2,\dots, Y_n$ be $n$ bases of linear forms in the polynomial ring $k[x_1,\dots, x_n]$, where $k$ is a field or $\mathbb{Z}$. Examples of bases $Y_i$'s are $A_i\cdot[x_1,\dots, x_n]^T$, ...
7
votes
0
answers
618
views
Linear independence of composition of polynomials
Let $k, d \in \mathbb{Z}_{\geq 1}$ be positive integers.
I want to prove the following.There exists a large enough $r \in \mathbb{Z}_{\geq 1}$ (depending on $k$ and $d$) and a Zariski open set $U \...
3
votes
1
answer
160
views
Equivalence of continuous and discrete $L^{1/2}$ "norms"
Recall the iterated Trapezoidal rule of quadrature:
$$
\int_0^1 f(x) \, dx \approx I_n f := {1 \over 2n} \left(f(0) + f(1) + \sum_{k=1}^{n-1} 2f(k/n) \right).
$$
Recall also the $L^{1/2}$ "norm&...
5
votes
0
answers
184
views
Can we construct a polynomial $T$ such that $g(\alpha)$ is a root of $T$, for all $\alpha \in Z(f)$, where $g, f$ are two monic polynomial?
Let there be two monic polynomials $f(x), g(x) \in \mathbb{Z}/(p^k \mathbb{Z})[x]$, where $p$ is an odd prime number and $k \geq 2$. Can we construct a polynomial $T$ such that $g(\alpha)$ is a root ...
3
votes
1
answer
313
views
Converse of the product property for palindromic polynomials
Assume that $p(x)$ is a polynomial in $\mathbb{Z}_{>0}[x]$ with a factorization
$$
p(x) = p_1(x)\cdots p_m(x),
$$
where each $p_i(x)\in \mathbb{Z}_{>0}[x]$, not necessarily irreducible.
We say ...
3
votes
1
answer
395
views
Generalizing Marden's theorem to quartics
Is there a nice generalization of Marden's theorem which applies to all quartics?
Marden's theorem is a strengthening of the Gauss-Lucas theorem for polynomials over the complex numbers which applies ...
1
vote
0
answers
140
views
Solving equations on a high dimensional torus
I want to establish some useful criteria for uniqueness of solutions to the following:
$$Mx=b,\\ \text{subject to}\ ||x(2k-1:2k)||=1, k=1,2,\cdots,5,$$ where $M\in\mathbb{R}^{10\times10},\ x\in\mathbb{...
0
votes
0
answers
238
views
Coercive polynomials of small order of coercivity
I am following the definition and notation in this paper: How fast do coercive polynomials grow?
In particular, we say that a polynomial $f \in \mathbb{R}[x_1, \cdots, x_n]$ is $q$-coercive if for all ...
3
votes
1
answer
335
views
On the polynomial $x^{n-1}+\frac{x^{n-2}}2+\cdots+\frac1n$
Motivated by Question 498655, here we introduce the polynomials
$$S_n(x):=\sum_{k=1}^n \frac{x^{n-k}}k=x^{n-1}+\frac{x^{n-2}}2+\cdots+\frac1n\ \ \ (n=1,2,3,\ldots),\tag{1}$$
which are related to the ...
0
votes
0
answers
138
views
Integer solutions of bivariate polynomial equations
Given a polynomial $f(x,n)$ with integer coefficients, I want to find all pairs of rational number $x$ and positive integer $n$ such that $f(x,n)=0$. The polynomials I'm looking at are like the ...
0
votes
0
answers
139
views
Is this ideal of a polynomial ring over a field a contracted ideal?
Let $k$ be a field and $R:= k[y_1, \dotsc , y_d]$ be a polynomial ring in $d$ variables over $k$. Set $K:= QF(R)$. Given finitely many elements $a_1, \dotsc , a_n$ algebraic over $K$, we consider the ...
1
vote
2
answers
307
views
Expansion identity for the Eulerian polynomials of the second order
Background
$\newcommand{\polylog}{\mathrm{PolyLog}}$
The Eulerian polynomials $A_{m}(\cdot)$ are defined by the exponential generating function:
\begin{equation}
\frac{1-x}{1-x \exp[ t(1-x) ] } = \...
2
votes
2
answers
244
views
$\left\{\frac{x(ax+b)}2+\frac{y(ay-b)}2:\ x,y=0,1,2,\ldots\right\}$ and asymptotic bases of order 2
A subset $A$ of $\mathbb N=\{0,1,2,\ldots\}$ is called an asymptotic base of order $h$ if any sufficiently large $n\in\mathbb N$ belongs to the set
$$hA=\{a_1+\ldots+a_h:\ a_1,\ldots,a_h\in A\}.$$
...
0
votes
0
answers
190
views
Practical partial fraction decomposition
I have tried to implement Ramanujan's algorithm for Solvability of a system of polynomial equations but got stuck in the final step of calculating the partial fraction decomposition from which the ...
0
votes
1
answer
106
views
Closed forms or special function representations for certain binomial sums involving harmonic-like terms?
I’m studying the following family of polynomials defined for integers $n \geq 1$:
\begin{aligned}
A_n(x) &= \frac{x^n}{(n-1)!} \left[
\sum_{k=0}^{\left\lfloor \frac{n-1}{2} \right\rfloor} \binom{n-...
0
votes
0
answers
106
views
How to find the minimal non-exact element for a polynomial curve
I have a question that I hope has a clear answer. I will begin by introducing some definitions and an example to help readers follow, assuming some background knowledge based on the tags I'm using.
In ...
3
votes
0
answers
113
views
Duality for "sum of squares" tensors
Let $T$ be a symmetric tensor in $\left( \mathbb{R}^d \right)^{\otimes n}$ such that the polynomial $$\sum_{i_1,i_2, \ldots i_n}T_{i_1i_2 \ldots i_n} x_{i_1}^2 x_{i_2}^2 \ldots x_{i_n}^2$$ is a sum ...
2
votes
0
answers
145
views
Properties of OEIS sequence A061446 (primitive parts of Fibonacci numbers)
The first terms of A061446 are $(p(n))_{n\geq 1} =(1,1,2,3,5,4,13,7,17,11,89,6,233,29,\dots)$.
I know that $p(n)=\phi(n,5)$ for $n\geq 2$, where $\phi(n,x)$ denotes the Minimal Polynomials of $(2sin(\...
6
votes
0
answers
253
views
Family of simplest cyclic septics
Daniel Shanks introduced the "simplest cubic fields" in a 1974 paper [1]. These have cyclic Galois group of order 3 and a straightforward parameterization:
$$f = x^3 - tx^2 - (t+3)x - 1$$
...
11
votes
2
answers
779
views
Real factors of $(x^n - 1)/(x-1)$
Let $n \geq 3$ be a positive integer. Consider the polynomial $f_n(x) = \frac{x^n - 1}{x - 1} = \sum_{j=0}^{n-1} x^j$.
Is it possible to factor $f_n(x)$ into two monic factors $g, h \in \mathbb{R}[x]$ ...
0
votes
0
answers
144
views
Probabilistic interpretation of roots of unity in $\mathbb{C}^2$
I have a question that concerns how often a special class of bivariate polynomials (which I will call mask polynomials) intersects the set of roots of unity in $\mathbb{C}^2$. Caveat: I consider ...
1
vote
0
answers
63
views
Algorithm for A111528 equivalent to algorithm for row polynomials of A111184
Let
$T(n,k)$ be A111528, i.e., integer coefficients such that $$ T(n,k) = \frac{k}{n} [x^k] \log \left( \sum \limits_{m=0}^{k} m! \binom{n+m-1}{m} x^m \right), \\ T(n,0) = 1, T(0,k) = k!. $$
$R(n,k)$ ...
-4
votes
1
answer
171
views
Prime Inheritance and Prime-Generating Subsequence Trees in Class Number 1 Quadratic Polynomials [closed]
This question is inspired by the classical behavior of Euler’s polynomial
$$
\mathbf{f(x) = x^2 - x + 41},
$$
which is well-known for producing prime values for integer inputs $x = 0$ to $39$, and is ...
6
votes
2
answers
404
views
Prime inheritance in class number 1 quadratic polynomials
This conjecture is based on computational exploration of quadratic polynomials associated with imaginary quadratic fields of class number one.
Let us define:
• For a polynomial $f(x) \in \mathbb{Z}[...