Searcharxiv⌕ Search

arXiv subjects

D. S. Ramana

Publications and source records attributed to D. S. Ramana.

6 recordsLinked to original sources

A Variant of the Truncated Perron's Formula and Primitive Roots

We show under the Generalised Riemann Hypothesis that for every $δ>0$, almost every prime $q$ in $[Q,2Q]$ has the expected of prime primitive roots in the interval $[x,x+x^{\frac{1}2+δ}]$ provided $Q$ is not more than $x^{\frac{2}{3}-ε}$. We obtain this via a variant of the classical truncated Perron's formula for the partial sums of the coefficients of a Dirichlet series.

math.NT↗

Sum-free subsets of finite abelian groups of type III

A finite abelian group $G$ of cardinality $n$ is said to be of type III if every prime divisor of $n$ is congruent to 1 modulo 3. We obtain a classification theorem for sum-free subsets of largest possible cardinality in a finite abelian group $G$ of type III. This theorem, when taken together with known results, gives a complete characterisation of sum-free subsets of the largest cardinality in any finite abelian group $G$. We supplement this result with a theorem on the structure of sum-free subsets of cardinality "close" to the largest possible in a type III abelian group $G$. We then give two applications of these results. Our first application allows us to write down a formula for the number of orbits under the natural action of ${\rm Aut}(G)$ on the set of sum-free subsets of $G$ of the largest cardinality when $G$ is of the form $({\mathbf{Z}}/m{\mathbf{Z}})^r$, with all prime divisors of $m$ congruent to 1 modulo 3, thereby extending a result of Rhemtulla and Street. Our second application provides an upper bound for the number of sum-free subsets of $G$. For finite abelian groups $G$ of type III and with {\em a given exponent} this bound is substantially better than that implied by the bound for the number of sum-free subsets in an arbitrary finite abelian group, due to Green and Ruzsa.

math.NT↗

The number of rational numbers determined by large sets of integers

When $A$ and $B$ are subsets of the integers in $[1,X]$ and $[1,Y]$ respectively, with $|A| \geq αX$ and $|B| \geq βX$, we show that the number of rational numbers expressible as $a/b$ with $(a,b)$ in $A \times B$ is $\gg (αβ)^{1+ε}XY$ for any $ε> 0$, where the implied constant depends on $ε$ alone. We then construct examples that show that this bound cannot in general be improved to $\gg αβXY$. We also resolve the natural generalisation of our problem to arbitrary subsets $C$ of the integer points in $[1,X] \times [1,Y]$. Finally, we apply our results to answer a question of Sárközy concerning the differences of consecutive terms of the product sequence of a given integer sequence.

math.NT↗

Arithmetical Applications of an Identity for the Vandermonde Determinant

When $\{α_i\}_{1 \leq i \leq m}$ is a sequence of distinct non-zero elements of an integral domain $A$ and $γ$ is a common multiple of the $α_i$ in $A$ we obtain, by means of a simple identity for the Vandermonde determinant, a lower bound for $\sup_{1\leq i < j \leq m}ϕ(α_i - α_j)$ in terms of $ϕ(γ)$, where $ϕ$ is a function from the nonzero elements of $A$ to ${\bf R}_{+}$ satisfying certain natural conditions. We describe several applications of this bound.

math.NT↗