中文
相关论文

相关论文: On Schur's irreducibility results and generalised …

200 篇论文

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

Let $\mathcal A = \{A_{ij} \}_{i, j \in \mathcal I}$, where $\mathcal I$ is an index set, be a doubly indexed family of matrices, where $A_{ij}$ is $n_i \times n_j$. For each $i \in \mathcal I$, let $\mathcal V_i$ be an $n_i$-dimensional…

环与代数 · 数学 2018-12-03 Dana Lahat , Christian Jutten , Helene Shapiro

To study a Dirichlet polynomial $f(s)=\frac{a_{m}}{m^{s}}+\cdots +\frac{a_{n}}{n^{s}}$ by regarding it as a multivariate polynomial via the canonical map $\phi$ sending $p_i^{-s}$ to an indeterminate $X_i$, with $p_i$ the $i$th prime…

数论 · 数学 2025-11-10 Nicolae Ciprian Bonciocat

A key property of an algebraic variety is whether it is absolutely irreducible, meaning that it remains irreducible over the algebraic closure of its defining field, and determining absolute irreducibility is important in algebraic geometry…

代数几何 · 数学 2026-02-03 Carlos Agrinsoni , Heeralal Janwa , Moises Delgado

The multi-variable Schmidt polynomials are defined by $$ S_n^{(r)}(x_0,\ldots,x_n):=\sum_{k=0}^n {n+k \choose 2k}^{r}{2k\choose k} x_k. $$ We prove that, for any positive integers $m$, $n$, $r$, and $\varepsilon=\pm 1$, all the coefficients…

数论 · 数学 2014-12-19 Qi-Fei Chen , Victor J. W. Guo

For a fixed polynomial $\Delta$, we study the number of polynomials $f$ of degree $n$ over $\mathbb F_q$ such that $f$ and $f+\Delta$ are both irreducible, an $\mathbb F_q[T]$-analogue of the twin primes problem. In the large-$q$ limit, we…

数论 · 数学 2024-10-15 Ofir Gorodetsky , Will Sawin

We give upper bounds on the numbers of various classes of polynomials reducible over the integers and over integers modulo a prime and on the number of matrices in SL(n), GL(n) and Sp(2n) with reducible characteristic polynomials, and on…

数论 · 数学 2016-09-07 Igor Rivin

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

数论 · 数学 2026-05-19 Jitender Singh

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

数论 · 数学 2018-09-05 Fusun Akman

We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.

交换代数 · 数学 2018-01-18 Beata Hejmej

Let $R(x)=g(x)/h(x)$ be a rational expression of degree three over the finite field $\mathbb{F}_q$. We count the irreducible polynomials in $\mathbb{F}_q[x]$, of a given degree, which have the form $h(x)^{\mathrm{deg}\, f}\cdot…

数论 · 数学 2023-02-21 Sandro Mattarei , Marco Pizzato

It is known that random monic integral polynomials of bounded degree $d$ and integral coefficients distributed uniformly and independently in $[-H,H]$ are irreducible over $\mathbb{Z}$ with probability tending to $1$ as $H\to \infty$. In…

数论 · 数学 2021-07-21 Huy Tuan Pham , Max Wenqiang Xu

Let $n\ge 1$ be an integer and $e_n(x)$ denote the truncated exponential Taylor polynomial, i.e. $e_{n}(x)=\sum_{i=0}^n\frac{x^i}{i!}$. A well-known theorem of Schur states that the Galois group of $e_n(x)$ over $\Q$ is the alternating…

数论 · 数学 2020-11-13 Lingfeng Ao , Shaofang Hong

For $n \geq 3$ and $s \leq 92$, it is proved in \cite{ShSi} that, except for finitely many pairs $(n, s), G_1(x) = G_1(x, n, s) $ is either irreducible or linear factor times an irreducible polynomial. If $s \leq 30$, we determine here…

数论 · 数学 2021-10-19 T. N. Shorey , Sneh Bala Sinha

In this paper we investigate the factorization behaviour of the binomial polynomials $\binom{x}{n} = \frac{x(x-1)\cdots (x-n+1)}{n!}$ and their powers in the ring of integer-valued polynomials $\operatorname{Int}(\mathbb{Z})$. While it is…

交换代数 · 数学 2022-02-09 Roswitha Rissner , Daniel Windisch

We establish effective bounds on the number of periodic points of degree-$d$ polynomials $\phi$ defined over $p$-adic fields and number fields, under a mild reduction hypothesis that is satisfied by all unicritical polynomials $X^d + c$…

数论 · 数学 2025-10-31 Isaac Rajagopal , Robin Zhang

Let $f(x)$ be a monic polynomial in $\dZ[x]$ with no rational roots but with roots in $\dQ_p$ for all $p$, or equivalently, with roots mod $n$ for all $n$. It is known that $f(x)$ cannot be irreducible but can be a product of two or more…

数论 · 数学 2007-05-23 Jack Sonn

Let $S$ be a domain and $R=S[t;\sigma,\delta]$ a skew polynomial ring, where $\sigma$ is an injective endomorphism of $S$ and $\delta$ a left $\sigma$ -derivation. We give criteria for skew polynomials $f\in R$ of degree less or equal to…

环与代数 · 数学 2021-04-22 Christian Brown , Susanne Pumpluen

Assume that there is a set of monic polynomials $P_n(z)$ satisfying the second-order difference equation $$ A(s) P_n(z(s+1)) + B(s) P_n(z(s)) + C(s) P_n(z(s-1)) = \lambda_n P_n(z(s)), n=0,1,2,..., N$$ where $z(s), A(s), B(s), C(s)$ are some…

经典分析与常微分方程 · 数学 2007-12-04 Luc Vinet , Alexei Zhedanov

There has been interest during the last decade in properties of the sequence {gcd(a^n-1,b^n-1)}, n=1,2,3,..., where a,b are fixed (multiplicatively independent) elements in either the rational integers, the polynomials in one variable over…

数论 · 数学 2013-01-18 Joseph Cohen , Jack Sonn