Results 31 to 40 of about 167 (163)
Modular invariance, tauberian theorems and microcanonical entropy
We analyze modular invariance drawing inspiration from tauberian theorems. Given a modular invariant partition function with a positive spectral density, we derive lower and upper bounds on the number of operators within a given energy interval. They are
Baur Mukhametzhanov, Alexander Zhiboedav
doaj +1 more source
Some nonlinear Tauberian theorems [PDF]
In a forthcoming study of the n-body problem I have made use of the nonlinear Tauberian theorems obtained in this note. The symbol wc(x) represents a positive function, increasing for x >0. The symbols f, g, h represent functions which are of class C2 on (0, cm). The basic Theorem 1 is due to Boas [1]. THEOREM 1.
openaire +1 more source
In the classical Bayesian persuasion model, an informed player and an uninformed one engage in a static interaction. This work extends this classical model to a dynamic setting where the state of nature evolves according to a Markovian law, allowing for a more realistic representation of real‐world situations where the state of nature evolves over time.
Ehud Lehrer, Dimitry Shaiderman
wiley +1 more source
Numerical Computation of the Rosenblatt Distribution and Applications
ABSTRACT The Rosenblatt distribution plays a key role in the limit theorems for non‐linear functionals of stationary Gaussian processes with long‐range dependence. We derive new expressions for the characteristic function of the Rosenblatt distribution.
Nikolai N. Leonenko, Andrey Pepelyshev
wiley +1 more source
Singular Perturbation of Nonlinear Systems with Regular Singularity
We extend Balser‐Kostov method of studying summability properties of a singularly perturbed inhomogeneous linear system with regular singularity at origin to nonlinear systems of the form εzf′ = F(ε, z, f) with F a Cν‐valued function, holomorphic in a polydisc D-ρ×D-ρ×D-ρν.
Domingos H. U. Marchetti +2 more
wiley +1 more source
Euclidean algorithms are Gaussian over imaginary quadratic fields
Abstract We prove that the distribution of the number of steps of the Euclidean algorithm of rationals in imaginary quadratic fields with denominators bounded by N$N$ is asymptotically Gaussian as N$N$ goes to infinity, extending a result by Baladi and Vallée for the real case.
Dohyeong Kim, Jungwon Lee, Seonhee Lim
wiley +1 more source
Duals and Matrix Classes Involving Cesàro Type Classes of Sequences of Fuzzy Numbers
We first define Cesàro type classes of sequences of fuzzy numbers and equip the set with a complete metric. Then we compute the Köthe‐Toeplitz dual and characterize some related matrix classes involving such classes of sequences of fuzzy numbers.
Hemen Dutta +2 more
wiley +1 more source
Wiener Tauberian theorems for vector-valued functions
Different versions of Wiener's Tauberian theorem are discussed for the generalized group algebra L1(G,A) (of integrable functions on a locally compact abelian group G taking values in a commutative semisimple regular Banach algebra A) using A-valued ...
K. Parthasarathy, Sujatha Varma
doaj +1 more source
On the Exit Time of a Random Walk with Positive Drift [PDF]
We study a random walk with positive drift in the first quadrant of the plane. For a given connected region $\mathcal{C}$ of the first quadrant, we analyze the number of paths contained in $\mathcal{C}$ and the first exit time from $\mathcal{C}$.
Michael Drmota, Wojciech Szpankowski
doaj +1 more source
Simple Barban–Davenport–Halberstam type asymptotics for general sequences
Abstract We prove two estimates for the Barban–Davenport–Halberstam type variance of a general complex sequence in arithmetic progressions. The proofs are elementary, and our estimates are capable of yielding an asymptotic for the variance when the sequence is sufficiently nice, and is either somewhat sparse or is sufficiently like the integers in its ...
Adam J. Harper
wiley +1 more source

