English
Related papers

Related papers: $\kappa$-generalization of Stirling approximation …

200 papers

We prove that the enumerative polynomials of generalized Stirling permutations by the statistics of plateaux, descents and ascents are partial $\gamma$-positive. Specialization of our result to the Jacobi-Stirling permutations confirms a…

Combinatorics · Mathematics 2020-05-15 Zhicong Lin , Jun Ma , Philip B. Zhang

A concise and elementary derivation of the complete asymptotic expansion for the factorial function $n!$ is presented. This treatment produces a new expression for the coefficients, and it brings to light the simple relationship between the…

History and Overview · Mathematics 2023-05-18 Valerio De Angeis

We recently introduced the recursive divisor function $\kappa_x(n)$, a recursive analogue of the usual divisor function. Here we calculate its Dirichlet series, which is ${\zeta(s-x)}/(2 - \zeta(s))$. We show that $\kappa_x(n)$ is related…

Number Theory · Mathematics 2023-07-19 T. M. A. Fink

In this paper, we obtain a $(p,\nu)$-extension of the Whittaker function $M_{\kappa,\mu}(z)$ by using the extended confluent hypergeometric function of the first kind $\Phi_{p,\nu}(b;c;z)$ introduced in Parmar et al. [J. Classical Anal. 11…

Classical Analysis and ODEs · Mathematics 2018-01-31 S A Dar , R B Paris

We obtain an explicit simple formula for the coefficients of the asymptotic expansion for the factorial of a natural number,in terms of derivatives of powers of an elementary function. The unique explicit expression for the coefficients…

Classical Analysis and ODEs · Mathematics 2010-02-23 Stella Brassesco , Miguel A. Méndez

Associated to each random variable $Y$ having a finite moment generating function, we introduce a different generalization of the Stirling numbers of the second kind. Some characterizations and specific examples of such generalized numbers…

Number Theory · Mathematics 2018-03-14 José A. Adell , Alberto Lekuona

The branching coefficients in the expansion of the elementary symmetric function multiplied by a symmetric Macdonald polynomial $P_\kappa(z)$ are known explicitly. These formulas generalise the known $r=1$ case of the Pieri-type formulas…

Quantum Algebra · Mathematics 2010-08-06 Wendy Baratta

We generalize the exponential family of probability distributions. In our approach, the exponential function is replaced by a $\varphi$-function, resulting in a $\varphi$-family of probability distributions. We show how $\varphi$-families…

Probability · Mathematics 2013-09-12 Rui F. Vigelis , Charles C. Cavalcante

Most astrophysical plasmas are observed to have velocity distribution functions exhibiting non-Maxwellian suprathermal tails. The high energy particle populations are accurately represented by the family of kappa-distributions where the use…

Astrophysics · Physics 2009-11-07 Manfred P. Leubner

We consider the problem of matrix approximation and denoising induced by the Kronecker product decomposition. Specifically, we propose to approximate a given matrix by the sum of a few Kronecker products of matrices, which we refer to as…

Statistics Theory · Mathematics 2020-08-28 Chencheng Cai , Rong Chen , Han Xiao

A brief overview of publications in approximation theory of functions known to the author and connected with scientific publications by V.~K.~Dzyadyk (1919--1998).

Classical Analysis and ODEs · Mathematics 2019-03-27 R. M. Trigub

The $\kappa$-topologies on the spaces $\mathscr{D}_{L^p}$, $L^p$ and $\mathscr{M}^1$ are defined by a neighbourhood basis consisting of polars of absolutely convex and compact subsets of their (pre-)dual spaces. In many cases it is more…

Functional Analysis · Mathematics 2020-10-09 Christian Bargetz , Eduard A. Nigsch , Norbert Ortner

Usually, the realizations of the noncommutative Snyder model lead to a nonassociative star product. However, it has been shown that this problem can be avoided by adding to the spacetime coordinates new tensorial degrees of freedom. The…

General Physics · Physics 2021-10-13 S. Meljanac , S. Mignemi

In this paper we use infinitary Turing machines with tapes of length $\kappa$ and which run for time $\kappa$ as presented, e.g., by Koepke \& Seyfferth, to generalise the notion of type two computability to $2^{\kappa}$, where $\kappa$ is…

Logic · Mathematics 2017-04-11 Lorenzo Galeotti , Hugo Nobrega

Stefanich generalized the notion of (locally) presentable $(\infty, 1)$-category to the notion of presentable $(\infty, n)$-category. We give a new description based on the new notion of $\kappa$-compactly generated $(\infty, n)$-category,…

Category Theory · Mathematics 2025-10-16 Ko Aoki

Considering the class of almost periodic functions in the Stepanov sense we extend and generalize the results of the first author [4]. as well as the results of L. Leindler [3] and P. Chandra [1,2].

Classical Analysis and ODEs · Mathematics 2012-12-06 Wlodzimierz Lenski , Bogdan Szal

We present the exact realization of the extended Snyder model. Using similarity transformations, we construct realizations of the original Snyder and the extended Snyder models. Finally, we present the exact new realization of the…

Mathematical Physics · Physics 2023-10-11 Tea Martinić Bilać , Stjepan Meljanac

It is well known that real measures on the circle are characterized by their Herglotz transform, an analytic function in the unit disc. Invariance of the measure under N-multiplication translates into a functional equation for the Herglotz…

Dynamical Systems · Mathematics 2011-11-29 Christopher Deninger

Stirling's formula is a powerful asymptotic approximation of the factorial function. Many well-known proofs of this formula are grounded in integral calculus. In this paper, we present an alternative proof of Stirling's formula using only…

Combinatorics · Mathematics 2023-10-10 Jakub Smolík

Flum and Grohe define a parameter (parameterization) as a function $\kappa$ which maps words over a given alphabet to natural numbers. They require such functions to be polynomial-time computable. We show how this technical restriction can…

Computational Complexity · Computer Science 2019-11-19 Maurice Chandoo