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.
We obtain a nontrivial upper bound for almost all elements of the sequences of real numbers which are multiplicative and at the prime indices are distributed according to the Sato--Tate density. Examples of such sequences come from coefficients of several $L$-functions of elliptic curves and modular forms. In particular, we show that $|\tau(n)|\le n^{11/2} (\log n)^{-1/2+o(1)}$ for a set of $n$ of asymptotic density 1, where $\tau(n)$ is the Ramanujan $\tau$ function while the standard argume...
In this paper, we mainly give a general explicit form of Cassels' $p$-adic embedding theorem for number fields. We also give its refined form in the case of cyclotomic fields. As a byproduct, given an irreducible polynomial $f$ over $Z$, we give a general unconditional upper bound for the smallest prime number $p$ such that $f$ has a simple root modulo $p$.
We study polynomials with integer coefficients which become Eisenstein polynomials after the additive shift of a variable. We call such polynomials shifted Eisenstein polynomials. We determine an upper bound on the maximum shift that is needed given a shifted Eisenstein polynomial and also provide a lower bound on the density of shifted Eisenstein polynomials, which is strictly greater than the density of classical Eisenstein polynomials. We also show that the number of irreducible degree $n$...
Given a prime $\ell\geq 3$ and a positive integer $k \le \ell-2$, one can define a matrix $D_{k,\ell}$, the so-called Demjanenko matrix, whose rank is equal to the dimension of the Hodge group of the Jacobian ${\mathrm Jac}({\mathcal C}_{k,\ell})$ of a certain quotient of the Fermat curve of exponent $\ell$. For a fixed $\ell$, the existence of $k$ for which $D_{k,\ell}$ is singular (equivalently, for which the rank of the Hodge group of ${\mathrm Jac}({\mathcal C}_{k,\ell})$ is not maximal) ...
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$.
In this paper, we give sharp upper and lower bounds for the number of degenerate monic (and arbitrary, not necessarily monic) polynomials with integer coefficients of fixed degree $n \ge 2$ and height bounded by $H \ge 2$. The polynomial is called degenerate if it has two distinct roots whose quotient is a root of unity. In particular, our bounds imply that non-degenerate linear recurrence sequences can be generated randomly.
In this paper we study the mapping properties of the averaging operator over a variety given by a system of homogeneous equations over a finite field. We obtain optimal results on the averaging problems over two dimensional varieties whose elements are common solutions of diagonal homogeneous equations. The proof is based on a careful study of algebraic and geometric properties of such varieties. In particular, we show that they are not contained in any hyperplane and are complete intersectio...
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.
We say that a set $S$ is additively decomposed into two sets $A$ and $B$, if $S = \{a+b : a\in A, \ b \in B\}$. Here we study additively decompositions of multiplicative subgroups of finite fields. In particular, we give some improvements and generalisations of results of C. Dartyge and A. Sarkozy on additive decompositions of quadratic residues and primitive roots modulo $p$. We use some new tools such the Karatsuba bound of double character sums and some results from additive combinatorics.
In this paper, we concentrate on counting and testing dominant polynomials with integer coefficients. A polynomial is called dominant if it has a simple root whose modulus is strictly greater than the moduli of its remaining roots. In particular, our results imply that the probability that the dominant root assumption holds for a random monic polynomial with integer coefficients tends to 1 in some setting. However, for arbitrary integer polynomials it does not tend to 1. For instance, the pro...
No project research data found
No project statistics found
Scientific Results
Chart is loading... It may take a bit of time. Please be patient and don't reload the page.
PUBLICATIONS BY ACCESS MODE
Chart is loading... It may take a bit of time. Please be patient and don't reload the page.
Publications in Repositories
Chart is loading... It may take a bit of time. Please be patient and don't reload the page.