English
Related papers

Related papers: Irreducible polynomials in F_q[x] versus 1 - qz in…

200 papers

Let $F(X)= \prod_{i=1}^k(a_iX+b_i)$ be a polynomial with $a_i, b_i$ being integers. Suppose the discriminant of $F$ is non-zero and $F$ is admissible. Given any natural number $N$, let $S(F,N)$ denotes those integers less than or equal to…

Number Theory · Mathematics 2014-04-01 Gyan Prakash

Let $F_q$ be a finite field of characteristic $p=2,3$. We give the number of irreducible polynomials $x^m+a_{m-1}x^{m-1}+...+a_0\in\F_q[x]$ with $a_{m-1}$ and $a_{m-3}$ prescribed for any given $m$ if $p=2$, and with $a_{m-1}$ and $a_1$…

Number Theory · Mathematics 2007-05-23 M. Moisio , K. Ranto

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

Commutative Algebra · Mathematics 2013-11-12 Joachim von zur Gathen , Alfredo Viola , Konstantin Ziegler

Let f in Z[x,y] be a reducible homoegeneous polynomial of degree 3. We show that f(x,y) has an even number of prime factors as often as an odd number of prime factors.

Number Theory · Mathematics 2007-05-23 H. A. Helfgott

In this paper, we classify, up to three possible exceptions, all monic, post-critically finite quadratic polynomials $f(x)\in \mathbb{Z}[x]$ with an iterate reducible module every prime, but all of whose iterates are irreducible over…

Number Theory · Mathematics 2019-07-09 Vefa Goksel

We study generalized Fibonacci sequences $F_{n+1}=PF_n-QF_{n-1}$ with initial values $F_0=0$ and $F_1=1$. Let $P,Q$ be nonzero integers such that $P^2-4Q$ is not a perfect square. We show that if $Q=\pm 1$ then the sequence…

Number Theory · Mathematics 2020-02-26 Mohammad Javaheri , Nikolai Krylov

We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property,…

Number Theory · Mathematics 2012-09-11 Rafe Jones

This note is motivated by an old result of Kronecker on monic polynomials with integer coefficients having all their roots in the unit disc. We call such polynomials Kronecker polynomials for short. Let $k(n)$ denote the number of Kronecker…

Number Theory · Mathematics 2015-07-10 Pantelis A. Damianou

Let $F_n$ be the $n$-th Fibonacci number. In this paper, we study the Diophantine equation $F_n+F_m=p^xq^y$ in nonnegative integers $n\ge m$, $x$ and $y$, where $p$ and $q$ are fixed distinct prime numbers. We determine all pairs of primes…

Number Theory · Mathematics 2026-02-23 Herbert Batte , Florian Luca , Volker Ziegler

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].

Number Theory · Mathematics 2020-08-03 Anuj Jakhar , Srinivas Koytada

In this paper we present and analyse a construction of irreducible polynomials over odd prime fields via the transforms which take any polynomial $f \in \mathbf{F}_p[x]$ of positive degree $n$ to $\left(\frac{x}{k} \right)^n \cdot…

Number Theory · Mathematics 2015-03-13 Simone Ugolini

An integer-valued multiplicative function $f$ is said to be polynomially-defined if there is a nonconstant separable polynomial $F(T)\in \mathbb{Z}[T]$ with $f(p)=F(p)$ for all primes $p$. We study the distribution in coprime residue…

Number Theory · Mathematics 2023-05-31 Paul Pollack , Akash Singha Roy

In this note, we apply the power-partible reduction to show the following arithmetic properties of large Schr\"oder polynomials $S_n(z)$ and little Schr\"oder polynomials $s_n(z)$: for any odd prime $p$, nonnegative integer…

Combinatorics · Mathematics 2023-10-11 Chen-Bo Jia , Rong-Hua Wang , Michael X. X. Zhong

Fix a positive prime power $q$, and let $\mathbb{F}_q[t]$ be the ring of polynomials over the finite field $\mathbb{F}_q$. Suppose $A \subseteq \{f \in \mathbb{F}_q[t]\colon\text{deg}~ f \le N\}$ contains no pair of elements whose…

Number Theory · Mathematics 2025-11-03 Steve Fan , Andrew Lott

We prove an isomorphism between the finite domain from 1 up to the product of the first n primes and the new defined set of prime modular numbers. This definition provides some insights about relative prime numbers. We provide an inverse…

Number Theory · Mathematics 2014-05-23 Matthias Schmitt

In this paper, we use the analytic method of Odlyzko and Richmond to study the log-concavity of power series. If $f(z) = \sum_n a_nz^n$ is an infinite series with $a_n \geq 1$ and $a_0 + \cdots + a_n = O(n + 1)$ for all $n$, we prove that a…

Combinatorics · Mathematics 2022-08-23 Shengtong Zhang

Using the cyclotomic identity we compute sums over d-tuples of monic polynomials in F_q[x] weighted by the multiplicity of their irreducible factors. As consequences we determine explicit expressions for the number of d-tuples of…

Number Theory · Mathematics 2025-09-03 Richard Ehrenborg

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…

Commutative Algebra · Mathematics 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

Let $x \geq 1$ be a large number, let $f(x) \in \mathbb{Z}[x]$ be a prime polynomial of degree $\text{deg}(f)=m$, and let $u\ne \pm 1, v^2$ be a fixed integer. Assuming the Bateman-Horn conjecture, an asymptotic counting function for the…

General Mathematics · Mathematics 2017-06-20 N. A. Carella

Given a finite field $\F_q$ and $n\in \N^*$, one could try to compute all polynomial endomorphisms $\F_q^n\lp \F_q^n$ up to a certain degree with a specific property. We consider the case $n=3$. If the degree is low (like 2,3, or 4) and the…

Algebraic Geometry · Mathematics 2011-03-18 Stefan Maubach , Roel Willems