Ramachandran Balasubramanian
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ramachandran Balasubramanian has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Florian Luca
Mathematics Division, Stellenbosch University
4 shared publications - Priyamvad Srivastav
Institute of Mathematical Sciences Taramani, Chennai, India 600113 and Homi Bhabha National Institute Training School Complex Anushakti Nagar, Mumbai, India 400094
4 shared publications - D. J. Grynkiewicz
University of Memphis
2 shared publications - Dimbinaina Ralaivaosaona
Stellenbosch University
2 shared publications - Gyan Prakash
Harish-Chandra Research Institute, Chhatnag Road, Jhunsi, Allahabad 211 019, India
2 shared publications - Karl-Joachim Wirths
Institut für Analysis und Algebra, TU Braunschweig, Braunschweig, Germany
2 shared publications
Latest Publications
- 1 January 2024
- Published by Institute of Mathematics, Polish Academy of Sciences in Acta Arithmetica
- p. 1-9
The set of values of any finite iteration of Euler’s $\varphi $ function contains long arithmetic progressionsAssuming the validity of Dickson’s conjecture, we show that the set of values of iterated Euler’s totient $\varphi $ function $\varphi \circ \cdots \circ \varphi $ ($n$ times) contains arbitrarily long arithmetic progressions with an explicitly given comm- 1 January 2024
- Published by Institute of Mathematics, Polish Academy of Sciences in Acta Arithmetica
- p. 1-9
The set of values of any finite iteration of Euler’s $\varphi $ function contains long arithmetic progressionsAssuming the validity of Dickson’s conjecture, we show that the set of values of iterated Euler’s totient $\varphi $ function $\varphi \circ \cdots \circ \varphi $ ($n$ times) contains arbitrarily long arithmetic progressions with an explicitly given comm- 21 April 2023
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 92 (343) , 2381-2411
Explicit bounds for products of primes in AP
For all q ≥ 2 q\ge 2 and for all invertible residue classes a a modulo q q , there exists a natural number that is congruent to a a modulo q q and that is the product of exactly three primes, all of which are below ( 10 15 q ) 5 / 2 (10^{15}q)^{5/2} .
- 21 April 2023
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 92 (343) , 2381-2411
Explicit bounds for products of primes in AP
For all q ≥ 2 q\ge 2 and for all invertible residue classes a a modulo q q , there exists a natural number that is congruent to a a modulo q q and that is the product of exactly three primes, all of which are below ( 10 15 q ) 5 / 2 (10^{15}q)^{5/2} .
- 20 October 2020
- Published by SAGE Publications in Journal of Computer Security
- Vol. 28 (6) , 655-676
Side channel analysis of SPECK
SPECK is a family of lightweight block ciphers developed by Beaulieu et al. of the US National Security Agency (NSA) for the Internet of Things (IoT). It is an ARX-based design with a Feistel-like structure which supports keys of size ranging from 64
- 20 October 2020
- Published by SAGE Publications in Journal of Computer Security
- Vol. 28 (6) , 655-676
Side channel analysis of SPECK
SPECK is a family of lightweight block ciphers developed by Beaulieu et al. of the US National Security Agency (NSA) for the Internet of Things (IoT). It is an ARX-based design with a Feistel-like structure which supports keys of size ranging from 64
- 4 June 2019
- Published by Springer Nature in Proceedings - Mathematical Sciences
- Vol. 129 (4) , 43
On a conjecture of Fox–Kleitman and additive combinatorics
- 4 June 2019
- Published by Springer Nature in Proceedings - Mathematical Sciences
- Vol. 129 (4) , 43
On a conjecture of Fox–Kleitman and additive combinatorics
- 17 April 2019
- Published by Springer Nature in Archiv der Mathematik
- Vol. 113 (3) , 273-279
Inequalities for weighted sums of Mertens functions
- 17 April 2019
- Published by Springer Nature in Archiv der Mathematik
- Vol. 113 (3) , 273-279
Inequalities for weighted sums of Mertens functions
- Open Access
Inequalities for weighted sums of Mertens functions
In this article we derive some polynomial inequalities for Mertens functions.
Open AccessInequalities for weighted sums of Mertens functions
In this article we derive some polynomial inequalities for Mertens functions.
- 1 May 2018
- Published by Elsevier in European Journal of Combinatorics
- Vol. 70, 284-296
On a theorem of Deshouillers and Freiman
- 1 May 2018
- Published by Elsevier in European Journal of Combinatorics
- Vol. 70, 284-296
On a theorem of Deshouillers and Freiman
- Open Access
- 1 January 2018
- Published by Institute of Mathematics, Polish Academy of Sciences in Acta Arithmetica
- Vol. 184 (2) , 187-191
On the degree of regularity of a particular linear equation
- 1 January 2018
- Published by Institute of Mathematics, Polish Academy of Sciences in Acta Arithmetica
- Vol. 184 (2) , 187-191
Open AccessOn the degree of regularity of a particular linear equation
- 1 January 2017
- Published by Institute of Mathematics, Polish Academy of Sciences in Acta Arithmetica
- Vol. 179 (4) , 335-361
On Selberg’s approximation to the twin prime problem
In his classical approximation to the twin prime problem, Selberg proved that for infinitely many $n$, $2^{\varOmega (n)}+2^{\varOmega (n+2)} \leq \lambda $ with $\lambda =14$, where $\varOmega (n)$ is the number of prime factors of $n$ counted with multi- 1 January 2017
- Published by Institute of Mathematics, Polish Academy of Sciences in Acta Arithmetica
- Vol. 179 (4) , 335-361
On Selberg’s approximation to the twin prime problem
In his classical approximation to the twin prime problem, Selberg proved that for infinitely many $n$, $2^{\varOmega (n)}+2^{\varOmega (n+2)} \leq \lambda $ with $\lambda =14$, where $\varOmega (n)$ is the number of prime factors of $n$ counted with multi- Open Access
On the number of factorizations of an integer
Let $f(n)$ denote the number of unordered factorizations of a positive integer $n$ into factors larger than $1$. We show that the number of distinct values of $f(n)$, less than or equal to $x$, is at most $\exp \left( C \sqrt{\frac{\log x}{\log \log x}} \left( 1 + o(1) \right) \right)$, where $C=2\pi\sqrt{2/3}$ and $x$ is sufficiently large. This improves upon a previous result of the first author and F. Luca.Open AccessOn the number of factorizations of an integer
Let $f(n)$ denote the number of unordered factorizations of a positive integer $n$ into factors larger than $1$. We show that the number of distinct values of $f(n)$, less than or equal to $x$, is at most $\exp \left( C \sqrt{\frac{\log x}{\log \log x}} \left( 1 + o(1) \right) \right)$, where $C=2\pi\sqrt{2/3}$ and $x$ is sufficiently large. This improves upon a previous result of the first author and F. Luca.