中文
相关论文

相关论文: Irreducible polynomials with prescribed sums of co…

200 篇论文

The Schinzel hypothesis claims (but it seems hopeless to prove) that any irreducible Q[x] polynomial without a constant factor assumes infinitely many prime values at integer places. On the other hand, it is easy to see that a reducible…

数论 · 数学 2007-05-23 Yong-Gao Chen , Gabor Kun , Gabor Pete , Imre Z. Ruzsa , Adam Timar

Using Katz's equidistribution framework, we show that for any squarefree polynomial $f \in \mathbb{F}_q[t]$ of degree $n \ge 2$, every residue class modulo $f$ can be represented as a product of two monic irreducible polynomials of degree…

数论 · 数学 2025-11-11 Likun Xie

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

交换代数 · 数学 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…

交换代数 · 数学 2019-02-20 Joachim von zur Gathen

In this article, we give two different sufficient conditions for the irreducibility of a polynomial of more than one variable, over the field of complex numbers, that can be written as a sum of two polynomials which depend on mutually…

交换代数 · 数学 2021-07-08 Vikramjeet Singh Chandel , Uma Dayal

Let $p$ be a prime number and let $S=\{x^p+c_1,\dots,x^p+c_r\}$ be a finite set of unicritical polynomials for some $c_1,\dots,c_r\in\mathbb{Z}$. Moreover, assume that $S$ contains at least one irreducible polynomial over $\mathbb{Q}$. Then…

数论 · 数学 2023-08-29 Wade Hindes , Reiyah Jacobs , Benjamin Keller , Albert Kim , Peter Ye , Aaron Zhou

The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…

历史与综述 · 数学 2016-12-21 Akash Jena , Binod Kumar Sahoo

Let $\mathcal{F}_n$ be the set of unitary polynomials of degree $n \ge 2$ that have their roots in $\mathbb{Z}^*$. We note $$ Q(x) := x^n+a_{1}x^{n-1}+\dots+a_{n}. $$ We show that any two fixed consecutive coefficients $(a_{j},a_{j+1})$ ($j…

数论 · 数学 2019-11-04 Patrick Letendre

In this paper, we provide the degree distribution of irreducible factors of the composed polynomial $f(L(x))$ over $\mathbb F_q$, where $f(x)\in \mathbb F_q[x]$ is irreducible and $L(x)\in \mathbb F_q[x]$ is a linearized polynomial. We…

数论 · 数学 2018-09-07 Lucas Reis

Given a power $q$ of a prime number $p$ and "nice" polynomials $f_1,...,f_r\in\bbF_q[T,X]$ with $r=1$ if $p=2$, we establish an asymptotic formula for the number of pairs $(a_1,a_2)\in\bbF_q^2$ such that…

数论 · 数学 2012-03-06 Lior Bary-Soroker , Moshe Jarden

Assume that the Riemann hypothesis holds for Dedekind zeta functions. Under this assumption, we prove that a degree $d$ polynomial with random multiplicative $\pm1$ coefficients is irreducible in $\mathbb{Z}[x]$ with probability…

数论 · 数学 2025-11-07 Péter P. Varjú , Max Wenqiang Xu

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

数论 · 数学 2018-10-30 Clemens Fuchs , Christina Karolus

We show that $0,1$-polynomials of high degree and few terms are irreducible with high probability. Formally, let $k\in\mathbb{N}$ and $F(x)=1+\sum_{i=1}^kx^{n_i}$, where $ 0<n_1<\cdots<n_k\leq N. $ Then we show that…

数论 · 数学 2024-10-15 Alexandros Kalogirou

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

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

数论 · 数学 2024-01-17 Jitender Singh , Rishu Garg

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

For a class of polynomials $f \in \mathbb{Z}[X]$, which in particular includes all quadratic polynomials, and also trinomials of some special form, we show that, under some natural conditions (necessary for quadratic polynomials), the set…

数论 · 数学 2020-09-25 László Mérai , Alina Ostafe , Igor E. Shparlinski

We study two polynomial counting questions in arithmetic statistics via a combination of Fourier analytic and arithmetic methods. First, we obtain new quantitative forms of Hilbert's Irreducibility Theorem for degree $n$ polynomials $f$…

Let R and S be two irreducible root systems spanning the same vector space and having the same Weyl group W, such that S (but not necessarily R) is reduced. For each such pair (R,S) we construct a family of W-invariant orthogonal…

量子代数 · 数学 2007-05-23 Ian G. Macdonald

We study degree preserving maps over the set of irreducible polynomials over a finite field. In particular, we show that every permutation of the set of irreducible polynomials of degree $k$ over $\mathbb{F}_q$ is induced by an action from…

数论 · 数学 2018-09-21 Lucas Reis , Qiang Wang