Note on Artin's Conjecture on Primitive Roots

E. Artin conjectured that any integer $a > 1$ which is not a perfect square is a primitive root modulo $p$ for infinitely many primes $ p.$ Let $f_a(p)$ be the multiplicative order of the non-square integer $a$ modulo the prime $p.$ M. R. Murty and S. Srinivasan \cite{Murty-Srinivasan} showed that if $\displaystyle \sum_{p < x} \frac 1 {f_a(p)} = O(x^{1/4})$ then Artin's conjecture is true for $a.$ We relate the Murty-Srinivasan condition to sums involving the cyclotomic periods from the subfields of $\mathbb Q(e^{2\pi i /p})$ corresponding to the subgroups $<a> \subseteq \mathbb F_p^*.$

THE STATISTICAL MULTIPLICATIVE ORDER CONVERGENCE IN RIESZ ALGEBRAS

The statistically multiplicative convergence in Riesz algebras was studied and investigated with respect to the solid topology. In the present paper, the statistical convergence with the multiplication in Riesz algebras is introduced by developing topology-free techniques using the order convergence in vector lattices. Moreover, we give some relations with the other kinds of convergences such as the order statistical convergence, the $mo$-convergence, and the order convergence.

On the combinatorial rank of the quantum groups of type G2

In this paper, we calculate the combinatorial rank of the positive part [Formula: see text] of the multiparameter version of the small Lusztig quantum group, where [Formula: see text] is a simple Lie algebra of type [Formula: see text]. Supposing that the main parameter of quantization [Formula: see text] has multiplicative order [Formula: see text], where [Formula: see text] is finite, [Formula: see text], we prove that the combinatorial rank equals 3.

The translate and line properties for 2-primitive elements in quadratic extensions

Let [Formula: see text] be integers and [Formula: see text] be any prime power [Formula: see text] such that [Formula: see text]. We say that the extension [Formula: see text] possesses the line property for [Formula: see text]-primitive elements if, for every [Formula: see text], such that [Formula: see text], there exists some [Formula: see text], such that [Formula: see text] has multiplicative order [Formula: see text]. Likewise, if, in the above definition, [Formula: see text] is restricted to the value [Formula: see text], we say that [Formula: see text] possesses the translate property. In this paper, we take [Formula: see text] (so that necessarily [Formula: see text] is odd) and prove that [Formula: see text] possesses the translate property for 2-primitive elements unless [Formula: see text]. With some additional theoretical and computational effort, we show also that [Formula: see text] possesses the line property for 2-primitive elements unless [Formula: see text].

FINITE FIELD EXTENSIONS WITH THE LINE OR TRANSLATE PROPERTY FOR -PRIMITIVE ELEMENTS

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 $\unicode[STIX]{x1D6FC},\unicode[STIX]{x1D703}\in \mathbb{F}_{q^{n}}^{\ast }$ such that $\mathbb{F}_{q^{n}}=\mathbb{F}_{q}(\unicode[STIX]{x1D703})$ , there exists some $x\in \mathbb{F}_{q}$ such that $\unicode[STIX]{x1D6FC}(\unicode[STIX]{x1D703}+x)$ has multiplicative order $(q^{n}-1)/r$ . We prove that, for sufficiently large prime powers $q$ , $\mathbb{F}_{q^{n}}/\mathbb{F}_{q}$ possesses the line property for $r$ -primitive elements. We also discuss the (weaker) translate property for extensions.

ON SEMIGROUP ORBITS OF POLYNOMIALS AND MULTIPLICATIVE ORDERS

We show, under some natural restrictions, that some semigroup orbits of polynomials cannot contain too many elements of small multiplicative order modulo a large prime $p$, extending previous work of Shparlinski [‘Multiplicative orders in orbits of polynomials over finite fields’, Glasg. Math. J.60(2) (2018), 487–493].

LOWER BOUNDS FOR PERIODS OF DUCCI SEQUENCES

A Ducci sequence is a sequence of integer $n$-tuples obtained by iterating the map $$\begin{eqnarray}D:(a_{1},a_{2},\ldots ,a_{n})\mapsto (|a_{1}-a_{2}|,|a_{2}-a_{3}|,\ldots ,|a_{n}-a_{1}|).\end{eqnarray}$$ Such a sequence is eventually periodic and we denote by $P(n)$ the maximal period of such sequences for given odd $n$. We prove a lower bound for $P(n)$ by counting certain partitions. We then estimate the size of these partitions via the multiplicative order of two modulo $n$.