Related papers: Between the LIL and the LSL

Let $s_1, s_2, \ldots$ be the sequence of positive integers, arranged in increasing order, that are representable by any binary quadratic form of fixed discriminant $D$. We show that \[ \limsup_{n \rightarrow \infty} \frac{s_{n+1}-s_n}{\log…

Chung and Graham [J. London Math. Soc. 1983] claimed to prove that there exists an $n$-vertex graph $G$ with $ \frac{5}{2}n \log_2 n + O(n)$ edges that contains every $n$-vertex tree as a subgraph. Frati, Hoffmann and T\'oth [Combin.…

We study logarithmic integrals of the form $\int_0^1 x^i\ln^n(x)\ln^m(1-x)dx$. They are expressed as a rational linear combination of certain rational numbers $(n,m)_i$, which we call tiered binomial coefficients, and products of the zeta…

Let $X$, $X_1$, $X_2$, $...$ be i.i.d. random variables, and let $S_n=X_1+... + X_n$ be the partial sums and $M_n=\max_{k\le n}|S_k|$ be the maximum partial sums. We give the sufficient and necessary conditions for a kind of limit theorems…

We consider a stochastic directed graph on the integers whereby a directed edge between $i$ and a larger integer $j$ exists with probability $p_{j-i}$ depending solely on the distance between the two integers. Under broad conditions, we…

A law of the iterated logarithm is established for the last passage times of directed percolation on rectangles in the plane over exponential or geometric independent random variables, rescaled to converge to the Tracy-Widom distribution.…

The law of the iterated logarithm for partial sums of weakly dependent processes was intensively studied by Walter Philipp in the late 1960s and 1970s. In this paper, we aim to extend these results to nondegenerate U-statistics of data that…

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…

Let $\lambda$ be the Liouville function, defined as $\lambda(n) := (-1)^{\Omega(n)}$ where $\Omega(n)$ is the number of prime factors of $n$ with multiplicity. In 2021, Helfgott and Radziwi{\l}{\l} proved that $$\sum_{n\leq x} \frac{1}{n}…

For a set $A$ of integers, the sumset $lA =A+...+A$ consists of those numbers which can be represented as a sum of $l$ elements of $A$ $$lA =\{a_1+... a_l| a_i \in A_i \}. $$ A closely related and equally interesting notion is that of…

We prove that the number of edges of a multigraph $G$ with $n$ vertices is at most $O(n^2\log n)$, provided that any two edges cross at most once, parallel edges are noncrossing, and the lens enclosed by every pair of parallel edges in $G$…

For integers $l \geq 2$, $d \geq 1$ we study (undirected) graphs with vertices $1, ..., n$ such that the vertices can be partitioned into $l$ parts such that every vertex has at most $d$ neighbours in its own part. The set of all such…

It is shown that two conjectures put forward in the recent article Iksanov and Kostohryz (2025) are true. Namely, we prove a functional central limit theorem (FCLT) and a law of the iterated logarithm (LIL) for a random Dirichlet series…

We prove distributional limit theorems and one-sided laws of the iterated logarithm for a class of positive, mixing, stationary, stochastic processes which contains those obtained from non-integrable observables over certain piecewise…

Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set $[N]=\{1,2,\hdots,N\}$ was one of the famous open problems in combinatorial discrepancy theory for a long time. An extension of this classical hypergraph…

In the 1960's, Erd\H{o}s and Gallai conjectured that the edges of any $n$-vertex graph can be decomposed into $O(n)$ cycles and edges. We improve upon the previous best bound of $O(n\log\log n)$ cycles and edges due to Conlon, Fox and…

We realize any submultiplicative increasing function which is equivalent to a polynomial proportion of itself as the growth function of a finitely generated simple Lie algebra. As an application, we resolve two open problems posed by…

By using the strong approximation, this paper establishes several limit results on the convergent rate of a infinite series of probabilities on the other law of iterated logarithm.

We propose a simple model of columnar growth through {\it diffusion limited aggregation} (DLA). Consider a graph $G_N\times\N$, where the basis has $N$ vertices $G_N:=\{1,\dots,N\}$, and two vertices $(x,h)$ and $(x',h')$ are adjacent if…

We improve the quantitative estimate for Roth's theorem on three-term arithmetic progressions, showing that if $A\subset\{1,\ldots,N\}$ contains no non-trivial three-term arithmetic progressions then $\lvert A\rvert\ll N(\log\log N)^4/\log…