English
Related papers

Related papers: The aliquot constant

200 papers

Take a centered random walk S_n and consider the sequence of its partial sums A_n = S_1 + ... + S_n. Suppose S_1 is in the domain of normal attraction of an \alpha-stable law with 1 < \alpha <= 2. Assuming that S_1 is either…

Probability · Mathematics 2012-03-19 Vladislav Vysotsky

This note presents an example of an increasing sequence $(\lambda_l)_{l=1}^\infty$ such that the maximal operators associated to normalized discrete spherical convolution averages \[ \sup_{l\geq…

Classical Analysis and ODEs · Mathematics 2018-09-20 Brian Cook

By modifying Beukers' proof of Apery's theorem that zeta(3) is irrational, we derive criteria for irrationality of Euler's constant, gamma. For n > 0, we define a double integral I(n) and a positive integer S(n), and prove that if d(n) =…

Number Theory · Mathematics 2007-05-23 Jonathan Sondow

We present lower estimates for the best constant appearing in the weak $(1,1)$ maximal inequality in the space $(\R^n,\|\cdot\|_{\iy})$. We show that this constant grows to infinity faster than $(\log n)^{1-o(1)}$ when $n$ tends to…

Classical Analysis and ODEs · Mathematics 2013-09-19 Guillaume Aubrun

For a bilinear map $*:\mathbb R^d\times \mathbb R^d\to \mathbb R^d$ of nonnegative coefficients and a vector $s\in \mathbb R^d$ of positive entries, among an exponentially number of ways combining $n$ instances of $s$ using $n-1$…

Discrete Mathematics · Computer Science 2021-04-22 Vuong Bui

We obtain two sequences of rational numbers which converge to the Euler-Gompertz constant. Denote by <f(x)> the integral of f(x)e^{-x} from 0 to infinity. Recall that the Euler-Gompertz constant \delta is <ln(x+1)>. Main idea. Let P_n(x) be…

Number Theory · Mathematics 2011-11-11 Vasily Bolbachan

In a uniform random recursive k-dag, there is a root, 0, and each node in turn, from 1 to n, chooses k uniform random parents from among the nodes of smaller index. If S_n is the shortest path distance from node n to the root, then we…

Probability · Mathematics 2015-05-13 Luc Devroye , Svante Janson

Let $f(x)$ be the product of several linear polynomials with integer coefficients. In this paper, we obtain the estimate: $\log {\rm lcm}(f(1), ..., f(n))\sim An$ as $n\rightarrow\infty $, where $A$ is a constant depending on $f$.

Number Theory · Mathematics 2012-06-26 Shaofang Hong , Guoyou Qian , Qianrong Tan

Let $\lambda(n)$ denote the exponent of the multiplicative group modulo $n$. We show that when $q$ is odd, each coprime residue class modulo $q$ is hit equally often by $\lambda(n)$ as $n$ varies. Under the stronger assumption that…

Number Theory · Mathematics 2023-03-27 Paul Pollack

Let $\sigma(n)$ be the sum of the positive divisors of $n$, and let $A(t)$ be the natural density of the set of positive integers $n$ satisfying $\sigma(n)/n \ge t$. We give an improved asymptotic result for $\log A(t)$ as $t$ grows…

Number Theory · Mathematics 2010-11-19 Andreas Weingartner

We study the central limit theorem in the non-normal domain of attraction to symmetric $\alpha$-stable laws for $0<\alpha\leq2$. We show that for i.i.d. random variables $X_i$, the convergence rate in $L^\infty$ of both the densities and…

Probability · Mathematics 2018-04-24 Christoph Börgers , Claude Greengard

Let $f$ be a half-integral weight cusp form of level $4N$ for odd and squarefree $N$ and let $a(n)$ denote its $n^{\rm th}$ normalized Fourier coefficient. Assuming that all the coefficients $a(n)$ are real, we study the sign of $a(n)$ when…

Number Theory · Mathematics 2020-07-14 Corentin Darreye

We show that there is an absolute constant $c>0$ such that $|A+\lambda\cdot A|\geq e^{c\sqrt{\log |A|}}|A|$ for any finite subset $A$ of $\mathbb{R}$ and any transcendental number $\lambda\in\mathbb{R}$. By a construction of Konyagin and…

Combinatorics · Mathematics 2023-04-11 David Conlon , Jeck Lim

We show that for integers $n$, whose ratios of consecutive divisors are bounded above by an arbitrary constant, the normal order of the number of prime factors is $C \log \log n$, where $C=(1-e^{-\gamma})^{-1} = 2.280...$ and $\gamma$ is…

Number Theory · Mathematics 2021-11-15 Andreas Weingartner

Let $A_1$ and $A_2$ be randomly chosen subsets of the first $n$ integers of cardinalities $s_2\geq s_1 = \Omega(s_2)$, such that their sumset $A_1+A_2$ has size $m$. We show that asymptotically almost surely $A_1$ and $A_2$ are almost fully…

Combinatorics · Mathematics 2023-01-31 Marcelo Campos , Matthew Coulson , Oriol Serra , Maximilian Wötzel

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

Optimization and Control · Mathematics 2019-07-02 Thomas Kerdreux , Igor Colin , Alexandre d'Aspremont

Let $(X_n)_{n\in \mathbb{N}}$ be a sequence of i.i.d. random variables with distribution $\mathbb P(X_1=1)=\mathbb P(X_1=-1)=1/2$. Let $F(\sigma)=\sum_{n=1}^\infty X_nn^{-\sigma}$. We prove that the following holds almost surely…

Probability · Mathematics 2020-08-14 Marco Aymone , Susana Frómeta , Ricardo Misturini

We study the series s(n,x) which is the sum for k from 1 to n of the square of the sine of the product x Gamma(k)/k, where x is a variable. By Wilson's theorem we show that the integer part of s(n,x) for x = Pi/2 is the number of primes…

Number Theory · Mathematics 2018-09-11 Alain Connes

Fix a strong rectangulation pattern $P$ of size $L$. We show that the growth constant of the class of strong rectangulations avoiding $P$ is strictly smaller than $\Lambda =27/2$, the growth constant for all strong rectangulations. More…

Combinatorics · Mathematics 2025-12-01 Kaoru Sano

Let $t$ be random and uniformly distributed in the interval $[T,2T]$, and consider the quantity $N(t+1/\log T) - N(t)$, a count of zeros of the Riemann zeta function in a box of height $1/\log T$. Conditioned on the Riemann hypothesis, we…

Number Theory · Mathematics 2017-09-14 Brad Rodgers