Moments of random multiplicative functions over function fields
From MaRDI portal
Cites work
- A note on Helson's conjecture on moments of random multiplicative functions
- A pentagonal number sieve
- A short proof of Helson's conjecture
- Almost sure bounds for a weighted Steinhaus random multiplicative function
- Almost Sure Large Fluctuations of Random Multiplicative Functions
- An almost sure upper bound for random multiplicative functions on integers with a large prime factor
- Better than square-root cancellation for random multiplicative functions
- Bounds for exponential sums with random multiplicative coefficients
- Central limit theorems for random multiplicative functions
- Helson's problem for sums of a random multiplicative function
- Large character sums
- Magic squares, the symmetric group and Möbius randomness
- Mean values of multiplicative functions over function fields
- Moments of random multiplicative functions and truncated characteristic polynomials
- Moments of random multiplicative functions. I: Low moments, better than squareroot cancellation, and critical multiplicative chaos
- Moments of random multiplicative functions. II: High moments
- Multiplicative number theory. I. Classical theory
- On a certain nonary cubic form and related equations
- On mean values of random multiplicative functions
- On the equation \(n_{1}n_{2}=n_{3}n_{4}\) and mean value of character sums
- On the limit distributions of some sums of a random multiplicative function
- On the random Chowla conjecture
- Partial sums of typical multiplicative functions over short moving intervals
- Polynômes arithmétiques et méthode des polyedres en combinatoire
- Probability estimates for reachability of linear systems defined over finite fields
- Pseudomoments of the Riemann zeta-function and pseudomagic squares
- Random factorizations and Riemann's hypothesis
- Random multiplicative functions in short intervals
- Secular coefficients and the holomorphic multiplicative chaos
- Summation of a random multiplicative function on numbers having few prime factors
- Sums of random multiplicative functions over function fields with few irreducible factors
- The congruence \(x_ 1x_ 2\equiv x_ 3x_ 4\pmod p\), the equation \(x_ 1x_ 2=x_ 3x_ 4\), and mean values of character sums
This page was built for publication: Moments of random multiplicative functions over function fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6918371)