Results 51 to 60 of about 268 (182)

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

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

Padovan numbers which are concatenations of three Padovan or Perrin numbers [PDF]

Notes on Number Theory and Discrete Mathematics
This paper presents all Padovan numbers that can be written as the concatenation of three Padovan or Perrin numbers under a certain constraint. Namely, we consider the Diophantine equations Pₜ=10ᵈ⁺ˡPₘ+10ˡPₙ+Pᵣ and Pₜ=10ᵈ⁺ˡRₘ+10ˡRₙ+Rᵣ, where k,m,n,r,d and
Fatih Erduvan
doaj   +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

Random Diophantine equations in the primes II

Journal of the London Mathematical Society, Volume 113, Issue 5, May 2026.
Abstract Let d⩾2$d\geqslant 2$ and n⩾d$n\geqslant d$ with (d,n)∉{(2,2),(3,3)}$(d,n)\notin \lbrace (2,2),(3,3)\rbrace$. We consider homogeneous Diophantine equations of degree d$d$ in n+1$n+1$ variables and whether they have solutions in the primes.
Philippa Holdridge
wiley   +1 more source

Applying Infinite Petri Nets to the Cybersecurity of Intelligent Networks, Grids and Clouds

Applied Sciences, 2021
Correctness of networking protocols represents the principal requirement of cybersecurity. Correctness of protocols is established via the procedures of their verification. A classical communication system includes a pair of interacting systems.
Dmitry A. Zaitsev, Tatiana R. Shmeleva, David E. Probert   +2 more
doaj   +1 more source

Tessellation Groups, Harmonic Analysis on Non‐Compact Symmetric Spaces and the Heat Kernel in View of Cartan Convolutional Neural networks

Fortschritte der Physik, Volume 74, Issue 4, April 2026.
ABSTRACT In this paper, we continue the development of the Cartan neural networks programme, launched with three previous publications, by focusing on some mathematical foundational aspects that we deem necessary for our next steps forward. The mathematical and conceptual results are diverse and span various mathematical fields, but the inspiring ...
Pietro Fré, Federico Milanesio, Marcelo Oyarzo, Matteo Santoro, Mario Trigiante   +4 more
wiley   +1 more source

Solving the n $n$‐Player Tullock Contest

Journal of Public Economic Theory, Volume 28, Issue 2, April 2026.
ABSTRACT The n $n$‐player Tullock contest with complete information is known to admit explicit solutions in special cases, such as (i) homogeneous valuations, (ii) constant returns, and (iii) two contestants. But can the model be solved more generally?
Christian Ewerhart
wiley   +1 more source

GCD inequalities arising from codimension‐2 blowups

Bulletin of the London Mathematical Society, Volume 58, Issue 4, April 2026.
Abstract Assuming a deep Diophantine geometry conjecture by Vojta, Silverman proved an inequality giving an upper bound for the greatest common divisor (GCD). In this paper, we unconditionally prove a weaker version of this inequality. The main ingredient is the Ru–Vojta theory, which provides an efficient method of using Schmidt subspace theorem.
Yu Yasufuku
wiley   +1 more source

Multivariate discrete splines and linear Diophantine equations [PDF]

Transactions of the American Mathematical Society, 1993
In this paper we investigate the algebraic properties of multivariate discrete splines. It turns out that multivariate discrete splines are closely related to linear diophantine equations. In particular, we use a solvability condition for a system of linear diophantine equations to obtain a necessary and sufficient condition for the integer translates ...
openaire   +1 more source