中文
相关论文

相关论文: Dirichlet's Theorem for polynomial rings

200 篇论文

Schinzel's Hypothesis H is a general conjecture in number theory on prime values of polynomials that generalizes, e.g., the twin prime conjecture and Dirichlet's theorem on primes in arithmetic progression. We prove an arithmetic analog of…

数论 · 数学 2010-09-21 Lior Bary-Soroker

The Schinzel hypothesis is a famous conjectural statement about primes in value sets of polynomials, which generalizes the Dirichlet theorem about primes in an arithmetic progression. We consider the situation that the ring of integers is…

数论 · 数学 2019-02-22 Arnaud Bodin , Pierre Dèbes , Salah Najib

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

Using polynomial evaluation, we give some useful criteria to answer questions about divisibility of polynomials. This allows us to develop interesting results concerning the prime elements in the domain of coefficients. In particular, it is…

交换代数 · 数学 2008-06-10 Luis F. Caceres , Jose A. Velez-Marulanda

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

数论 · 数学 2017-07-24 Acquaah Peter

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

The Schinzel hypothesis essentially claims that finitely many irreducible polynomials in one variable over Z simultaneously assume infinitely many prime values unless there is an obvious reason why this is impossible. We prove that under a…

数论 · 数学 2016-03-29 Andreas O. Bender , Olivier Wittenberg

We consider the question of certifying that a polynomial in ${\mathbb Z}[x]$ or ${\mathbb Q}[x]$ is irreducible. Knowing that a polynomial is irreducible lets us recognise that a quotient ring is actually a field extension (equiv.~that a…

交换代数 · 数学 2020-05-12 John Abbott

We prove that arithmetic is interpretable in any indecomposable polynomial ring (in any set of variables), and in addition we provide an alternative uniform proof of undecidability for all members in this class of rings.

逻辑 · 数学 2023-09-28 Marco Barone , Nicolás Caro-Montoya , Eudes Naziazeno

In this paper we give a factorization theorem for the ring of exponential polynomials in many variables over an algebraically closed field of characteristic 0 with an exponentiation. This is a generalization of the factorization theorem due…

环与代数 · 数学 2012-06-29 P. D'Aquino , G. Terzo

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

历史与综述 · 数学 2022-02-03 Devendra Prasad

The classical Hilbert specialization property is a field-theoretic tool ensuring that polynomial irreducibility over a field is preserved under specialization of some of the variables. We develop an integral counterpart by introducing the…

数论 · 数学 2026-04-09 Angelot Behajaina , Pierre Dèbes , Joachim König

Let $f(x) = \sum\limits _{i=0}^{n} a_i x^i $ be a polynomial with coefficients from the ring $\mathbb{Z}$ of integers satisfying either $(i)$ $0 < a_0 \leq a_{1} \leq \cdots \leq a_{k-1} < a_{k} < a_{k+1} \leq \cdots \leq a_n$ for some $k$,…

交换代数 · 数学 2016-12-07 Anuj Jakhar , Neeraj Sangwan

In this paper we use Dirichlet's theorem in order to elementally prove two theorems. The first says that since a polynomial ax+b generates one prime, it also generates infinites. The second theorem (which is proved in a very simillar way to…

综合数学 · 数学 2014-05-23 Hilário Fernandes

Let $S \subset R$ be an arbitrary subset of a unique factorization domain $R$ and $\K$ be the field of fractions of $R$. The ring of integer-valued polynomials over $S$ is the set $\mathrm{Int}(S,R)= \{ f \in \mathbb{K}[x]: f(a) \in R\…

交换代数 · 数学 2021-05-14 Devendra Prasad

In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…

数论 · 数学 2019-08-23 Jitender Singh , Sanjeev Kumar

Let R be a recursive subring of a number field. We show that recursively enumerable sets are diophantine for the polynomial ring R[Z].

数论 · 数学 2008-09-11 Jeroen Demeyer

We prove the irreducibility of integer polynomials $f(X)$ whose roots lie inside an Apollonius circle associated to two points on the real axis with integer abscisae $a$ and $b$, with ratio of the distances to these points depending on the…

We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…

动力系统 · 数学 2014-09-29 Vitaly Bergelson , Donald Robertson

In this paper we give elementary conditions completely characterising when the theory of modules of a Pr\"ufer domain is decidable. Using these results, we show that the theory of modules of the ring of integer valued polynomials is…

逻辑 · 数学 2024-12-17 Lorna Gregory
‹ 上一页 1 2 3 10 下一页 ›