Searcharxiv⌕ Search

arXiv subjects

Olivier Ramaré

Publications and source records attributed to Olivier Ramaré.

25 records · Page 2Linked to original sources

A modular analogue of a problem of Vinogradov

Given a primitive, non-CM, holomorphic cusp form $f$ with normalized Fourier coefficients $a(n)$ and given an interval $I\subset [-2, 2]$, we study the least prime $p$ such that $a(p)\in I$ . This can be viewed as a modular form analogue of Vinogradov's problem on the least quadratic non-residue. We obtain strong explicit bounds on $p$, depending on the analytic conductor of $f$ for some specific choices of $I$.

math.NT↗

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↗

Accurate Computations of Euler Products over Primes in Arithmetic Progressions

This note provides truncated formulae with explicit error terms to compute Euler products over primes in arithmetic progressions of rational fractions. It further provides such a formula for the product of terms of the shape $F(1/p, 1/p^s)$ when $F$ is a two-variable polynomial with coefficients in $\mathbb{C}$ and satisfying some restrictive conditions.

math.NT↗

Fast multi-precision computation of some Euler products

For every modulus $q\ge3$, we define a family of subsets $\mathcal{A}$ of the multiplicative group $(\mathbb{Z}/{q}\mathbb{Z})^\times$ for which the Euler product $\prod_{p\text{mod}q\in\mathcal{A}}(1-p^{-s})$ can be computed in double exponential time, where $s>1$ is some given real number. We provide a Sage script to do so, and extend our result to compute Euler products $\prod_{p\in\mathcal{A}}F(1/p)/G(1/p)$ where $F$ and $G$ are polynomials with real coefficients, when this product converges absolutely. This enables us to give precise values of several Euler products intervening in Number Theory.

math.NT↗

Rationality of the zeta function of the subgroups of abelian $p$-groups

Given a finite abelian $p$-group $F$, we prove an efficient recursive formula for $σ_a(F)=\sum_{\substack{H\leq F}}|H|^a$ where $H$ ranges over the subgroups of $F$. We infer from this formula that the $p$-component of the corresponding zeta-function on groups of $p$-rank bounded by some constant $r$ is rational with a simple denominator. We also provide two explicit examples in rank $r=3$ and $r=4$ as well as a closed formula for $σ_a(F)$.

math.NT↗

A stronger model for peg solitaire, II

The main problem addressed here is to decide whether it is possible or not to go from a given position on a peg-solitaire board to another one. No non-trivial sufficient conditions are known, but tests have been devised to show impossibility. We expose the way these tests work in a unified formalism and provide a new test which is strictly stronger than all previous ones.

math.CO↗