中文
相关论文

相关论文: Irreducible polynomials in F_q[x] versus 1 - qz in…

200 篇论文

We study a random polynomial of degree $n$ over the finite field $\mathbb{F}_q$, where the coefficients are independent and identically distributed and uniformly chosen from the squares in $\mathbb{F}_q$. Our main result demonstrates that…

数论 · 数学 2024-10-23 Lior Bary-Soroker , Roy Shmueli

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

Let $n$ be an even positive integer with at most three distinct prime factors and let $\ze_n$ be a primitive $n$-th root of unity. In this study, we made an attempt to find the lowest-degree $0,1$-polynomial $f(x) \in \Q[x]$ having at least…

数论 · 数学 2011-11-16 A. Satyanarayana Reddy

In a recent paper, Bary-Soroker, Koukoulopoulos and Kozma proved that when $A$ is a random monic polynomial of $\mathbb{Z}[X]$ of deterministic degree $n$ with coefficients $a_j$ drawn independently according to measures $\mu_j,$ then $A$…

数论 · 数学 2025-07-16 Pierre-Alexandre Bazin

Any power series with unit constant term can be factored into an infinite product of the form $\prod_{n\geq 1} (1-q^n)^{-a_n}$. We give direct formulas for the exponents $a_n$ in terms of the coefficients of the power series, and vice…

组合数学 · 数学 2025-08-19 Robert Schneider , Andrew V. Sills , Hunter Waldron

The $q$-binomial coefficients $\qbinom{n}{m}=\prod_{i=1}^m(1-q^{n-m+i})/(1-q^i)$, for integers $0\le m\le n$, are known to be polynomials with non-negative integer coefficients. This readily follows from the $q$-binomial theorem, or the…

数论 · 数学 2011-03-01 S. Ole Warnaar , Wadim Zudilin

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

数论 · 数学 2025-12-24 Rishu Garg , Jitender Singh

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

Let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a power of a prime. We discuss recursive methods for constructing irreducible polynomials over $\mathbb F_q$ of high degree using rational transformations. In particular,…

数论 · 数学 2019-05-21 Daniel Panario , Lucas Reis , Qiang Wang

Let $Q_n(z)$ be the polynomials associated with the Nekrasov-Okounkov formula $$\sum_{n\geq 1} Q_n(z) q^n := \prod_{m = 1}^\infty (1 - q^m)^{-z - 1}.$$ In this paper we partially answer a conjecture of Heim and Neuhauser, which asks if…

组合数学 · 数学 2021-04-07 Letong Hong , Shengtong Zhang

Let $\Bbb F_q$ be a finite field with $q$ elements and $n$ a positive integer. Mart\'inez, Vergara and Oliveira \cite{MVO} explicitly factorized $x^{n} - 1$ over $\Bbb F_q$ under the condition of $rad(n)|(q-1)$. In this paper, suppose that…

信息论 · 计算机科学 2017-10-24 Yansheng Wu , Qin Yue , Shuqin Fan

Building upon the work of A. Booker and C. Pomerance (2017), we prove that for a prime power $q \geq 7$, every residue class modulo an irreducible polynomial $F \in \mathbb{F}_q[X]$ has a non-constant, square-free representative which has…

数论 · 数学 2022-01-28 Christian Bagshaw

Given a field $K$ and $n > 1$, we say that a polynomial $f \in K[x]$ has newly reducible $n$th iterate over $K$ if $f^{n-1}$ is irreducible over $K$, but $f^n$ is not (here $f^i$ denotes the $i$th iterate of $f$). We pose the problem of…

数论 · 数学 2021-11-24 Peter Illig , Rafe Jones , Eli Orvis , Yukihiko Segawa , Nick Spinale

Let $\mathbb F_q$ be a finite field and $n$ a positive integer. In this article, we prove that, under some conditions on $q$ and $n$, the polynomial $x^n-1$ can be split into irreducible binomials $x^t-a$ and an explicit factorization into…

信息论 · 计算机科学 2014-05-20 F. E. Brochero Martínez , C. R. Giraldo Vergara , L. Batista de Oliveira

For a prime power $q$, we show that the discriminants of monic polynomials in $\mathbb{F}_q[x]$ of a fixed degree $m$ are equally distributed if $\gcd(q-1,m(m-1))=2$ when $q$ is odd and $\gcd(q-1,m(m-1))=1$ if $q$ is even. A theorem in the…

数论 · 数学 2018-12-18 Jonathan Chan , Soonho Kwon , Michael Seaman

Let $f_1,\dots,f_k \in \mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an $n<x$ such that $\|f_i(n)\|\ll x^{-1/10.5kd(d-1)+o(1)}$ for all $1\le i\le k$. This improves on an earlier…

数论 · 数学 2024-07-03 Cheuk Fung Lau

For a fixed polynomial $\Delta$, we study the number of polynomials $f$ of degree $n$ over $\mathbb F_q$ such that $f$ and $f+\Delta$ are both irreducible, an $\mathbb F_q[T]$-analogue of the twin primes problem. In the large-$q$ limit, we…

数论 · 数学 2024-10-15 Ofir Gorodetsky , Will Sawin

Let $f(x)$ be a monic polynomial in $\dZ[x]$ with no rational roots but with roots in $\dQ_p$ for all $p$, or equivalently, with roots mod $n$ for all $n$. It is known that $f(x)$ cannot be irreducible but can be a product of two or more…

数论 · 数学 2007-05-23 Jack Sonn

Let $\mathbb F_q$ be the finite field with $q$ elements, $f, g\in \mathbb F_q[x]$ be polynomials of degree at least one. This paper deals with the asymptotic growth of certain arithmetic functions associated to the factorization of the…

数论 · 数学 2019-08-06 Lucas Reis

Let $f=a_0+ a_{1}x+\cdots+a_m x^m\in \Bbb{Z}[x]$ be a primitive polynomial. Suppose that there exists a positive real number $\alpha$ such that $|a_m| \alpha^m>|a_0|+|a_1|\alpha+\cdots+|a_{m-1}|\alpha^{m-1}$. We prove that if there exist…

数论 · 数学 2023-01-03 Jitender Singh , Sanjeev Kumar