Results 101 to 110 of about 1,648,333 (245)

Moderate Deviation Principles for Lacunary Trigonometric Sums

Mathematische Nachrichten, Volume 299, Issue 5, Page 1028-1044, May 2026.
ABSTRACT Classical works of Kac, Salem, and Zygmund, and Erdős and Gál have shown that lacunary trigonometric sums despite their dependency structure behave in various ways like sums of independent and identically distributed random variables. For instance, they satisfy a central limit theorem (CLT) and a law of the iterated logarithm.
Joscha Prochno, Marta Strzelecka
wiley   +1 more source

Padé Approximations and Irrationality Measures on Values of Confluent Hypergeometric Functions

Mathematics
Padé approximations are approximations of holomorphic functions by rational functions. The application of Padé approximations to Diophantine approximations has a long history dating back to Hermite. In this paper, we use the Maier–Chudnovsky construction
Jiaxin Hu, Chenglong Yu, Kangyun Zhou
doaj   +1 more source

On the exceptional set in Littlewood's discrete conjecture

Bulletin of the London Mathematical Society, Volume 58, Issue 5, May 2026.
Abstract We consider a discrete analogue of the well‐known Littlewood conjecture on Diophantine approximations and obtain a strong upper bound for the number of exceptional vectors in this conjecture.
I. D. Shkredov
wiley   +1 more source

Diophantine approximation and automorphic spectrum

, 2012
This paper establishes quantitative estimates on the rate of diophantine approximation in homogeneous varieties of semisimple algebraic groups. The estimates established generalize and improve previous ones, and in a number of important cases are shown ...
Nevo, Amos, Gorodnik, A, Ghosh, A, Gorodnik, Alexander, Ghosh, Anish, Nevo, A   +5 more
core   +1 more source

Double‐jump phase transition for the reverse Littlewood–Offord problem

Journal of the London Mathematical Society, Volume 113, Issue 5, May 2026.
Abstract Erdős conjectured in 1945 that for any unit vectors v1,…,vn$v_1, \ldots, v_n$ in R2$\mathbb {R}^2$ and signs ε1,…,εn$\varepsilon _1, \ldots, \varepsilon _n$ taken independently and uniformly in {−1,1}$\lbrace -1,1\rbrace$, the random Rademacher sum σ=ε1v1+⋯+εnvn$\sigma = \varepsilon _1 v_1 + \cdots + \varepsilon _n v_n$ satisfies ∥σ∥2⩽1$\Vert \
Lawrence Hollom, Julien Portier, Victor Souza   +2 more
wiley   +1 more source

A Diophantine approximation problem with two primes and one k-th power of a prime [PDF]

Journal of Number Theory, 2017
We refine a result of the last two Authors of [8] on a Diophantine approximation problem with two primes and a $k$-th power of a prime which was only proved to hold for ...
Alessandro Gambini, A. Languasco, A. Zaccagnini   +2 more
semanticscholar   +1 more source

Sums of three positive cubes

Journal of the London Mathematical Society, Volume 113, Issue 5, May 2026.
Abstract We survey ideas surrounding the study of the number of integers that can be represented as the sum of three positive cubes. We focus on the early contribution of Davenport using elementary techniques, and the subsequent developments due to Vaughan, which introduced Fourier analysis and mirrored many of the important developments of the Hardy ...
James Maynard
wiley   +1 more source

Dynamical Systems and Diophantine Approximation

, 2009
On the 7th, 8th and 9th June 2004 has been held at the Institut Henri Poincaré a conference on ''Dynamical systems and Diophantine approximation''. One of the aims of this conference was to give a survey of research tools at the interface between these ...
Dal'Bo-Milonet, Françoise, Bugeaud, Yann, Drutu, Cornelia   +2 more
core   +4 more sources

Diophantine approximations and convergence of series in Banach spaces

Le Matematiche, 1993
n this paper we give a new proof of a known diophantine approximation result, then we apply this to prove convergence of a class of series in a Banach space, whose terms are defined recursively.
Giovanni Fiorito, Rosario Musmeci, Mario Strano   +2 more
doaj  

PKCHD: Towards a Probabilistic Knapsack Public-Key Cryptosystem with High Density

Information, 2019
By introducing an easy knapsack-type problem, a probabilistic knapsack-type public key cryptosystem (PKCHD) is proposed. It uses a Chinese remainder theorem to disguise the easy knapsack sequence. Thence, to recover the trapdoor information, the implicit
Yuan Ping, Baocang Wang, Shengli Tian, Jingxian Zhou, Hui Ma   +4 more
doaj   +1 more source