Searcharxiv⌕ Search

arXiv subjects

Ramachandran Balasubramanian

Publications and source records attributed to Ramachandran Balasubramanian.

2 recordsLinked to original sources

Product of three primes in large arithmetic progressions

For any $ε>0$, there exists $q_0(ε)$ such for any $q\ge q_0(ε)$ and any invertible residue class $a$ modulo $q$, there exists a natural number that is congruent to $a$ modulo $q$ and that is the product of exactly three primes, all of which are below $q^{\frac{3}{2}+ε}$. If we restrict our attention to odd moduli $q$ that do not have prime factors congruent to 1 mod 4, we can find such primes below $q^{\frac{11}{8}+ε}$. If we further restrict our set of moduli to prime $q$ that are such that $(q-1,4\cdot7\cdot11\cdot17\cdot23\cdot29)=2$, we can find such primes below $q^{\frac{6}{5}+ε}$. Finally, for any $ε>0$, there exists $q_0(ε)$ such that when $q\ge q_0(ε)$, there exists a natural number that is congruent to $a$ modulo $q$ and that is the product of exactly four primes, all of which are below $q(\log q)^6$.

math.NT↗

Sur la complexité de familles d'ensembles pseudo-aléatoires

In this paper we are interested in the following problem. Let $p$ be a prime number, $S\subset \F_p$ and $\cP\subset \{P\in\F_p [X]:°P\le d\}$. What is the largest integer $k$ such that for all subsets $\cA, \cB$ of $\F_p$ satisfying $\cA\cap\cB =\emptyset$ and $|\cA\cup\cB |=k$, there exists $P\in\cP$ such that $P(x)\in S$ if $x\in\cA$ and $P(x)\not\in S$ if $x\in\cB$? This problem corresponds to the study of the complexity of some families of pseudo-random subsets. First we recall this complexity definition and the context of pseudo-random subsets. Then we state the different results we have obtained according to the shape of the sets $S$ and $\cP$ considered. Some proofs are based on upper bounds for exponential sums or characters sums in finite fields, other proofs use combinatorics and additive number theory.

math.NT↗