Related papers: Semi-primitive roots and the discrete logarithm mo…
Fast algorithms for integer and polynomial multiplication play an important role in scientific computing as well as in other disciplines. In 1971, Sch{\"o}nhage and Strassen designed an algorithm that improved the multiplication time for…
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…
In this paper the authors provide a complete answer to Donkin's Tilting Module Conjecture for all rank $2$ semisimple algebraic groups and $\text{SL}_{4}(k)$ where $k$ is an algebraically closed field of characteristic $p>0$. In the…
We introduce 3-irreducible modules, even roots and odd roots for Leibniz algebras, produce a basis for a root space of a Leibniz algebra with a semisimple Lie factor, and classify finite dimensional simple Leibniz algebras with Lie factor…
Let $W$ be a finite irreducible real reflection group, which is a Coxeter group. We explicitly construct a basis for the module of differential 1-forms with logarithmic poles along the Coxeter arrangement by using a primitive derivation. As…
A general discussion of the conformal Ward identities is presented in the context of logarithmic conformal field theory with conformal Jordan cells of rank two. The logarithmic fields are taken to be quasi-primary. No simplifying…
A Lehmer number modulo a prime $p$ is an integer $a$ with $1 \leq a \leq p-1$ whose inverse $\bar{a}$ within the same range has opposite parity. Lehmer numbers that are also primitive roots have been discussed by Wang and Wang in an…
We present a generic algorithm for computing discrete logarithms in a finite abelian p-group H, improving the Pohlig-Hellman algorithm and its generalization to noncyclic groups by Teske. We then give a direct method to compute a basis for…
We present a method to obtain congruences modulo powers of 2 for sequences given by recurrences of finite depth with polynomial coefficients. We apply this method to Catalan numbers, Fu\ss-Catalan numbers, and to subgroup counting functions…
We present a new algorithm for computing $m$-th roots over the finite field $\F_q$, where $q = p^n$, with $p$ a prime, and $m$ any positive integer. In the particular case $m=2$, the cost of the new algorithm is an expected $O(\M(n)\log (p)…
This paper gives some results for the logarithm of the Riemann zeta-function and its iterated integrals. We obtain a certain explicit approximation formula for these functions. The formula has some applications, which are related with the…
We derive, for all prime moduli p except those in a very thin set, an upper bound for the least prime primitive root (mod p) of order of magnitude a constant power of log p. The improvement over previous results, where the upper bound was…
In this paper, we introduce a new semi-discrete modulus of smoothness, which generalizes the definition given by Kolomoitsev and Lomako (KL) in 2023 (in the paper published in the J. Approx. Theory), and we establish very general one- and…
In this paper, we prove a result on the $2$-adic logarithm of the fundamental unit of the field $\mathbb{Q}(\sqrt[4]{-q}) $, where $q\equiv 3\bmod 4$ is a prime. When $q\equiv 15\bmod 16$, this result confirms a speculation of Coates-Li and…
We describe three algorithms to determine the stable, semistable, and torus-polystable loci of the GIT quotient of a projective variety by a reductive group. The algorithms are efficient when the group is semisimple. By using an…
To study finite-dimensional modules of the Lie superalgebras, Kac introduced the Kac-modules and divided them into typical or atypical modules according as they are simple or not. For Lambda being atypical, Hughes et al have an algorithm to…
We present an efficient exact quantum algorithm for order finding problem when a multiple $m$ of the order $r$ is known. The algorithm consists of two main ingredients. The first ingredient is the exact quantum Fourier transform proposed by…
Elliptic bases, introduced by Couveignes and Lercier in 2009, give an elegant way of representing finite field extensions. A natural question which seems to have been considered independently by several groups is to use this representation…
The first purpose of our paper is to show how Hooley's celebrated method leading to his conditional proof of the Artin conjecture on primitive roots can be combined with the Hardy-Littlewood circle method. We do so by studying the number of…
Regev recently introduced a quantum factoring algorithm that may be perceived as a $d$-dimensional variation of Shor's factoring algorithm. In this work, we extend Regev's factoring algorithm to an algorithm for computing discrete…