English
Related papers

Related papers: Random multiplicative functions and typical size o…

200 papers

We establish an asymptotic formula for the logarithmic mean value of a 1-bounded multiplicative function that is sharp in many cases of interest. We derive from it a variety of applications, making progress on several old problems. As a…

Number Theory · Mathematics 2026-04-09 Oleksiy Klurman , Alexander P. Mangerel

This paper presents a lower bound for optimizing a finite sum of $n$ functions, where each function is $L$-smooth and the sum is $\mu$-strongly convex. We show that no algorithm can reach an error $\epsilon$ in minimizing all functions from…

Machine Learning · Statistics 2015-10-06 Alekh Agarwal , Leon Bottou

We consider partial sums of a weighted Steinhaus random multiplicative function and view this as a model for the Riemann zeta function. We give a description of the tails and high moments of this object. Using these we determine the likely…

Number Theory · Mathematics 2020-12-23 Marco Aymone , Winston Heap , Jing Zhao

Let $M(\chi)$ denote the maximum of $|\sum_{n\le N}\chi(n)|$ for a given non-principal Dirichlet character $\chi \pmod q$, and let $N_\chi$ denote a point at which the maximum is attained. In this article we study the distribution of…

Number Theory · Mathematics 2020-06-29 Jonathan Bober , Leo Goldmakher , Andrew Granville , Dimitris Koukoulopoulos

For completely multiplicative functions f(n) taking values 1 and -1, under certain conditions on f(n) we show that f(n) changes sign at least x exp(-7(log log x)sqrt(log x)) times as n runs through the integers <= x.

Number Theory · Mathematics 2007-05-23 Ernie Croot

We study randomized algorithms for constrained optimization, in abstract frameworks that include, in strictly increasing generality: convex programming; LP-type problems; violator spaces; and a setting we introduce, consistent spaces. Such…

Computational Geometry · Computer Science 2019-06-04 Kenneth L. Clarkson , Bernd Gärtner , Johannes Lengler , May Szedlak

An integer is said to be $y$-friable if its greatest prime factor P(n) is less than $y$. In this paper, we study numbers of the shape $n-1$ when $P(n)\leq y$ and $n\leq x$. One expects that, statistically, their multiplicative behaviour…

Number Theory · Mathematics 2015-04-22 Sary Drappeau

We introduce and study a new complexity function in combinatorics on words, which takes into account the smallest second occurrence time of a factor of an infinite word. We characterize the eventually periodic words and the Sturmian words…

Number Theory · Mathematics 2017-08-24 Yann Bugeaud , Dong Han Kim

We study approximation in the unit interval by rational numbers whose numerators are selected randomly with certain probabilities. Previous work showed that an analogue of Khintchine's Theorem holds in a similar random model and raised the…

Number Theory · Mathematics 2019-09-17 Laima Kaziulytė , Felipe A. Ramírez

We propose a modification to the random destruction of graphs: Given a finite network with a distinguished set of sources and targets, remove (cut) vertices at random, discarding components that do not contain a source node. We investigate…

Probability · Mathematics 2022-01-05 Fabian Burghart

Let $f(n)$ be a random completely multiplicative function such that $f(p) = \pm 1$ with probabilities $1/2$ independently at each prime. We study the conditional probability, given that $f(p) = 1$ for all $p < y$, that all partial sums of…

Number Theory · Mathematics 2025-12-19 Petr Kucheriaviy

Let $\chi=\chi_q$ be a primitive character mod $q$ and fix $\Delta>0$. In 1989 Graham and Ringrose gave strong bounds on character sums $\sum_{M<n\leq M+N} \chi(n)$ in intervals of length $N=q^\Delta$ whenever $q$ is squarefree and is…

Number Theory · Mathematics 2026-01-19 Todd Cochrane , Andrew Granville , Junren Zheng

We show that the truncated simplex Hilbert transform enjoys some cancellation in the sense that its norm grows sublinearly in the number of scales retained in the truncation. This extends the recent result by Tao on cancellation for the…

Classical Analysis and ODEs · Mathematics 2018-03-13 Pavel Zorin-Kranich

Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…

Algebraic Geometry · Mathematics 2014-02-19 Grigoriy Blekherman , João Gouveia , James Pfeiffer

In this paper we prove lower bounds for sizes of refutations of unsatisfiable vector Subset Sum instances $\overrightarrow{a}_1 x_1 + \dots + \overrightarrow{a}_n x_n = \overrightarrow{b}$ in the proof system Res(lin$_{\mathbb{F}_q}$) where…

Computational Complexity · Computer Science 2026-04-23 Fedor Part

Let $k$ and $n$ be positive integers, $n>k$. Define $r(n,k)$ to be the minimum positive value of $$ |\sqrt{a_1} + ... + \sqrt{a_k} - \sqrt{b_1} - >... -\sqrt{b_k} | $$ where $ a_1, a_2, ..., a_k, b_1, b_2, ..., b_k $ are positive integers…

Computational Geometry · Computer Science 2007-05-23 Qi Cheng

In this paper we consider the normalized lengths of the factors of some factorizations of random words. First, for the \emph{Lyndon factorization} of finite random words with $n$ independent letters drawn from a finite or infinite totally…

Probability · Mathematics 2021-11-05 Elahe Zohoorian Azad , Philippe Chassaing

The average properties of the well-known Subset Sum Problem can be studied by the means of its randomised version, where we are given a target value $z$, random variables $X_1, \ldots, X_n$, and an error parameter $\varepsilon > 0$, and we…

Let $\lambda$ denote the Liouville function. We show that as $X \rightarrow \infty$, $$ \int_{X}^{2X} \sup_{\alpha} \left | \sum_{x < n \leq x + H} \lambda(n) e(-\alpha n) \right | dx = o ( X H) $$ for all $H \geq X^{\theta}$ with $\theta >…

Number Theory · Mathematics 2018-12-05 Kaisa Matomäki , Maksym Radziwiłł , Terence Tao

Let $f$ be a Steinhaus random multiplicative function, and for $\alpha\in \mathbb{R}$, let $d_\alpha$ denote the $\alpha$-divisor function. For $\alpha \in (1,2)$ we establish that $$ \mathbb{E}\bigg\{\Big|\frac{1}{\sqrt{x}}\sum_{n\leq x}…

Number Theory · Mathematics 2026-04-08 Jad Hamdan
‹ Prev 1 3 4 5 6 7 10 Next ›