中文
相关论文

相关论文: The irreducibility of some Wronskian Hermite polyn…

200 篇论文

In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an…

数论 · 数学 2020-08-26 Gohar M. Kyureghyan , Melsik K. Kyureghyan

We study the representations of a class of non-commutative polynomial algebras truncated at degree 3, with one additional relation. We determine the irreducible components of their varieties of representations. We do this by showing that…

表示论 · 数学 2024-10-28 Marko Čmrlec

We study integer coefficient polynomials of fixed degree and maximum height $H$, that are irreducible by Dumas's criterion. We call such polynomials Dumas polynomials. We derive upper bounds on the number of Dumas polynomials, as $H$…

数论 · 数学 2017-07-12 Randell Heyman

We demonstrate counterexamples to Wilmshurst's conjecture on the valence of harmonic polynomials in the plane, and we conjecture a bound that is linear in the analytic degree for each fixed anti-analytic degree. Then we initiate a…

复变函数 · 数学 2013-08-30 Seung-Yeop Lee , Antonio Lerario , Erik Lundberg

We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the…

数论 · 数学 2025-03-04 Nicolae Ciprian Bonciocat , Rishu Garg , Jitender Singh

Jakhar shown that for $f(x)=a_nx^n + a_{n-1}x^{n-1}+\cdot+ a_0$ ($a_0\neq 0$) is a polynomial with rational coefficients, if there exists a prime integer $p$ satisfying $\nu_p(a_n)=0$ and $n\nu_p(a_i)\ge (n-i)\nu_p(a_0)> 0$ for every $0\le…

数论 · 数学 2020-07-16 Lhoussain El Fadil

We present a more general proof that cyclotomic polynomials are irreducible over Q and other number fields that meet certain conditions. The proof provides a new perspective that ties together well-known results, as well as some new…

交换代数 · 数学 2022-05-11 Nicholas Phat Nguyen

In a recent paper \cite{Jan}, Jankauskas proved some interesting results concerning the reducibility of quadrinomials of the form $f(4,x)$, where $f(a,x)=x^{n}+x^{m}+x^{k}+a$. He also obtained some examples of reducible quadrinomials…

数论 · 数学 2013-10-22 Andrew Bremner , Maciej Ulas

Let $x$ denote a sufficiently large integer. We show that the recent result of Grimmelt and Merikoski actually yields the largest prime factor of $n^2 +1$ is greater than $x^{1.317}$ infinitely often. As an application, we give a new upper…

数论 · 数学 2025-06-03 Runbo Li

We consider the problem of writing real polynomials as determinants of symmetric linear matrix polynomials. This problem of algebraic geometry, whose roots go back to the nineteenth century, has recently received new attention from the…

代数几何 · 数学 2011-08-23 Tim Netzer , Daniel Plaumann , Andreas Thom

We study the number of irreducible factors (over $\mathbb{Q}$) of the $n$th iterate of a polynomial of the form $f_r(x) = x^2 + r$ for rational $r$. When the number of such factors is bounded independent of $n$, we call $f_r(x)$…

Let $m\geq 1$ and $a_m$ be integers. Let $\alpha$ be a rational number which is not a negative integer such that $\alpha = \frac{u}{v}$ with $\gcd(u,v) = 1, v>0$. Let $\phi(x)$ belonging to $\Z[x]$ be a monic polynomial which is irreducible…

数论 · 数学 2023-06-13 Anuj Jakhar , Srinivas Kotyada , Arunabha Mukhopadhyay

The Schinzel Hypothesis is a conjecture about irreducible polynomials in one variable over the integers: under some standard condition, they should assume infinitely many prime values at integers. We consider a relative version: if the…

数论 · 数学 2020-02-13 Arnaud Bodin , Pierre Dèbes , Salah Najib

Given a field $K$ and $n > 1$, we say that a polynomial $f \in K[x]$ has newly reducible $n$th iterate over $K$ if $f^{n-1}$ is irreducible over $K$, but $f^n$ is not (here $f^i$ denotes the $i$th iterate of $f$). We pose the problem of…

数论 · 数学 2021-11-24 Peter Illig , Rafe Jones , Eli Orvis , Yukihiko Segawa , Nick Spinale

We prove an upper bound for the number of rational points of bounded height on irreducible affine hypersurfaces. More precisely, given an irreducible polynomial $f \in \mathbb{Z}[X_1, \dots, X_n]$, we prove an upper bound on the number of…

数论 · 数学 2025-12-04 Anders Mah

We consider a certain left action by the monoid $SL_2(\mathbf{N}_0)$ on the set of divisor pairs $\mathcal{D}_f := \{ (m, n) \in \mathbf{N}_0 \times \mathbf{N}_0 : m \lvert f(n) \}$ where $f \in \mathbf{Z}[x]$ is a polynomial with integer…

数论 · 数学 2024-05-07 Anton Shakov

The problem of writing real zero polynomials as determinants of linear matrix polynomials has recently attracted a lot of attention. Helton and Vinnikov have proved that any real zero polynomial in two variables has a determinantal…

最优化与控制 · 数学 2011-04-08 Tim Netzer , Andreas Thom

Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…

环与代数 · 数学 2009-12-08 Marla Slusky

We prove an irreducibility criterion for polynomials with power series coefficients generalizing previous known results concerning quasi-ordinary polynomials.

复变函数 · 数学 2016-05-19 Guillaume Rond , Bernd Schober

Jedrzejewicz showed that a polynomial map over a field of characteristic zero is invertible, if and only if the corresponding endomorphism maps irreducible polynomials to irreducible polynomials. Furthermore, he showed that a polynomial map…

代数几何 · 数学 2016-03-24 Michiel de Bondt , Dan Yan