Related papers: A primitive normal pair with prescribed prenorm

The so called $k$-normal elements appear in the literature as a generalization of normal elements over finite fields. Recently, questions concerning the construction of $k$-normal elements and the existence of $k$-normal elements that are…

Let p be any prime, and $p^(\nu_p(n!))$ the maximal power of $p$ dividing $n!$. It is proved that there exists a positive integer $n_0$, which depends only on $p$, such that $q^(\nu_q(n!)) < p^(\nu_p(n!))$ for all $n \ge n_0$ and all primes…

Let $p,q>1$ be two relatively prime integers and $\mathbb{N}$ the set of nonnegative integers. Let $f_{p,q}(n)$ be the number of different expressions of $n$ written as a sum of distinct terms taken from…

Let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a prime power and, for each integer $n\ge 1$, let $\mathbb F_{q^n}$ be the unique $n$-degree extension of $\mathbb F_q$. The $\mathbb F_q$-orders of an element in…

In this paper, we explore the existence of $m$-terms arithmetic progressions in $\mathbb{F}_{q^n}$ with a given common difference whose terms are all primitive elements, and at least one of them is normal. We obtain asymptotic results for…

Let $q\geq 1$ be any integer and let $ \epsilon \in [\frac{1}{11}, \frac{1}{2})$ be a given real number. In this short note, we prove that for all primes $p$ satisfying $$ p\equiv 1\pmod{q}, \quad \log\log p > \frac{\log…

A $1$-prefix normal word is a binary word with the property that no factor has more $1$s than the prefix of the same length; a $0$-prefix normal word is defined analogously. These words arise in the context of indexed binary jumbled pattern…

For arbitrary positive integers $q_1 \ge q_2 \ge q_3 \ge \cdots$ we construct a family of monomial ideals such that for each positive integer $e$ and for each ideal $I$ in the family, the number of associated primes of $I^e$ is the $q_e$.…

The primorial $p\#$ of a prime $p$ is the product of all primes $q\le p$. Let pr$(n)$ denote the largest prime $p$ with $p\# \mid \phi(n)$, where $\phi$ is Euler's totient function. We show that the normal order of pr$(n)$ is $\log\log…

Fix an integer $g \neq -1$ that is not a perfect square. In 1927, Artin conjectured that there are infinitely many primes for which $g$ is a primitive root. Forty years later, Hooley showed that Artin's conjecture follows from the…

By splitting the real line into intervals of unit length a doubly infinite integral of the form $\Int F(q^x)\,dx,\; 0<q<1$, can clearly be expressed as $\Integ \Sum F(q^{x+n})\,dx$, provided $F$ satisfies the appropriate conditions. This…

Let $q\ne \pm1,v^2$ be a fixed integer, and let $x\geq 1$ be a large number. The least prime number $p \geq3 $ such that $q$ is a primitive root modulo $p$ is conjectured to be $p\ll (\log q)(\log \log q)^3),$ where $\gcd(p,q)=1$. This note…

An element $\alpha \in \mathbb {F}_{q^n}$ is normal over $\mathbb {F}_q$ if $\alpha$ and its conjugates $\alpha, \alpha^q, \cdots \alpha^{q^{n-1}}$ form a basis of $\mathbb {F}_{q^n}$ over $\mathbb {F}_q$. Recently, Huczynska, Mullen,…

In this paper, we estimate the number of $\mathbb{F}_q$-primitive points on the affine hypersurface defined by the equation $f(x_1,\ldots,x_s)=0$, where $f\in\mathbb{F}_q[x_1,\dots,x_s]$ is an appropriate polynomial. In particular, we…

Let $C_n(q)$ be the number of ideals of codimension $n$ of $\mathbb{F}_q\left[x, y, x^{-1}, y^{-1} \right]$, where $\mathbb{F}_q$ is the finite field with $q$ elements. Kassel and Reutenauer [KasselReutenauer2015A] proved that $C_n(q)$ is a…

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…

Ananyan and Hochster proved the existence of a function $\Phi(m,d)$ such that any graded ideal $I$ generated by $m$ forms of degree at most $d$ in a standard graded polynomial ring satisfies $\mathrm{reg}(I) \le \Phi(m,d)$. Relatedly,…

Let $p>1$ be a large prime number and let $x=O((\log p)^2(\log\log p)^5$ be a real number. It is proved that the least consecutive pair of primitive roots $u\ne\pm1, v^2$ and $u+1$ satisfies the upper bound $u\ll x$ in the prime field…

By definition primitive and $2$-primitive elements of a finite field extension $\mathbb{F}_{q^n}$ have order $q^n-1$ and $(q^n-1)/2$, respectively. We have already shown that, with minor reservations, there exists a primitive element and a…

Let $q$ be a prime power and $\mathbb{F}_q$ the finite field with $q$ elements. For a positive integer $n$, the binomial $X^n - 1 \in \mathbb{F}_q[X]$ is said to be $3$-sparse over $\mathbb{F}_q$ if every irreducible factor of $X^n-1$ in…