Skip to main content

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.

Filter by
Sorted by
Tagged with
3 votes
1 answer
249 views

During some digging of mine, I once found the following recursively defined family of polynomials: $P_0=P^2+2; P_{k+1}=P_k^2-2$. Using them one can show with purely algebraic means that the 2-adic ...
Euro Vidal Sampaio's user avatar
18 votes
2 answers
915 views

"Let $f(x)$ be a polynomial of degree at least 2 with $f(\mathbb{N})\subset \mathbb{N}$. Then the set of natural numbers $n$ such that $f(x)-n$ is reducible over $\mathbb{Q}$ has density 0." ...
Maddestofthemall's user avatar
6 votes
1 answer
230 views

Let $n,y$ be positive integers that are greater than 1. Suppose that $x^n=y$ does not have a solution in positive integers. Then is it true that for infinitely many primes $p$ there are no solutions $...
Maddestofthemall's user avatar
21 votes
1 answer
2k views

The interpolation already gives a polynomial $f(x)$ of degree at most $n$ that makes $(f(0),f(1),\dotsc, f(n))$ attain any real sequence in $\mathbb{R}^{n+1}$. I'm curious about the following: Is ...
zzy's user avatar
  • 353
5 votes
0 answers
144 views

In my work I commonly encounter large systems of polynomial equations for which it would be useful to know if there is a nontrivial solution over $\mathbb{F}_2$ (and if so, to find such a solution). ...
Pace Nielsen's user avatar
  • 19.4k
17 votes
0 answers
360 views

Recently I am studying the paper Leonid Vaserstein, Polynomial parametrization for the solutions of Diophantine equations and arithmetic groups, Annals of Mathematics 171 issue 2 (2010) pp. 979–1009, ...
Stanley Yao Xiao's user avatar
  • 30.7k
6 votes
0 answers
141 views

Let $(B_n(X))_{n \ge 0}$ denote the sequence of Bernoulli polynomials. For any couple of integers $(d,m) \in \mathbb{N}$, define the Hankel matrix $$ H_d(m) := \left( \frac{B_{i+j+1}(m)}{i+j+1} \right)...
Jean-Francois Coulombel's user avatar
1 vote
0 answers
141 views

Let $n$ be a positive integer with $6\mid n$, and let $$ \zeta := e^{2\pi i / n}. $$ For a given integer $m\in\{2,\dots,n-2\}$, consider subsets $$ A \subset \{0,1,\dots,n-1\} $$ of size $|A|=m$ ...
John_zyj's user avatar
6 votes
1 answer
367 views

Suppose $K$ is an algebraic number field, and $a \in K$. Let $n$ be a positive integer. The polynomial $t^n - a \in K[t]$ splits as a product of irreducible factors of degrees $d_1, \dots, d_r$. Is it ...
Ben Williams's user avatar
4 votes
0 answers
131 views

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(...
Zhi-Wei Sun's user avatar
  • 18.1k
0 votes
0 answers
50 views

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}...
Gafar Maulik's user avatar
1 vote
0 answers
182 views

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 ...
 Babar's user avatar
  • 703
2 votes
1 answer
317 views

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 ...
Stanley Yao Xiao's user avatar
  • 30.7k
3 votes
0 answers
160 views

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 ...
joro's user avatar
  • 25.8k
2 votes
1 answer
681 views

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 ...
Dattier's user avatar
  • 6,010
2 votes
0 answers
94 views

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^...
Zhi-Wei Sun's user avatar
  • 18.1k
2 votes
0 answers
85 views

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 ...
Stanley Yao Xiao's user avatar
  • 30.7k
1 vote
0 answers
53 views

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 ...
Jean's user avatar
  • 545
2 votes
0 answers
89 views

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$....
David Gao's user avatar
  • 5,085
2 votes
0 answers
183 views

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 ...
Learner's user avatar
  • 450
3 votes
1 answer
392 views

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}(\...
Abdelmalek Abdesselam's user avatar
1 vote
0 answers
52 views

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 ...
Rodrigo's user avatar
  • 11
0 votes
0 answers
37 views

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 ...
joro's user avatar
  • 25.8k
1 vote
0 answers
107 views

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 ...
Zhaopeng Ding's user avatar
2 votes
0 answers
110 views

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 ...
MathManiac5772's user avatar
4 votes
1 answer
262 views

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} \...
Pace Nielsen's user avatar
  • 19.4k
0 votes
0 answers
178 views

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,...
Zhi-Wei Sun's user avatar
  • 18.1k
0 votes
0 answers
62 views

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 ...
Math's user avatar
  • 9
7 votes
0 answers
280 views

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 ...
Pace Nielsen's user avatar
  • 19.4k
1 vote
0 answers
122 views

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 ...
Jan Nienhaus's user avatar
  • 1,276
5 votes
1 answer
210 views

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). ...
FDK's user avatar
  • 53
0 votes
1 answer
133 views

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 < ...
joro's user avatar
  • 25.8k
0 votes
0 answers
158 views

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 ...
joro's user avatar
  • 25.8k
1 vote
0 answers
119 views

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 ...
mathoverflowUser's user avatar
3 votes
0 answers
112 views

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 ...
Foxy's user avatar
  • 131
2 votes
0 answers
100 views

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$, ...
ÇŽG's user avatar
  • 21
7 votes
0 answers
626 views

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 \...
gm01's user avatar
  • 409
3 votes
1 answer
168 views

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&...
Sébastien Loisel's user avatar
5 votes
0 answers
184 views

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 ...
Afntu's user avatar
  • 311
3 votes
1 answer
318 views

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 ...
Chess's user avatar
  • 1,365
4 votes
1 answer
410 views

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 ...
JoshuaZ's user avatar
  • 8,540
1 vote
0 answers
141 views

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{...
Liu Hui's user avatar
  • 81
0 votes
0 answers
238 views

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 ...
Stanley Yao Xiao's user avatar
  • 30.7k
3 votes
1 answer
336 views

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 ...
Zhi-Wei Sun's user avatar
  • 18.1k
0 votes
0 answers
143 views

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 ...
Absol's user avatar
  • 176
0 votes
0 answers
139 views

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 ...
Arpan Dutta's user avatar
1 vote
2 answers
312 views

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) ] } = \...
Max Lonysa Muller's user avatar
2 votes
2 answers
245 views

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\}.$$ ...
Zhi-Wei Sun's user avatar
  • 18.1k
0 votes
0 answers
197 views

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 ...
Manfred Weis's user avatar
0 votes
1 answer
107 views

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-...
Abdelhay Benmoussa's user avatar

1
2 3 4 5
57