The divisor problem for binary cubic forms

Tim Browning

Displaying similar documents to “The divisor problem for binary cubic forms”

Omega result for the error term in the mean square formula for Dirichlet $L$ -functions.

Lau, Yuk-Kam, Tsang, Kai-Man (2008)

Annales Academiae Scientiarum Fennicae. Mathematica

Similarity:

On hypoellipticity in $𝒢$ .

Nedeljkov, M., Pilipović, S. (2002)

Bulletin. Classe des Sciences Mathématiques et Naturelles. Sciences Mathématiques

Similarity:

On hypoellipticity in g

M. Nedeljkov, S. Pilipović (2002)

Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques

Similarity:

Discrepancy estimates for a class of normal numbers

Yoshinobu Nakai, Iekata Shiokawa (1992)

Acta Arithmetica

Similarity:

Boundary value problems in complex analysis. II.

Begehr, Heinrich (2005)

Boletín de la Asociación Matemática Venezolana

Similarity:

Asymptotic behavior for the best lower bound of Jensen's functional

Stojan Radenović, Mirjana Pavlović (2003)

Kragujevac Journal of Mathematics

Similarity:

Landau’s function for one million billions

Marc Deléglise, Jean-Louis Nicolas, Paul Zimmermann (2008)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let $𝔖_{n}$ denote the symmetric group with $n$ letters, and $g (n)$ the maximal order of an element of $𝔖_{n}$ . If the standard factorization of $M$ into primes is $M = q_{1}^{α_{1}} q_{2}^{α_{2}} ... q_{k}^{α_{k}}$ , we define $ℓ (M)$ to be $q_{1}^{α_{1}} + q_{2}^{α_{2}} + ... + q_{k}^{α_{k}}$ ; one century ago, E. Landau proved that $g (n) = {max}_{ℓ (M) \leq n} M$ and that, when $n$ goes to infinity, $log g (n) \sim \sqrt{n log (n)}$ . There exists a basic algorithm to compute $g (n)$ for $1 \leq n \leq N$ ; its running time is $𝒪 (N^{3 / 2} / \sqrt{log N})$ and the needed memory is $𝒪 (N)$ ; it allows computing $g (n)$ up to, say, one million. We describe an algorithm to calculate $g (n)$ for $n$ up to $10^{15}$ . The main idea is to use the...

Some remarks on a paper of L. Tóth.

De Koninck, Jean-Marie, Kátai, Imre (2010)

Journal of Integer Sequences [electronic only]

Similarity:

On the number of pairs of partitions of n without common subsums

P. Erdős, J. Nicolas, A. Sárközy (1992)

Colloquium Mathematicae

Similarity: