English
Related papers

Related papers: A Class of Permutation Binomials over Finite Field…

200 papers

Let $q$ be a power of a prime, let $\mathbb{F}_q$ be the finite field with $q$ elements and let $n \geq 2$. For a polynomial $h(x) \in \mathbb{F}_q[x]$ of degree $n \in \mathbb{N}$ and a subset $W \subseteq [0,n] := \{0, 1, \ldots, n\}$, we…

Number Theory · Mathematics 2016-05-03 Aleksandr Tuxanidy , Qiang Wang

Let $q$ be a prime power. We estimate the number of tuples of degree bounded monic polynomials $(Q_1,\ldots,Q_v) \in (\mathbb{F}_q[z])^v$ that satisfy given pairwise coprimality conditions. We show how this generalises from monic…

Number Theory · Mathematics 2017-07-12 Juan Arias de Reyna , Randell Heyman

Let $q=2^m.$ In a recent paper \cite{Zhang3}, Zhang and Zheng investigated several classes of permutation pentanomials of the form $\epsilon_0x^{d_0}+L(\epsilon_{1}x^{d_1}+\epsilon_{2}x^{d_2})$ over ${\mathbb F}_{q^3}~(d_0=1,2,4)$ from some…

Number Theory · Mathematics 2025-01-28 Tongliang Zhang , Lijing Zheng , Hengtai Wang , Jie Peng , Yanjun Li

Let $k \geq 2$, $q$ be an odd prime power, and $F \in \mathbb{F}_q[x_1, \ldots, x_k]$ be a polynomial. An $F$-Diophantine set over a finite field $\mathbb{F}_q$ is a set $A \subset \mathbb{F}_q^*$ such that $F(a_1, a_2, \ldots, a_k)$ is a…

Number Theory · Mathematics 2025-05-09 Chi Hoi Yip , Semin Yoo

Let $\mathbb{F}_q$ be the field with $q$ elements and of characteristic $p$. For $a\in\mathbb{F}_p$ consider the set \begin{equation*} S_a(n)=\{f\in\mathbb{F}_q[x]\mid\operatorname{deg}(f)=n,~f\text{ irreducible, monic and}…

Number Theory · Mathematics 2023-12-29 Max Schulz

A polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N$ is called \emph{monogenic} if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where…

Number Theory · Mathematics 2022-04-19 Joshua Harrington , Lenny Jones

In this paper, we present three classes of complete permutation monomials over finite fields of odd characteristic. Meanwhile, the compositional inverses of these complete permutation polynomials are also proposed.

Number Theory · Mathematics 2013-12-04 Guangkui Xu , Xiwang Cao , Ziran Tu , Xiangyong Zeng , Lei Hu

Using arbitrary bases for the finite field $\mathbb{F}_{q^n}$ over $\mathbb{F}_{q}$, we obtain the generalized M\"obius transformations (GMTs), which are a class of bijections between the projective geometry $PG(n-1,q)$ and the set of roots…

Combinatorics · Mathematics 2025-06-02 Tong Lin , Qiang Wang

Let $\ell$ be an odd prime, $q$ an odd prime power such that $q \not\equiv 0 \pmod \ell$, and $m$ the order of $q$ in $\F_\ell^\times$. We propose an explicit $L$-polynomial of hyperelliptic function field $K:=\F_q(T,…

Number Theory · Mathematics 2025-12-10 Peter Jaehyun Cho , Jinjoo Yoo

We propose graph theoretic equivalents for existence of a finite projective plane. We then develop a new approach and see that the problem of existence of a finite projective plane of order n is linked up with a subset of sharply 2…

General Mathematics · Mathematics 2015-08-04 Dhananjay P. Mehendale

We demonstrate, using character sum arguments, the existence of primitive polynomials of degree n over a finite field GF(q) with the coefficients for x^(n-1), x^(n-2), and x^(n-3) prescribed, so long as char(GF(q)) is at least 5 and n is at…

Number Theory · Mathematics 2007-05-23 Donald Mills

Let $F$ be any field containing the finite field of order $q$. A $q$-polynomial $L$ over $F$ is an element of the polynomial ring $F[x]$ with the property that all powers of $x$ that appear in $L$ with nonzero coefficient have exponent a…

Number Theory · Mathematics 2024-11-13 Rod Gow , Gary McGuire

Let $K$ be a global field and $n > 1$ an integer. We show $n$ is composite if and only if there is an irreducible polynomial $f(x) \in K[x]$ of degree $n$ which is reducible $q$-adically for all the primes $q$ of $K$.

Number Theory · Mathematics 2007-05-23 R. Guralnick , M. Schacher , J. Sonn

A polynomial $f(x)$ over a field $K$ is said to be stable if all its iterates are irreducible over $K$. L. Danielson and B. Fein have shown that over a large class of fields $K$, if $f(x)$ is an irreducible monic binomial, then it is stable…

Number Theory · Mathematics 2022-12-21 Mohamed Ayad , Boualem Benseba , Mohamed Madi

Let $\mathtt{PRIMES}$ be the set of all primes. We show that a multiplicative function which satisfies \[ f(p+q-2) = f(p) + f(q) - f(2) \text{ for }p,q \in \mathtt{PRIMES} \] is one of the following: \begin{enumerate} \item $f$ is the…

Number Theory · Mathematics 2017-08-11 Poo-Sung Park

In this paper, we present the compositional inverses of several classes permutation polynomials of the form $\sum_{i=1}^kb_i\left({\rm Tr}_m^{mn}(x)^{t_i}+\delta\right)^{s_i}+f_1(x)$, where $1\leq i \leq k,$ $s_i$ are positive integers,…

Number Theory · Mathematics 2024-10-01 Danyao Wu , Pingzhi Yuan

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

Let $r,n>1$ be integers and $q$ be any prime power $q$ such that $r\mid q^n-1$. We say that the extension $\mathbb{F}_{q^n}/\mathbb{F}_q$ possesses the line property for $r$-primitive elements property if, for every…

Number Theory · Mathematics 2019-10-08 Stephen D. Cohen , Giorgos Kapetanakis

In this article we compute the $q$th power values of the quadratic polynomials $f$ with negative squarefree discriminant such that $q$ is coprime to the class number of the splitting field of $f$ over $\mathbb{Q}$. The theory of unique…

Number Theory · Mathematics 2010-03-15 Anthony Flatters

The Schinzel hypothesis essentially claims that finitely many irreducible polynomials in one variable over Z simultaneously assume infinitely many prime values unless there is an obvious reason why this is impossible. We prove that under a…

Number Theory · Mathematics 2016-03-29 Andreas O. Bender , Olivier Wittenberg
‹ Prev 1 8 9 10 Next ›