中文
相关论文

相关论文: On the distribution of divisors of monic polynomia…

200 篇论文

We consider random polynomials with independent identically distributed coefficients with a fixed law. Assuming the Riemann hypothesis for Dedekind zeta functions, we prove that such polynomials are irreducible and their Galois groups…

数论 · 数学 2022-08-25 Emmanuel Breuillard , Péter P. Varjú

We consider a certain left action by the monoid $SL_2(\mathbf{N}_0)$ on the set of divisor pairs $\mathcal{D}_f := \{ (m, n) \in \mathbf{N}_0 \times \mathbf{N}_0 : m \lvert f(n) \}$ where $f \in \mathbf{Z}[x]$ is a polynomial with integer…

数论 · 数学 2024-05-07 Anton Shakov

Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…

离散数学 · 计算机科学 2021-04-10 Rachel N. Berman , Ron M. Roth

Let $F$ be a number field, $O_F$ the integral closure of $\mathbb{Z}$ in $F$ and $P(T) \in O_F[T]$ a monic separable polynomial such that $P(0) \not=0$ and $P(1) \not=0$. We give precise sufficient conditions on a given positive integer $k$…

数论 · 数学 2017-08-11 François Legrand

Let $f(x)\in \mathbb{F}_q[x]$ be an irreducible polynomial of degree $m$ and exponent $e$, and $n$ be a positive integer such that $\nu_p(q-1)\ge \nu_{p}(e)+\nu_p(n)$ for all $p$ prime divisor of $n$. We show a fast algorithm to determine…

数论 · 数学 2015-12-01 F. E. Brochero Martínez , Lucas Reis

In this article, we consider polynomials of the form $f(x)=a_0+a_{n_1}x^{n_1}+a_{n_2}x^{n_2}+\dots+a_{n_r}x^{n_r}\in \mathbb{Z}[x],$ where $|a_0|\ge |a_{n_1}|+\dots+|a_{n_r}|,$ $|a_0|$ is a prime power and $|a_0|\nmid |a_{n_1}a_{n_r}|$. We…

数论 · 数学 2020-04-02 Biswajit Koley , A. Satyanarayana Reddy

We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of…

数论 · 数学 2021-05-18 Simon Kuttner , Qiang Wang

Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…

数论 · 数学 2018-05-24 Domingo Gómez-Pérez , Alina Ostafe , Min Sha

We identify all non-splitting bi-unitary perfect polynomials over the field $\mathbb{F}_4$, which admit at most four irreducible divisors. There is an infinite number of such divisors.

数论 · 数学 2025-02-03 Olivier Rahavandrainy

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

数论 · 数学 2017-11-16 Jonathan Hickman , James Wright

Let $g_1, \dots , g_M$ be additive functions for which there exist nonconstant polynomials $G_1, \dots , G_M$ satisfying $g_i(p) = G_i(p)$ for all primes $p$ and all $i \in \{1, \dots , M\}$. Under fairly general and nearly optimal…

数论 · 数学 2024-01-03 Akash Singha Roy

Call a monic integer polynomial exceptional if it has a root modulo all but a finite number of primes, but does not have an integer root. We classify all irreducible monic integer polynomials $h$ for which there is an irreducible monic…

数论 · 数学 2023-08-28 Christian Elsholtz , Benjamin Klahn , Marc Technau

We investigate the moment and the distribution of $L(1,\x_P),$ where $\x_P$ varies over quadratic characters associated to irreducible polynomials $P$ of degree $2g+1$ over $\mathbb{F}_q[T]$ as $g\to\infty$. In the first part of the paper…

数论 · 数学 2020-10-29 Julio Andrade , Asmaa Shamesaldeen

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

Let $\S $ be an arbitrary subset of $R^n$ where $R$ is a domain with the field of fractions $\K$. Denote the ring of polynomials in $n$ variables over $\K$ by $\K[\x].$ The ring of integer-valued polynomials over $\S,$ denoted by…

交换代数 · 数学 2021-08-18 Devendra Prasad

Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…

计算复杂性 · 计算机科学 2017-02-03 Vishwas Bhargava , Gábor Ivanyos , Rajat Mittal , Nitin Saxena

We present a theory for splitting algebras of monic polynomials over rings, and apply the results to symmetric functions, and Galois theory. Our main result is that the ring of invariants of a splitting algebra under the symmetric group…

交换代数 · 数学 2007-05-23 Torsten Ekedahl , Dan Laksov

In this article, we consider the polynomials of the form $f(x)=a_0+a_1x+a_2x^2+\cdots+a_nx^n\in \mathbb{Z}[x],$ where $|a_0|=|a_1|+\dots+|a_n|$ and $|a_0|$ is a prime. We show that these polynomials have a cyclotomic factor whenever…

数论 · 数学 2020-06-09 Biswajit Koley , A. Satyanarayana Reddy

In this paper we investigate the following related problems: (A) the separation of $p$-adic roots of integer polynomials of a fixed degree and bounded height; and (B) counting integer polynomials of a fixed degree and bounded height with…

数论 · 数学 2025-04-08 Victor Beresnevich , Bethany Dixon

We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…