English
Related papers

Related papers: Note on the Chowla Conjecture and the Discrete Fou…

200 papers

Let X be a regular scheme, projective and flat over the integers. Let A be the constant in the conjectured functional equation for the zeta-function of X. We give a conjecture computing A in terms of Euler characteristics of derived…

Algebraic Geometry · Mathematics 2018-10-23 Stephen Lichtenbaum

We generalize a result of Matom\"aki, Radziwi{\l}{\l}, and Tao, by proving an averaged version of a conjecture of Chowla and a conjecture of Elliott regarding correlations of the Liouville function, or more general bounded multiplicative…

Number Theory · Mathematics 2017-01-06 Nikos Frantzikinakis

We put together the ingredients for an efficient operator calculus based on Krawtchouk polynomials, including Krawtchouk transforms and corresponding convolution structure which provide an inherently discrete alternative to Fourier…

Functional Analysis · Mathematics 2014-09-17 Philip Feinsilver , René Schott

Let $f(n)$ denote a multiplicative function with range $\{-1,0,1\}$, and let $F(x) = \sum_{n\leq x} f(n)$. Then $F(x)/\sqrt{x} = a\sqrt{x} + b + E(x)$, where $a$ and $b$ are constants and $E(x)$ is an error term that either tends to $0$ in…

Number Theory · Mathematics 2021-12-13 Greg Martin , Michael J. Mossinghoff , Timothy S. Trudgian

We show that for a Steinhaus random multiplicative function $f:\mathbb{N}\to\mathbb{D}$ and any polynomial $P(x)\in\mathbb{Z}[x]$ of $\text{deg}\ P\ge 2$ which is not of the form $w(x+c)^{d}$ for some $w\in \mathbb{Z}$, $c\in \mathbb{Q}$,…

Number Theory · Mathematics 2022-02-22 Oleksiy Klurman , Ilya D. Shkredov , Max Wenqiang Xu

We study \emph{unimodular fake} $\mu's$, i.e. multiplicative functions $\mathfrak f: \N \to \mathbb{S}^1 \cup \{0\} $ determined by a fixed sequence $\{\varepsilon_k\}_{k\ge 0} \subset \mathbb{S}^1 \, \cup \, \{0\}$ via the rule $\mathfrak…

Number Theory · Mathematics 2026-01-01 Ali Saraeb

A generalization of the max-plus transformation, which is known as a method to derive cellular automata from integrable equations, is proposed for complex numbers. Operation rules for this transformation is also studied for general number…

Exactly Solvable and Integrable Systems · Physics 2009-11-11 Tetsu Yajima , Keisuke Nakajima , Naruyoshi Asano

We apply the Euler--Maclaurin formula to find the asymptotic expansion of the sums $\sum_{k=1}^n (\log k)^p / k^q$, ~$\sum k^q (\log k)^p$, ~$\sum (\log k)^p /(n-k)^q$, ~$\sum 1/k^q (\log k)^p $ in closed form to arbitrary order ($p,q…

Combinatorics · Mathematics 2007-05-23 Daniel B. Grünberg

For the Fourier transform $\mathcal{F}\mu$ of a general (non-trivial) self-similar measure $\mu$ on the real line $\mathbb{R}$, we prove a large deviation estimate \[ \lim_{c\to +0} \varlimsup_{t\to \infty}\frac{1}{t}\log…

Dynamical Systems · Mathematics 2013-04-02 Masato Tsujii

We consider a strictly stationary and ergodic sequence of random elements taking values in some Hilbert space. Our target is to study the weak convergence of the discrete Fourier transforms under sharp conditions. As a side-result we obtain…

Probability · Mathematics 2015-12-07 Clément Cerovecki , Siegfried Hörmann

A famous conjecture of Chowla states that the Liouville function $\lambda(n)$ has negligible correlations with its shifts. Recently, the authors established a weak form of the logarithmically averaged Elliott conjecture on correlations of…

Number Theory · Mathematics 2019-05-16 Terence Tao , Joni Teräväinen

Denote by $p(k)$ the limit, as $n \rightarrow \infty$, of the probability that a random permutation on a set of size $n$ has an invariant set of size $k$. We give an asymptotic formula for $p(k)$, showing that it is asymptotically…

Combinatorics · Mathematics 2026-05-01 Ben Green , Mehtaab Sawhney

We completely classify Fourier summation formulas of the form $$ \int_{\mathbb{R}} \widehat{\varphi}(t) d\mu(t)=\sum_{n=0}^{\infty} a(\lambda_n)\varphi(\lambda_n), $$ that hold for any test function $\varphi$, where $\widehat\varphi$ is the…

Classical Analysis and ODEs · Mathematics 2025-04-04 Felipe Gonçalves , Guilherme Vedana

Let $ k,l \geq 2$ be natural numbers, and let $d_k,d_l$ denote the $k$-fold and $l$-fold divisor functions, respectively. We analyse the asymptotic behavior of the sum $\sum_{x<n\leq x+H_1}d_k(n)d_l(n+h)$. More precisely, let…

Number Theory · Mathematics 2025-03-06 Javier Pliego , Yu-Chen Sun , Mengdi Wang

A discrete Laplace transform and its inversion formula are obtained by using a quadrature of the continuous Fourier transform which is given in terms of Hermite polynomials and its zeros. This approach yields a convergent discrete formula…

Numerical Analysis · Mathematics 2007-05-23 Rafael G. Campos , Francisco Mejia

Let $p$ be a sufficiently large prime number, $r$ be any given positive integer. Suppose that $a_1,\,\dots,\,a_r$ are pairwise distinct and not zero modulo $p$. Let $N(a_1,\,\dots,\,a_r;\,p)$ denote the number of…

Number Theory · Mathematics 2020-11-11 Chaohua Jia

Let $<\P > \subset \N$ be a multiplicative subsemigroup of the natural numbers $\N = \{1,2,3,...\}$ generated by an arbitrary set $\P$ of primes (finite or infinite). We given an elementary proof that the partial sums $\sum_{n \in < \P >: n…

Number Theory · Mathematics 2009-10-05 Terence Tao

We obtain asymptotic formulas for the $2k$th moments of partially smoothed divisor sums of the M\"obius function. When $2k$ is small compared with $A$, the level of smoothing, then the main contribution to the moments come from integers…

Number Theory · Mathematics 2020-04-09 Andrew Granville , Dimitris Koukoulopoulos , James Maynard

Extensive studies of Boolean functions are carried in many fields. The Mobius transform is often involved for these studies. In particular, it plays a central role in coincident functions, the class of Boolean functions invariant by this…

Cryptography and Security · Computer Science 2015-07-21 Morgan Barbier , Hayat Cheballah , Jean-Marie Le Bars

Suppose that i.i.d. random variables $X_{1}, X_{2}, \ldots$ are chosen uniformly from $[0,1]$, and let $f: [0,1] \rightarrow [0,1]$ be an increasing bijection. Define $\mu_{f}$ to be the expected value of $f(X_{i})$ for each $i$. Define the…

Probability · Mathematics 2016-08-23 Jesse Geneson