English
Related papers

Related papers: Multiplicative functions in short arithmetic progr…

200 papers

Soft extrapolation refers to the problem of recovering a function from its samples, multiplied by a fast-decaying window and perturbed by an additive noise, over an interval which is potentially larger than the essential support of the…

Numerical Analysis · Mathematics 2018-12-26 Dmitry Batenkov , Laurent Demanet , Hrushikesh N. Mhaskar

We present the first mini-batch algorithm for maximizing a non-negative monotone decomposable submodular function, $F=\sum_{i=1}^N f^i$, under a set of constraints. We consider two sampling approaches: uniform and weighted. We first show…

Machine Learning · Computer Science 2024-10-03 Gregory Schwartzman

Let $f: B^n \rightarrow {\mathbb R}$ be a $d+1$ times continuously differentiable function on the unit ball $B^n$, with $\max_{z\in B^n} |f(z)|=1$. A well-known fact is that if $f$ vanishes on a set $Z\subset B^n$ with a non-empty interior,…

Classical Analysis and ODEs · Mathematics 2024-02-05 Gil Goldman , Yosef Yomdin

Let $r,\,f$ be multiplicative functions with $r\geqslant 0$, $f$ is complex valued, $|f|\leqslant r$, and $r$ satisfies some standard growth hypotheses. Let $x$ be large, and assume that, for some real number $\tau$, the quantities…

Number Theory · Mathematics 2025-12-19 Gérald Tenenbaum

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 examine the conditions under which the sum of random multiplicative functions in short intervals, given by $\sum_{x<n \leqslant x+y} f(n)$, exhibits the phenomenon of \textit{better than square-root cancellation}. We establish that the…

Number Theory · Mathematics 2024-02-12 Rachid Caich

Let $q\geq 3$, $2\leq r\leq \phi(q)$ and $a_1,...,a_r$ be distinct residue classes modulo $q$ that are relatively prime to $q$. Assuming the Generalized Riemann Hypothesis and the Grand Simplicity Hypothesis, M. Rubinstein and P. Sarnak…

Number Theory · Mathematics 2011-08-30 Youness Lamzouri

We establish uniform bounds on the multiplicities of irreducible admissible representations appearing in spaces of functions on symmetric spaces over $p$-adic fields. These multiplicities can exceed one and depend intricately on the group,…

Representation Theory · Mathematics 2026-04-21 Shahar Dagan

In this paper we give a short interval version of the Balog-Ruzsa theorem concerning bounds for the $L_1$ norm of the exponential sum over $r$-free numbers. As an application, we give a lower bound for the $L_1$ norm of the exponential sum…

Number Theory · Mathematics 2022-04-29 Yu-Chen Sun

We evaluate asymptotically the variance of the number of squarefree integers up to $x$ in short intervals of length $H < x^{6/11 - \varepsilon}$ and the variance of the number of squarefree integers up to $x$ in arithmetic progressions…

Number Theory · Mathematics 2024-10-15 Ofir Gorodetsky , Kaisa Matomäki , Maksym Radziwiłł , Brad Rodgers

We find a new approach to computing the remainder of a polynomial modulo $x^n-1$; such a computation is called modular enumeration. Given a polynomial with coefficients from a commutative $\mathbb{Q}$-algebra, our first main result…

Combinatorics · Mathematics 2014-03-06 William Kuszmaul

A class of radial, polynomial cutoff functions $f_{\textrm{c}n}(r)$ for short-ranged pair potentials or related expressions is proposed. Their derivatives up to order $n$ and $n+1$ vanish at the outer cutoff $r_\textrm{c}$ and an inner…

Materials Science · Physics 2022-04-29 Martin H. Müser

For any large prime $q$, $1 \leq x \leq q$ and any real $0 \leq k \leq 1$, we prove an upper bound for the following $2k$-th moment $$\displaystyle \sum_{\substack{\chi \bmod q}} \Big| \sum_{n\leq x} \chi(n)\lambda(n)\Big|^{2k},$$ where…

Number Theory · Mathematics 2025-12-08 Peng Gao , Xiaosheng Wu

Avikainen showed that, for any $p,q \in [1,\infty)$, and any function $f$ of bounded variation in $\mathbb{R}$, it holds that $\mathbb{E}[|f(X)-f(\widehat{X})|^{q}] \leq C(p,q) \mathbb{E}[|X-\widehat{X}|^{p}]^{\frac{1}{p+1}}$, where $X$ is…

Probability · Mathematics 2020-11-30 Dai Taguchi , Akihiro Tanaka , Tomooki Yuasa

We study multiplier theorems on a vector-valued function space, which is a generalization of the results of Calder\'on-Torchinsky and Grafakos-He-Honz\'ik-Nguyen, and an improvement of the result of Triebel. For $0<p<\infty$ and $0<q\leq…

Classical Analysis and ODEs · Mathematics 2021-03-12 Bae Jun Park

We prove some improvements of the classical Weil bound for one variable additive and multiplicative character sums associated to a polynomial over a finite field $k=\Fq$ for two classes of polynomials which are invariant under a large…

Number Theory · Mathematics 2010-10-04 Antonio Rojas-León

Let $L_n(k)$ denote the least common multiple of $k$ independent random integers uniformly chosen in $\{1,2,\ldots ,n\}$. In this note, using a purely probabilistic approach, we derive a criterion for the convergence in distribution as…

Probability · Mathematics 2019-11-11 Alin Bostan , Alexander Marynych , Kilian Raschel

In this paper we prove new upper bounds for the sum $\sum_{n=a+1}^{a+N}f(n)$, for a certain class of arithmetic functions $f$. Our results improve the previous results of G. Bachman and L. Rachakonda.

Number Theory · Mathematics 2011-07-05 Dmitriy Frolenkov

We obtain a non--trivial upper bound for the multiplicative energy of any sufficiently large subset of a subvariety of a finite algebraic group. We also find some applications of our results to growth of conjugates classes, estimates of…

Combinatorics · Mathematics 2021-01-26 Ilya D. Shkredov

We consider the following multiplication-based tests to check if a given function $f: \mathbb{F}_q^n\to \mathbb{F}_q$ is a codeword of the Reed-Muller code of dimension $n$ and order $d$ over the finite field $\mathbb{F}_q$ for prime $q$…

Computational Complexity · Computer Science 2020-01-01 Prahladh Harsha , Srikanth Srinivasan
‹ Prev 1 8 9 10 Next ›