Related papers: Bounds on the Lambert function and their applicati…
The explicit semiclassical treatment of logarithmic perturbation theory for the nonrelativistic bound states problem is developed. Based upon $\hbar$-expansions and suitable quantization conditions a new procedure for deriving perturbation…
In this paper, new probability bounds are derived for algebraic lattice codes. This is done by using the Dedekind zeta functions of the algebraic number fields involved in the lattice constructions. In particular, it is shown how to upper…
We analyze two sets of specific functions, that/which form the basis of the nonpower asymptotic expansions both in the timelike and spacelike regions for single scale dependent QCD observables in the Shirkov--Solovtsov's Analytic…
Electroweak precision data at LEP are used to place bounds on some $\lambda'$-type ($L$-violating) and $\lambda''$-type ($B$-violating) $R$-parity violating supersymmetric Yukawa couplings. We consider one-loop corrections (triangles and…
Explicit analytic expressions are derived for the effective-range function for the case when the interaction is represented by a sum of the short-range square-well and long-range Coulomb potentials. These expressions are then transformed…
We establish quantum dynamical lower bounds for discrete one-dimensional Schr\"odinger operators in situations where, in addition to power-law upper bounds on solutions corresponding to energies in the spectrum, one also has lower bounds…
Building on a work by Alm, we consider a model of weighted self-avoiding walks on a lattice and develop a method for computing upper bounds on the corresponding weighted connective constant, which we implement in a publicly available…
The Lee-Wick (LW) formulation of higher-derivative theories can be extended from one in which the extra degrees of freedom are represented as a single heavy, negative-norm partner for each known particle (N=2), to one in which a second,…
We generalize the fractional variational problem by allowing the possibility that the lower bound in the fractional derivative does not coincide with the lower bound of the integral that is minimized. Also, for the standard case when these…
The paper presents an improved upper bound (achievability result) on the optimal tradeoff between Normalized Delivery Time (NDT) and computation load for distributed computing MapReduce systems in certain ranges of the parameters. The upper…
We study a nonlinear equation with an elliptic operator having degenerate coercivity. We prove the existence of a W^{1,1}_0 solution which is distributional or entropic, according to the growth assumptions on a lower order term in…
In this paper we present a new perspective on error analysis of Legendre approximations for differentiable functions. We start by introducing a sequence of Legendre-Gauss-Lobatto polynomials and prove their theoretical properties, such as…
For any Calder\'on-Zygmund operator $ T$, any weight $ w$, and $ \alpha >1$, the operator $ T$ is bounded as a map from $ L ^{1} (M _{ L \log\log L (\log\log\log L) ^{\alpha } } w )$ into weak-$L^1(w)$. The interest in questions of this…
In recent years, the application of artificial intelligence (AI) in wireless communications has demonstrated inherent robustness against wireless channel distortions. Most existing works empirically leverage this robustness to yield…
In this paper we obtain an approximation for the multivariate Laplace's integral with a large parameter and estimate error term for two cases, when the maximum of the exponent is in the interior of the domain and on the boundary. We are…
This letter proposes the use of saddle point approximation (SPA) to evaluate the outage probability of wireless cellular networks. Unlike traditional numerical integration-based approaches, the SPA approach relies on cumulant generating…
We develop a new technique for proving cell-probe lower bounds on dynamic data structures. This technique enables us to prove an amortized randomized Omega(lg n) lower bound per operation for several data structural problems on n elements,…
Characterising the capacity region for a network can be extremely difficult, especially when the sources are dependent. Most existing computable outer bounds are relaxations of the Linear Programming bound. One main challenge to extend…
In many high-dimensional problems,polynomial-time algorithms fall short of achieving the statistical limits attainable without computational constraints. A powerful approach to probe the limits of polynomial-time algorithms is to study the…
We examine the theoretical properties of the index of agreement loss function $L_W$, the negatively oriented counterpart of Willmott's index of agreement, a common metric in environmental sciences and engineering. We prove that $L_W$ is…