You have just completed your registration at OpenAire.
Before you can login to the site, you will need to activate your account.
An e-mail will be sent to you with the proper instructions.
Important!
Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version
of the site upon release.
Given a set of $n$ positive integers $\{a_1, \ldots, a_n\}$ and an integer parameter $H$ we study small additive shifts of its elements by integers $h_i$ with $|h_i| \le H$, $i =1, \ldots, n$, such that the greatest common divisor of $a_1+h_1, \ldots, a_n+h_n$ is very different from that of $a_1, \ldots, a_n$. We also consider a similar problem for the least common multiple.
We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on elliptic curves.
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$, uniformly over $f\in F_p[X]$ and an $u \in F_p$.
Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen consecutively from a sequence in a finite field of odd prime characteristic. We study the arithmetic of such sequences, including bounds for the largest degree of irreducible factors, the number of irreducible factors, as well as for the number of such sequences of...
In this paper, we define the linear complexity for multidimensional sequences over finite fields, generalizing the one-dimensional case. We give some lower and upper bounds, valid with large probability, for the linear complexity and $k$-error linear complexity of multidimensional periodic sequences.
We use bounds of mixed character sums modulo a prime $p$ to estimate the density of integer points on the hypersurface $$ f_1(x_1) + \ldots + f_n(x_n) =a x_1^{k_1} \ldots x_n^{k_n} $$ for some polynomials $f_i \in {\mathbb Z}[X]$, nonzero integer $a$ and positive integers $k_i$ $i=1, \ldots, n$. In the case of $$ f_1(X) = \ldots = f_n(X) = X^2 \quad \text{and}\quad k_1 = \ldots = k_n =1 $$ the above congruence is known as the Markoff-Hurwitz hypersurface, while for $$ f_1(X) = \ldots = f_n(X)...
We investigate two arithmetic functions naturally occurring in the study of the Euler and Carmichael quotients. The functions are related to the frequency of vanishing of the Euler and Carmichael quotients. We obtain several results concerning the relations between these functions as well as their typical and extreme values.
In this paper, we continue the recent work of Fukshansky and Maharaj on lattices from elliptic curves over finite fields. We show that there exist bases formed by minimal vectors for these lattices except only one case. We also compute their determinants, and obtain sharp bounds for the covering radius.
In this paper we initiate a study on Gauss factorials of polynomials over finite fields, which are the analogues of Gauss factorials of positive integers.