相关论文: On the minimal number of small elements generating…

For a large prime $p$, and a polynomial $f$ over a finite field $F_p$ of $p$ elements, we obtain a lower bound on the size of the multiplicative subgroup of $F_p^*$ containing $H\ge 1$ consecutive values $f(x)$, $x = u+1, \ldots, u+H$,…

For any prime p we consider the density of elements in the multiplicative group of the finite field F_p having order, respectively index, congruent to a(mod d). We compute these densities on average, where the average is taken over all…

We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…

Fix $a \in \mathbb{Z}$, $a\notin \{0,\pm 1\}$. A simple argument shows that for each $\epsilon > 0$, and almost all (asymptotically 100% of) primes $p$, the multiplicative order of $a$ modulo $p$ exceeds $p^{\frac12-\epsilon}$. It is an…

We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field $\mathbb{F}_{p^n}$ where $p$ is a prime. In time polynomial in $p$ and $n$, the algorithm either outputs an element that…

Let $F$ be a field and let $E$ be an \'etale algebra over $F$, that is, a finite product of finite separable field extensions $E = F_1 \times \dots \times F_r$. The classical primitive element theorem asserts that if $r = 1$, then $E$ is…

For a large prime $p$, a rational function $\psi \in F_p(X)$ over the finite field $F_p$ of $p$ elements, and integers $u$ and $H\ge 1$, we obtain a lower bound on the number consecutive values $\psi(x)$, $x = u+1, \ldots, u+H$ that belong…

The aim of this paper is to give upper bounds for the Euclidean minima of abelian fields of odd prime conductor. In particular, these bounds imply Minkowski's conjecture for totally real number fields of conductor p^r, where p is an odd…

Let $F_q$ be a field with $q$ elements, where $q$ is a power of a prime number $p\geq 5$. For any integer $m\geq 2$ and $a\in F_q^*$ such that the polynomial $x^m-a$ is irreducible in $F_q[x]$, we combine two different methods to construct…

Let $\mathbb{F}_{q}$ be a finite field of order $q=p^k$ where $p$ is prime. Let $P$ and $L$ be sets of points and lines respectively in $\mathbb{F}_{q} \times \mathbb{F}_{q}$ with $|P|=|L|=n$. We establish the incidence bound $I(P,L) \leq…

Let $\varepsilon>0$ be a fixed small constant, ${\mathbb F}_p$ be the finite field of $p$ elements for prime $p$. We consider additive and multiplicative problems in ${\mathbb F}_p$ that involve intervals and arbitrary sets. Representative…

For a prime number $p$, an integer $e\geq 2$ and a field $F$ containing a primitive $p^e$-th root of unity, the index of central simple $F$-algebras of exponent $p^e$ is bounded in terms of the $p$-symbol length of $F$. For a nonreal field…

In this paper we obtain significant bounds for the number of maximal subgroups of a given index of a finite group. These results allow us to give new bounds for the number of random generators needed to generate a finite $d$-generated group…

When investigating the distribution of the Euler totient function, one encounters sets of primes P where if p is in P then r is in P for all r|(p-1). While it is easy to construct finite sets of such primes, the only infinite set known is…

Let $p$ be a prime and let $g(p)$ be the least primitive root modulo $p$. We prove that for any $\epsilon>0$ and $p$ large enough the bound \begin{align} g(p)\ll p^{\frac{1}{4\sqrt{e}}+\epsilon} \nonumber \end{align} holds for most prime…

We improve the upper bounds (in terms of $n$) in [9] and [13] on the minimal number of elements required to generate a minimally transitive permutation group of degree $n$.

Let $F_p$ be the field of a prime order $p$. Then for any positive integer $n>1$, for any $\epsilon>0$, and for any subset $A$ of $F_p$, every element of $F_p$ can be represented as a sum of $N$ elements, each of them is a product of $n$…

We obtain an asymptotic upper bound for the product of the $p$-parts of the orders of certain composition factors of a finite group acting completely reducibly and faithfully on a finite vector space of order divisible by a prime $p$. An…

Given ${\mathbb{F}_{p^t}}$, a field with $p^t$ elements, where $p$ is a prime power, $t$ is a positive integer. Let $f(x)$ be a polynomial over $\mathbb{F}_{p^t}$ of degree $m$ with some restrictions. In this paper, we construct a…

For infinitely many primes $p=4k+1$ we give a slightly improved upper bound for the maximal cardinality of a set $B\subset \ZZ_p$ such that the difference set $B-B$ contains only quadratic residues. Namely, instead of the "trivial" bound…