English
Related papers

Related papers: Arithmetic constraints of polynomial maps through …

200 papers

Let $D_n(x;a)$ and $E_n(x;a)\in\mathbb F_q[x]$ be Dickson polynomials of first and second kind respectively, where $\mathbb F_q$ is a finite field with $q$ elements. In this article we show explicitly the irreducible factors these…

Number Theory · Mathematics 2019-08-16 F. E. Brochero Martínez , Nelcy Esperanza Arévalo Baquero

In this paper are discussed the results of new numerical experiments on zero distribution of type I Hermite-Pad\'e polynomials of order $n=200$ for three different collections of three functions $[1,f_1,f_2]$. These results are obtained by…

Complex Variables · Mathematics 2015-06-29 Nikolay R. Ikonomov , Ralitza K. Kovacheva , Sergey P. Suetin

Let $\lambda =\left( \lambda_{1},\lambda_{2},...,\lambda_{r}\right) $ be an integer partition, and $\left[p_{\lambda }\right] $ the $q$-analog of the symmetric power function $%p_{\lambda }$. This $q$-analogue has been defined as a special…

Combinatorics · Mathematics 2024-09-16 Vincent Brugidou

Let f be an arbitrary positive integer valued function. The goal of this note is to show that one can construct a finitely generated group in which the discrete log problem is polynomially equivalent to computing the function f. In…

Group Theory · Mathematics 2025-11-27 Christopher Battarbee , Arman Darbinyan , Delaram Kahrobaei

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 $P_1,\dots,P_m\in\mathbb{Z}[y]$ be any linearly independent polynomials with zero constant term. We show that there exists a $\gamma>0$ such that any subset of $\mathbb{F}_q$ of size at least $q^{1-\gamma}$ contains a nontrivial…

Number Theory · Mathematics 2019-05-29 Sarah Peluse

For each odd prime power q, we construct an infinite sequence of rational functions f(X) in F_q(X), each of which is exceptional, which means that for infinitely many n the map c-->f(c) induces a bijection of P^1(F_{q^n}). Moreover, each of…

Number Theory · Mathematics 2022-06-08 Zhiguo Ding , Michael E. Zieve

Let $\mathbb{F}_{q}$ be a finite field with $q$ elements and $\mathbb{F}_{q}[x]$ the ring of polynomials over $\mathbb{F}_{q}$. Let $l(x), k(x)$ be coprime polynomials in $\mathbb{F}_{q}[x]$ and $\Phi(k)$ the Euler function in…

Combinatorics · Mathematics 2020-02-21 Zhang Zihan , Han Dongchun

Let $n$ and $k$ be positive integers, and $f_n(k)$ (resp. $g_n(k)$) be the number of unital subrings (resp. unital irreducible subrings) of $\mathbb{Z}^n$ of index $k$. The numbers $f_n(k)$ are coefficients of certain zeta functions of…

Number Theory · Mathematics 2022-12-01 Hrishabh Mishra , Anwesh Ray

The ring of q-character polynomials is a q-analog of the classical ring of character polynomials for the symmetric groups. This ring consists of certain class functions defined simultaneously on the groups $Gl_n(F_q)$ for all n, which we…

Combinatorics · Mathematics 2021-06-23 Adithya Balachandran , Nir Gadish , Andrew Huang , Siwen Sun

It is well known that a polynomial $\phi(X)\in \mathbb{Z}[X]$ of given degree $d$ factors into at most $d$ factors in $\mathbb{F}_p$ for any prime $p$. We prove in this paper the existence of infinitely many primes $q$ so that the given…

Number Theory · Mathematics 2023-05-22 Shubham Saha

Suppose L is any finite algebraic extension of either the ordinary rational numbers or the p-adic rational numbers. Also let g_1,...,g_k be polynomials in n variables, with coefficients in L, such that the total number of monomial terms…

Number Theory · Mathematics 2007-05-23 J. Maurice Rojas

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

We study functional graphs generated by quadratic polynomials over prime fields. We introduce efficient algorithms for methodical computations and provide the values of various direct and cumulative statistical parameters of interest. These…

Number Theory · Mathematics 2017-06-16 Bernard Mans , Min Sha , Igor E. Shparlinski , Daniel Sutantyo

Let $a_1$, $a_2$, and $a_3$ be distinct reduced residues modulo $q$ satisfying the congruences $a_1^2 \equiv a_2^2 \equiv a_3^2 \pmod q$. We conditionally derive an asymptotic formula, with an error term that has a power savings in $q$, for…

Number Theory · Mathematics 2023-06-22 Jiawei Lin , Greg Martin

Let $q = p^s$ be a power of a prime number $p$ and let $\mathbb{F}_q$ be the finite field with $q$ elements. In this paper we obtain the explicit factorization of the cyclotomic polynomial $\Phi_{2^nr}$ over $\mathbb{F}_q$ where both $r…

Number Theory · Mathematics 2011-09-23 Aleksandr Tuxanidy , Qiang Wang

Answering a question asked by Hsia and Tucker in their paper on the finiteness of greatest common divisors of iterates of polynomials, we prove that if $f, g \in \mathbb{C}(X)$ are compositionally independent rational functions and $c \in…

Dynamical Systems · Mathematics 2026-02-03 Chatchai Noytaptim , Xiao Zhong

Let $\mathbb{F}_q[t]$ be the ring of polynomials over $\mathbb{F}_q$, the finite field of $q$ elements, and let $p$ be the characteristic of $\mathbb{F}_q$. We denote $\widetilde{G}_q(k)$ to be the least integer $t_0$ with the property that…

Number Theory · Mathematics 2015-09-07 Shuntaro Yamagishi

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…

Number Theory · Mathematics 2024-10-15 Ofir Gorodetsky , Will Sawin

We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…

Number Theory · Mathematics 2023-05-04 Dor Elboim , Ofir Gorodetsky