Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2501.05696

Combinatorial identities related to degenerate Stirling numbers of the second kind

Taekyun Kim·Dae san Kim
View original source ↗Read source document ↗Export metadata ↓

Abstract

The study of degenerate versions of certain special polynomials and numbers, which was initiated by Carlitz's work on degenerate Euler and degenerate Bernoulli polynomials, has recently seen renewed interest among mathematicians. The aim of this paper is to study some properties, certain identities, recurrence relations and explicit expressions for degenerate Stirling numbers of the second kind, which are a degenerate version of the Stirling numbers of the second kind. These numbers appear very frequently when we study various degenerate versions of many special polynomials and numbers. Especially, we consider some closely related polynomials and power series in connection with a degenerate version of Euler's formula for the Stirling numbers of the second kind.

Explore related subjects

math.NTmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Taekyun Kim, Dae san Kim. 2025-01-10. Combinatorial identities related to degenerate Stirling numbers of the second kind. https://arxiv.org/abs/2501.05696

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT↗
arXiv2026

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT↗