Related papers: The modified prime sieve for primitive elements in…

In these notes, we refine Mitsui's Prime Number Theorem from 1957, which for a number field $K$ predicts how many prime elements there are in bounded convex sets in $K \otimes_{\mathbf Q} \mathbf R$, by incorporating potential Siegel zeros…

Let $p$ be a odd prime such that 2 is a primitive element of finite field $F_p*$. In this short note we propose a new algorithm for the computation of discrete logarithm in $F_p*$. This algorithm is based on elementary properties of finite…

Let $m$ be a natural number, and let $\mathcal{Q}$ be a set containing at least $\exp(C m)$ primes. We show that one can find infinitely many strings of $m$ consecutive primes each of which has some $q\in\mathcal{Q}$ as a primitive root,…

We study (inhomogeneous) approximation for systems of linear forms using integer points which satisfy additional primitivity constraints. The first family of primitivity constraints we consider were introduced in 2015 by Dani, Laurent, and…

Let $q=p^r$ be a prime power, and let $f(x)=x^m-\gs_{m-1}x^{m-1}- >...-\gs_1x-\gs_0$ be an irreducible polynomial over the finite field $\GF(q)$ of size $q$. A zero $\xi$ of $f$ is called {\em nonstandard (of degree $m$) over $\GF(q)$} if…

This article investigates the existence of an $r$-primitive $k$-normal polynomial, defined as the minimal polynomial of an $r$-primitive $k$-normal element in $\mathbb{F}_{q^n}$, with a specified degree $n$ and two given coefficients over…

Let $G=\langle x^d+c_1,\dots,x^d+c_s\rangle$ be a semigroup generated under composition for some $c_1,\dots,c_s\in\mathbb{Z}$ and some $d\geq2$. Then we prove that, outside of an exceptional one-parameter family, $G$ contains a large and…

We present computational results which strongly support a conjecture of Morgan and Mullen (1996), which states that for every extension $E/F$ of Galois fields there exists a primitive element of $E$ which is completely normal over $F$.

We propose a criterion that allows one to distinguish prime numbers from compound ones. This criterion is based on the counting of small quadratic residues.

We introduce a categorical analogue of Saito's notion of primitive forms. Let $W$ denote the potential $\frac{1}{n+1} x^{n+1}$. For the category $MF(W)$ of matrix factorizations of $W$ we prove that there exists a unique, up to non-zero…

We prove that if $G$ is a finite primitive permutation group and if $g$ is an element of $G$, then either $g$ has a cycle of length equal to its order, or for some $r$, $m$ and $k$, the group $G \leq \mathrm{Sym}(m) \textrm{wr}…

We study certain aspects of the Selberg sieve, in particular when sifting by rather thin sets of primes. We derive new results for the lower bound sieve suited especially for this setup and we apply them in particular to give a new…

Let G be a compact real Lie group, and let f be an irreducible complex character of G, of degree > 1. We show that there exists an element g of G, of finite order, such that f(g)=0. We also give an unpublished result of Deligne, about…

We fix a non-zero integer $a$ and consider arithmetic progressions $a \bmod q$, with $q$ varying over a given range. We show that for certain specific values of $a$, the arithmetic progressions $a \bmod q$ contain, on average, significantly…

We consider the problem of recovering a hidden element $s$ of a finite field $\F_q$ of $q$ elements from queries to an oracle that for a given $x\in \F_q$ returns $(x+s)^e$ for a given divisor $e\mid q-1$. We use some techniques from…

Viable non-perturbative methods for lattice quantum field theories on curved manifolds are difficult. By adapting features from the traditional finite element methods (FEM) and Regge Calculus, a new simplicial lattice Quantum Finite Element…

In this paper, a computationally simple and explicit method of constructing recursive sequence of primitive polynomials of degree $n2^k (k = 1, 2, 3,\ldots)$ over $\mathbb{F}_{q}$ is given.

We employ concepts and tools from the theory of finite permutation groups in order to analyse the Hidden Subgroup Problem via Quantum Fourier Sampling (QFS) for the symmetric group. We show that under very general conditions both the weak…

We provide a detailed structural description of the nilpotent primitive subgroups of $\mathrm{GL}(n, \mathbb{F})$, where $\mathbb{F}$ is a finite field.

In 2016, Fei \cite{fei2016application} established a bound on the Siegel zeros for real primitive Dirichlet characters modulo $q$, assuming the weak Hardy-Littlewood conjecture. Building on Fei's work, Jia \cite{jia2022conditional}…