Related papers: Arnol'd's limit and the Lagrange inversion
Relaxation theorems which apply to one, two and three-dimensional nonlinear elasticity are proved. We take into account the fact an infinite amount of energy is required to compress a finite line, surface or volume into zero line, surface…
In our previous paper \cite{FTD1}, we derived the almost sure convergence of the global density of eigenvalues of random matrices of the SYK model. In this paper, we will prove the central limit theorem for the linear statistic of…
We review our recent results on the on-shell description of sine-Gordon model with integrable boundary conditions. We determined the spectrum of boundary states by closing the boundary bootstrap and gave a derivation of Al.B.…
We consider a basic $d$-adic model for the scattering transform on the line. We prove $L^2$ bounds for this scattering transform and a weak $L^2$ bound for a Carleson type maximal operator. The latter implies boundedness of $d$-adic models…
We study the small-mass (overdamped) limit of Langevin equations for a particle in a potential and/or magnetic field with matrix-valued and state-dependent drift and diffusion. We utilize a bootstrapping argument to derive a hierarchy of…
A proof of the continuous martingale convergence theorem is provided. It relies on a classical martingale inequality and the almost sure convergence of a uniformly bounded non-negative super-martingale, after a truncation argument.
We introduce the notion of p-adic equiangular lines and derive the first fundamental relation between common angle, dimension of the space and the number of lines. More precisely, we show that if $\{\tau_j\}_{j=1}^n$ is p-adic…
We prove the precise inversion of adjunction formula for quotient singularities. As an application, we prove the semi-continuity of minimal log discrepancies for hyperquotient singularities. This paper is a continuation of arXiv:2011.07300,…
The angular resolution of a planar straight-line drawing of a graph is the smallest angle formed by two edges incident to the same vertex. Garg and Tamassia (ESA '94) constructed a family of planar graphs with maximum degree $d$ that have…
Let S(1) be the segment [-1,1], and define the segments S(n) recursively in the following manner: let S(n+1) be the intersection of S(n) and a(n+1) + S(1), where the point a(n+1) is chosen randomly on the segment S(n) with uniform…
For a natural extension of the circular unitary ensemble of order n, we study as n tends to infinity, the asymptotic behavior of the sequence of orthogonal polynomials with respect to the spectral measure. The last term of this sequence is…
Let B be a p-uniformly convex Banach space, with p >= 2. Let T be a linear operator on B, and let A_n x denote the ergodic average (1 / n) sum_{i< n} T^n x. We prove the following variational inequality in the case where T is power bounded…
The well-known Leibniz theorem (Leibniz Criterion or alternating series test) of convergence of alternating series is generalized for the case when the absolute value of terms of series are "not absolutely monotonously" convergent to zero.…
We prove a central limit theorem for the normalized overlap between two replicas in the spherical SK model in the high temperature phase. The convergence holds almost surely with respect to the disorder variables, and the inverse…
We prove a central limit theorem for Birkhoff sums of the Rosen continued fraction algorithm. A Lasota-Yorke bound is obtained for general one-dimensional continued fractions with the bounded variation space, which implies quasi-compactness…
The classic arcsine law for the number $N_{n}^{>}:=n^{-1}\sum_{k=1}^{n}\mathbf{1}_{\{S_{k}>0\}}$ of positive terms, as $n\to\infty$, in an ordinary random walk $(S_{n})_{n\ge 0}$ is extended to the case when this random walk is governed by…
We determine the Lagrange function in Taylor polynomial approximation by solving an appropriate initial-value problem. Hence, we determine the remainder term which we then approximate by means of a natural cubic spline. This results in a…
We prove a central limit theorem for a certain class of functions on sparse rank-one inhomogeneous random graphs endowed with additional i.i.d. edge and vertex weights. Our proof of the central limit theorem uses a perturbative form of…
We present an analysis of ensemble Kalman inversion, based on the continuous time limit of the algorithm. The analysis of the dynamical behaviour of the ensemble allows us to establish well-posedness and convergence results for a fixed…
We show that several classes of ordered structures (namely, convex linear orders, layered permutations, and compositions) admit first-order logical limit laws.