English
Related papers

Related papers: On the Bateman-Horm Conjecture about Polynomial Ri…

200 papers

Using an extension of the abundancy index to imaginary quadratic rings with unique factorization, we define what we call $n$-powerfully perfect numbers in these rings. This definition serves to extend the concept of perfect numbers that…

Number Theory · Mathematics 2014-12-12 Colin Defant

For an odd prime power $q$ satisfying $q\equiv 1\pmod 3$ we construct totally $2(q-1) $ permutation polyomials, all giving involutory permutations with exactly $ 1+ \frac{q-1}3$ fixed points. Among them $(q-1)$ polynomials are trinomials,…

Combinatorics · Mathematics 2023-06-30 P Vanchinathan , Kevinsam B

In this paper, we give error bounds on the number of monic irreducible polynomials $a_0+a_1x+\dots+a_{n-1}x^{n-1}+x^n$ over a finite field $\mathbb{F}_q$ of degree $n$ with $(a_0, a_1, \dots, a_{n-1}, 1)$ lying in a fixed affine algebraic…

Number Theory · Mathematics 2025-12-11 Neil Kolekar

Let $q$ be an odd prime power and $\mathbb{F}_q$ be the finite field of $q$ elements. We define the Rudin-Shapiro function $R$ on monic polynomials $f=t^n+f_{n-1}t^{n-1}+\dots + f_0\in\mathbb{F}_q[t]$ over $\mathbb{F}_q$ by $$…

Number Theory · Mathematics 2025-08-14 László Mérai

Let $R$ be a finite commutative ring with $1\ne 0$. The set $\mathcal{F}(R)$ of polynomial functions on $R$ is a finite commutative ring with pointwise operations. Its group of units $\mathcal{F}(R)^\times$ is just the set of all…

Commutative Algebra · Mathematics 2021-06-04 Amr Ali Al-Maktry

Given $F= \mathbb{F}_{p^{t}}$, a field with $p^t$ elements, where $p $ is a prime power, $t\geq 7$, $n$ are positive integers and $f=f_1/f_2$ is a rational function, where $f_1, f_2$ are relatively prime, irreducible polynomials with…

Number Theory · Mathematics 2023-01-09 Aakash Choudhary , R. K. Sharma

Let $f={\tt X}^r(a+{\tt X}^{2(q-1)})\in{\Bbb F}_{q^2}[{\tt X}]$, where $a\in{\Bbb F}_{q^2}^*$ and $r\ge 1$. The parameters $(q,r,a)$ for which $f$ is a permutation polynomial (PP) of ${\Bbb F}_{q^2}$ have been determined in the following…

Combinatorics · Mathematics 2016-09-14 Xiang-dong Hou

Let l>=1 be an arbitrary odd integer and p,q and r primes. We show that there exist infinitely many ternary cyclotomic polynomials \Phi_{pqr}(x) with l^2+3l+5<= p<q<r such that the set of coefficients of each of them consists of the p…

Number Theory · Mathematics 2020-08-27 Pieter Moree , Eugenia Rosu

In this paper we state some conjectures about q-Fibonacci polynomials which for q=1 reduce to well-known results about Fibonacci numbers and Fibonacci polynomials.

Combinatorics · Mathematics 2008-05-06 Johann Cigler

The polynomial coefficient $\binom {n,q}{k}$ is defined to be the coefficient of $x^{k}$ in the expansion of $(1+x+x^2+... +x^{q-1})^n$. In this note we give an asymptotic estimate for $\binom {n,q}{cn}$ as $n$ tends to infinity, where $c$…

Combinatorics · Mathematics 2014-12-04 Jiyou Li

Given any polynomial $p$ in $C[X]$, we show that the set of irreducible matrices satisfying $p(A)=0$ is finite. In the specific case $p(X)=X^2-nX$, we count the number of irreducible matrices in this set and analyze the arising sequences…

Combinatorics · Mathematics 2018-05-11 Erik Thörnblad , Jakob Zimmermann

Fix a prime $p >2$ and a finite field $\mathbb{F}_{q}$ with $q$ elements, where $q$ is a power of $p$. Let $m$ be a monic polynomial in the polynomial ring $\mathbb{F}_{q}[T]$ such that $deg(m)$ is large. Fix an integer $r\geq 2$, and let…

Number Theory · Mathematics 2021-10-15 Youssef Sedrati

Let $q$ be an odd prime power and let $\F_q$ be the finite field with $q$ elements. Let $\mathcal{P}(n)$ be the set of monic irreducible polynomials of degree $n$ over $\mathbb{F}_q$. For $f=t^n+f_{n-1}t^{n-1}+\cdots+f_0\in\mathcal{P}(n)$,…

Number Theory · Mathematics 2026-05-26 Kaimin Cheng

Let k, r > 1 be two integers. We prove an asymptotic formula for the number of k-free values of the r variables polynomial t_1...t_r - 1 over the integral points of [1, x]^r.

Number Theory · Mathematics 2012-04-03 Pierre Le Boudec

In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…

Number Theory · Mathematics 2015-11-03 Efrat Bank , Lior Bary-Soroker , Lior Rosenzweig

We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f \in \mathbb{Z}[x]$. We use an explicit version of Mertens' theorem for number fields to estimate a related…

Number Theory · Mathematics 2020-12-11 Stephan Ramon Garcia , Ethan Simpson Lee , Josh Suh , Jiahui Yu

Carlitz proved that, for any prime power q other than 2, the group of all permutations of the finite field F_q is generated by the permutations induced by degree-one polynomials and x^{q-2}. His proof relies on a remarkable polynomial which…

Number Theory · Mathematics 2016-03-04 Michael E. Zieve

In previous work we computed the number $C_n(q)$ of ideals of codimension $n$ of the algebra ${\mathbb{F}}_q[x,y,x^{-1}, y^{-1}]$ of two-variable Laurent polynomials over a finite field: it turned out that $C_n(q)$ is a palindromic…

Number Theory · Mathematics 2025-09-11 Christian Kassel , Christophe Reutenauer

Let $F$ be a field of $q$ elements, where $q$ is a power of an odd prime. Fix $n = (q+1)/2$. For each $s \in F$, we describe all the irreducible factors over $F$ of the polynomial $g_s(y): = y^n + (1-y)^n -s$, and we give a necessary and…

Number Theory · Mathematics 2018-02-07 Ron Evans , Mark Van Veen

The goal of this paper is to study Goldbach's conjecture for rings of regular functions of affine algebraic varieties over a field. Among our main results, we define the notion of Goldbach condition for Newton polytopes, and we prove in a…

Number Theory · Mathematics 2023-12-29 Alberto F. Boix , Danny A. J. Gómez-Ramírez