Michel Weber

  1. Dirichlet polynomials: some old and recent results, and their interplay in number theory.

    Authors: Michel Weber
    Subjects: Number Theory
    Abstract

    In the first part of the paper, we present and discuss the interplay of
    Dirichlet polynomials in some classical problems of number theory, notably the
    Lindel\"of Hypothesis. We review some typical properties of their means and
    continue with some investigations concerning their supremum properties. Their
    random counterpart is next considered in the second part of the paper. An
    analysis of their supremum properties, which is entirely based on methods of
    stochastic processes, is presented. Some complementary results and related
    questions are included in the last section of the paper.

  2. Dirichlet polynomials: some old and recent results, and their interplay in number theory.

    Authors: Michel Weber
    Subjects: Number Theory
    Abstract

    In the first part of the paper, we present and discuss the interplay of
    Dirichlet polynomials in some classical problems of number theory, notably the
    Lindel\"of Hypothesis. We review some typical properties of their means and
    continue with some investigations concerning their supremum properties. Their
    random counterpart is next considered in the second part of the paper. An
    analysis of their supremum properties, which is entirely based on methods of
    stochastic processes, is presented. Some complementary results and related
    questions are included in the last section of the paper.

  3. A Sharp Estimate for Divisors of Bernoulli Sums.

    Authors: Michel Weber
    Subjects: Number Theory
    Abstract

    Let $S_n=\e_1+...+\e_n$, where $ \e_i $ are i.i.d. Bernoulli r.v.'s. Let
    $0\le r_d(n)<2d$ be the least residue of $n$ mod$(2d)$, $\bar r_d(n)= 2d
    -r_d(n)$ and $\b(n,d)=\max ({1\over d}, {1\over \sqrt n})[e^{- {r_d(n)^2/2 n}}
    +e^{- {\bar r_d(n)^2/2 n}}]$. We show that $$\sup_{2\le d\le n}
    \big|\P\big\{d|S_n\big\}- E(n,d) \big|= {\cal O}\big({\log^{5/2} n \over
    n^{3/2}}\big), $$ where $E(n,d) $ verifies $c_1\b(n,d)\le E(n,d)\le c_2\b(n,d)
    $ and $c_1,c_2 $ are numerical constants.

RSS-материал