Algorithmic complexity, a cornerstone of theoretical computer science, examines the intrinsic resource requirements of computational problems and the limits of what can be efficiently computed. Within ...

In the paper, the authors find series expansions and identities for positive integer powers of inverse (hyperbolic) sine and tangent, for composite of incomplete gamma function with inverse hyperbolic ...

Abstract We prove that λ𝑔 ↦ 𝑒⁻𝑡|𝑔|𝑟 λ𝑔 defines a multiplier on the von Neuman algebra of hyperbolic groups with a complete bound ≃ 𝑟, for any 0 < 𝑡 < ∞, 1 < 𝑟 < ∞. In the proof we observe ...