Add to ORKGWe provide a simple proof that the partial sums $\sum_{n\leq x}f(n)$ of a Rademacher random multiplicative function $f$ change sign infinitely often as $x\to\infty$, almost surely.Comment: 10 pages, added comments from the referee and two figure
We prove that the Kloosterman sum $$S(1,1;c)$$ S ( 1 , 1 ; c ) changes sign infinitely often as $$c$...
For the partial sums (Sn) of independent random variables we define a stochastic process sn(t)colon,...
A Steinhaus random multiplicative function $f$ is a completely multiplicative function obtained by s...
We characterize the limiting behavior of partial sums of multiplicative functions $f:\mathbb{F}_q[t]...
A heuristic in analytic number theory stipulates that sets of positive integers cannot simultaneousl...
summary:We examine an arithmetical function defined by recursion relations on the sequence $ \{f(p^k...
We establish a normal approximation for the limiting distribution of partial sums of random Rademach...
We prove that if f(n) is a Steinhaus or Rademacher random multiplicative function, there almost sure...
Resolving a conjecture of Helson, Harper recently established that partial sums of random multiplica...
Contains fulltext : 235183.pdf (Publisher’s version ) (Open Access
In this paper, we obtain an almost sure functional limit theorem for random sums of multiindex rando...
In this paper we obtain an almost sure version of a limit theorem for random sums of multiindex rand...
We study questions in three arithmetic settings, each of which carries aspects of random-like behavi...
AbstractGiven functions ƒ1(x), ..., ƒn(x), x = (x1, ..., xm) ∈ M, where M is an open parallelepiped ...
Let λ and µ denote the Liouville and Möbius functions, respectively. Hildebrand showed that all ei...
We prove that the Kloosterman sum $$S(1,1;c)$$ S ( 1 , 1 ; c ) changes sign infinitely often as $$c$...
For the partial sums (Sn) of independent random variables we define a stochastic process sn(t)colon,...
A Steinhaus random multiplicative function $f$ is a completely multiplicative function obtained by s...
We characterize the limiting behavior of partial sums of multiplicative functions $f:\mathbb{F}_q[t]...
A heuristic in analytic number theory stipulates that sets of positive integers cannot simultaneousl...
summary:We examine an arithmetical function defined by recursion relations on the sequence $ \{f(p^k...
We establish a normal approximation for the limiting distribution of partial sums of random Rademach...
We prove that if f(n) is a Steinhaus or Rademacher random multiplicative function, there almost sure...
Resolving a conjecture of Helson, Harper recently established that partial sums of random multiplica...
Contains fulltext : 235183.pdf (Publisher’s version ) (Open Access
In this paper, we obtain an almost sure functional limit theorem for random sums of multiindex rando...
In this paper we obtain an almost sure version of a limit theorem for random sums of multiindex rand...
We study questions in three arithmetic settings, each of which carries aspects of random-like behavi...
AbstractGiven functions ƒ1(x), ..., ƒn(x), x = (x1, ..., xm) ∈ M, where M is an open parallelepiped ...
Let λ and µ denote the Liouville and Möbius functions, respectively. Hildebrand showed that all ei...
We prove that the Kloosterman sum $$S(1,1;c)$$ S ( 1 , 1 ; c ) changes sign infinitely often as $$c$...
For the partial sums (Sn) of independent random variables we define a stochastic process sn(t)colon,...
A Steinhaus random multiplicative function $f$ is a completely multiplicative function obtained by s...