中文
相关论文

相关论文: An irreducibility criterion for polynomials over i…

200 篇论文

Let $m$ and $n$ be positive integers, and let $p$ be a prime. Let $T(x)=\Phi_{p^m}\left(\Phi_{2^n}(x)\right)$, where $\Phi_k(x)$ is the cyclotomic polynomial of index $k$. In this article, we prove that $T(x)$ is irreducible over $\mathbb…

数论 · 数学 2019-09-10 Joshua Harrington , Lenny Jones

An irreducible polynomial $f\in\Bbb F_q[X]$ of degree $n$ is {\em normal} over $\Bbb F_q$ if and only if its roots $r, r^q,\dots,r^{q^{n-1}}$ satisfy the condition $\Delta_n(r, r^q,\dots,r^{q^{n-1}})\ne 0$, where…

One of the interesting problems in arithmetic dynamics is to study the stability of polynomials over a field. In this paper, we study the stability of $f(z)=z^d+\frac{1}{c}$ for $d\geq 2$, $c\in{\mathbb{Z}\setminus\{0\}}$. We show that for…

数论 · 数学 2022-06-10 Shanta Laishram , Ritumoni Sarma , Himanshu Sharma

The $n^{th}$ cyclotomic polynomial $\Phi_n(x)$ is the minimal polynomial of an $n^{th}$ primitive root of unity. Its coefficients are the subject of intensive study and some formulas are known for them. Here we are interested in formulas…

数论 · 数学 2018-08-23 Andrés Herrera-Poyatos , Pieter Moree

In this paper we consider the even monic degree-8 cuboid polynomial $P_{a,u}(t)$ with coprime integers $a\neq u>0$. We prove irreducibility over $\mathbb{Z}$ by excluding all degree-8 splittings. First, any putative $4{+}4$ factorization is…

综合数学 · 数学 2025-10-14 Valery Asiryan

The problem of constructing a perfect cuboid is related to a certain class of univariate polynomials with three integer parameters $a$, $b$, and $u$. Their irreducibility over the ring of integers under certain restrictions for $a$, $b$,…

数论 · 数学 2012-04-18 Ruslan Sharipov

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 $R$ be a commutative ring with identity. An element $r \in R$ is said to be absolutely irreducible in $R$ if for all natural numbers $n>1$, $r^n$ has essentially only one factorization namely $r^n = r \cdots r$. If $r \in R$ is…

交换代数 · 数学 2020-06-30 Sarah Nakato

For a polynomial in several variables depending on some parameters, we discuss some results to the effect that for almost all values of the parameters the polynomial is irreducible. In particular we recast in this perspective some results…

代数几何 · 数学 2015-10-22 Arnaud Bodin , Pierre Dèbes , Salah Najib

Consider polynomials over ${\rm GF}(2)$. We describe efficient algorithms for finding trinomials with large irreducible (and possibly primitive) factors, and give examples of trinomials having a primitive factor of degree $r$ for all…

数论 · 数学 2021-05-18 Richard P. Brent , Paul Zimmermann

Let $f(x) = (x^{2}+1)^{n} - a x^{n} \in \mathbb{Z}[x]$ and assume $f(x)$ is irreducible. Let $\theta$ be a root of $f(x)$, set $K= \mathbb{Q}(\theta)$, and denote by $\mathbb{Z}_{K}$ the ring of integers of $K$. The index of $f$, denoted…

数论 · 数学 2026-02-18 Rupam Barman , Anuj Narode , Vinay Wagh

Let a(n,k) be the kth coefficient of the nth cyclotomic polynomial. The first two authors showed in part I that if m is a prime power and n and k range over the non-negative integers, then a(mn,k) assumes every integer value. Here this…

数论 · 数学 2012-07-30 Chun-Gang Ji , Wei-Ping Li , Pieter Moree

We construct many irreducible polynomials within semigroups generated by sets of the form $S=\{x^2+c_1,\dots,x^2+c_s\}$ under composition.

数论 · 数学 2022-08-09 Wade Hindes , Reiyah Jacobs , Peter Ye

Let $P(X)\in\mathbb{Z}[X]$ be an irreducible, monic, quartic polynomial with cyclic or dihedral Galois group. We prove that there exists a constant $c_P>0$ such that for a positive proportion of integers $n$, $P(n)$ has a prime factor $\ge…

数论 · 数学 2022-12-08 Cécile Dartyge , James Maynard

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

We determine necessary and sufficient conditions for unicritical polynomials to be dynamically irreducible over finite fields. This result extends the results of Boston-Jones and Hamblen-Jones-Madhu regarding the dynamical irreducibility of…

Let $c$ be a fixed integer such that $c \in \{0,2\}.$ Let $n$ be a positive integer such that either $n\geq 2$ or $2n+1 \neq 3^u$ for any integer $u\geq 2$ according as $c = 0$ or not. Let $\phi(x)$ belonging to $\mathbb{Z}[x]$ be a monic…

数论 · 数学 2023-06-06 Anuj Jakhar

We present the formula for the number of monic irreducible polynomials of degree $n$ over the finite field $\mathbb F_q$ where the coefficients of $x^{n-1}$ and $x$ vanish for $n\ge3$. In particular, we give a relation between rational…

数论 · 数学 2020-05-20 Yağmur Çakıroğlu , Oğuz Yayla , Emrah Sercan Yılmaz

Let $\mathbb{F}_q$ be a finite field with $q$ elements. M. Gerstenhaber and Irving Reiner has given two different methods to show the number of matrices with a given characteristic polynomial. In this talk, we will give another proof for…

交换代数 · 数学 2014-02-13 Tovohery Hajatiana Randrianarisoa

We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable $x$)…

数论 · 数学 2019-02-20 Alexei Entin