Related papers: Special Sets of Primes in Function Fields

Let $\mathbb{F}_p$ be the field of a prime order $p.$ It is known that for any integer $N\in [1,p]$ one can construct a subset $A\subset\mathbb{F}_p$ with $|A|= N$ such that $$ \max\{|A+A|, |AA|\}\ll p^{1/2}|A|^{1/2}. $$ In the present…

We study the splitting fields of the family of polynomials $f_n(X)= X^n-X-1$. This family of polynomials has been much studied in the literature and has some remarkable properties. Serre related the function on primes $N_p(f_n)$, for a…

We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…

The greatest power of a prime $p$ dividing the natural number $n$ will be denoted by $n_p$. Let $Ind_G(g)=|G:C_G(g)|$. Suppose that $G$ is a finite group and $p$ is a prime. We prove that if there exists an integer $\alpha>0$ such that…

This paper studies infinite class field towers of number fields $K$ that are ramified over $\Q$ only at one finite prime. In particular, we show the existence of such towers for a general family of primes including $p=2$, 3 and 5.

For any prime number p and any positive real number {\alpha}, we construct a finitely generated group {\Gamma} with p-gradient equal to {\alpha}. This construction is used to show that there exist uncountably many pairwise non-commensurable…

A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…

Let $F$ be an algebraically closed field of characteristic $p>0$. In this paper we develop methods to represent arbitrary elements of $F[t]$ as sums of perfect $k$-th powers for any $k\in\mathbb{N}$ relatively prime to $p$. Using these…

Many generating series of combinatorially interesting numbers have the property that the sum of the terms of order $<p$ at some suitable point is congruent to a zero of a zeta-function modulo infinitely many primes $p$. Surprisingly, very…

The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…

Let $q=p^r$ be the power of a prime $p$ and $(\beta_1,\ldots ,\beta_r)$ be an ordered basis of $\mathbb{F}_q$ over $\mathbb{F}_p$. For $$ \xi=\sum\limits_{j=1}^r x_j\beta_j\in \mathbb{F}_q \quad \mbox{with digits }x_j\in\mathbb{F}_p, $$ we…

The prime number problem falls within the realm of number theory, specifically elementary number theory. Current research approaches have unnecessarily complicated this matter. In contrast to more advanced mathematical tools, the methods of…

In this paper, we investigate the proportion of monogenic orders among the orders whose indices are a power of a fixed prime in a pure cubic field. We prove that the proportion is zero for a prime number that is not equal to 2 or 3. To do…

The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of…

The $p$-set, which is in a simple analytic form, is well distributed in unit cubes. The well-known Weil's exponential sum theorem presents an upper bound of the exponential sum over the $p$-set. Based on the result, one shows that the…

We prove that infinite p-adically discrete sets have Diophantine definitions in large subrings of some number fields. First, if K is a totally real number field or a totally complex degree-2 extension of a totally real number field, then…

We call a set of positive integers closed under taking unitary divisors a unitary ideal. It can be regarded as a simplicial complex. Moreover, a multiplicative arithmetical function on such a set corresponds to a function on the simplicial…

Let $n \in \mathbb{Z}_{\geqslant 2}$. By $P(n)$ we denote the set of all prime divisors of the integers in the sequence $n, n^2-1, (n^2-1)^2-1, \dots$. We ask whether the set $P(n)$ determines $n$ uniquely under the assumption that $n \neq…

We obtain bounds on the number of triples that determine a given pair of dot products arising in a vector space over a finite field or a module over the set of integers modulo a power of a prime. More precisely, given $E\subset \mathbb…

The author proves that there are infinitely many primes $p$ such that $\| \alpha p - \beta \| < p^{-\frac{28}{87}}$, where $\alpha$ is an irrational number and $\beta$ is a real number. This sharpens a result of Jia (2000) and provides a…