中文
相关论文

相关论文: Nearly irreducibility of polynomials and the Newto…

200 篇论文

We study the number of irreducible polynomials over $\mathbf{F}_{q}$ with some coefficients prescribed. Using the technique developed by Bourgain, we show that there is an irreducible polynomial of degree $n$ with $r$ coefficients…

数论 · 数学 2016-01-27 Junsoo Ha

Let $\mathbb{F}_q$ denote the finite field of $q$ elements and $\mathbb{F}_{q^n}$ the degree $n$ extension of $\mathbb{F}_q$. A normal basis of $\mathbb{F}_{q^n}$ over $\mathbb{F} _q$ is a basis of the form…

数论 · 数学 2018-07-27 Hua Huang , Shanmeng Han , Wei Cao

The free singularity locus of a noncommutative polynomial f is defined to be the sequence $Z_n(f)=\{X\in M_n^g : \det f(X)=0\}$ of hypersurfaces. The main theorem of this article shows that f is irreducible if and only if $Z_n(f)$ is…

环与代数 · 数学 2018-06-11 J. William Helton , Igor Klep , Jurij Volčič

This paper deals with properties of the algebraic variety defined as the set of zeros of a "typical" sequence of polynomials. We consider various types of "nice" varieties: set-theoretic and ideal-theoretic complete intersections,…

数论 · 数学 2015-12-18 Joachim von zur Gathen , Guillermo Matera

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)$…

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…

数论 · 数学 2014-07-02 Ryul Kim , Ok-Hyon Song , Hyon-Chol Ri

The goal of this paper is to prove that a random polynomial with i.i.d. random coefficients taking values uniformly in $\{1,\ldots, 210\}$ is irreducible with probability tending to $1$ as the degree tends to infinity. Moreover, we prove…

数论 · 数学 2020-03-18 Lior Bary-Soroker , Gady Kozma

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

Many interesting questions in arithmetic dynamics revolve, in one way or another, around the (local and/or global) reducibility behavior of iterates of a polynomial. We show that for very general families of integer polynomials $f$ (and,…

数论 · 数学 2025-10-16 Joachim König

Let $n \neq 8$ be a positive integer such that $n+1 \neq 2^u$ for any integer $u\geq 2$. Let $\phi(x)$ belonging to $\mathbb{Z}[x]$ be a monic polynomial which is irreducible modulo all primes less than or equal to $n+1$. Let $a_j(x)$ with…

数论 · 数学 2023-06-07 Anuj Jakhar , Ravi Kalwaniya

We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…

代数几何 · 数学 2009-10-16 Arnaud Bodin

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

数论 · 数学 2019-08-15 Sam Porritt

For any polynomial mapping $F=(F_1,\dots ,F_n)$ of $\Cal C^n$ with a finite number of zeros we define the Noether exponent $\nu(F)$. We prove the Jacobi formula for all polynomials of degree strictly less than $\sum_{i=1}^n (\deg…

alg-geom · 数学 2016-08-14 Arkadiusz Płoski

Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…

数论 · 数学 2019-01-11 F. E. Brochero Martínez , Lucas Reis , Lays Silva

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

Say a trinomial $x^n+A x^m+B \in \Q[x]$ has reducibility type $(n_1,n_2,...,n_k)$ if there exists a factorization of the trinomial into irreducible polynomials in $\Q[x]$ of degrees $n_1$, $n_2$,...,$n_k$, ordered so that $n_1 \leq n_2 \leq…

数论 · 数学 2011-12-20 Andrew Bremner , Maciej Ulas

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

We consider a continuous family $(f_s)$, $s\in[0,1]$ of complex polynomials in two variables with isolated singularities, that are Newton non-degenerate. We suppose that the Euler characteristic of a generic fiber is constant (or…

代数几何 · 数学 2007-05-23 Arnaud Bodin

We generalize a semi-norm for the Alexander polynomial of a connected, compact, oriented 3-manifold on its first cohomology group to a semi-norm for an arbitrary Laurent polynomial f on the dual vector space to the space of exponents of f.…

代数拓扑 · 数学 2008-08-08 David G. Long

We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.

数论 · 数学 2015-08-13 Samuel H. Dalalyan