English
Related papers

Related papers: Two notes on notation

200 papers

In Combinatorics Stirling numbers may be defined in several ways. One such definition is given in [1], where an extensive consideration of Stirling numbers is presented. In this paper an alternative definition of Stirling numbers of both…

Combinatorics · Mathematics 2008-06-17 Milan Janjic

The Stirling number of the second kind $n\brace k$ counts the number of ways to partition a set of $n$ labeled balls into $k$ non-empty unlabeled cells. As an extension of this, we consider $b_1+b_2+\ldots+b_n$ balls with $b_1$ balls…

Combinatorics · Mathematics 2019-09-12 Daniel Yaqubi , Madjid Mirzavaziri , Yasin Saeednezhad

We introduce the $B$-Stirling numbers of the first and second kind, which are the coefficients of the potential polynomials when we express them in terms of the monomials and the falling factorials, respectively. These numbers include, as…

Combinatorics · Mathematics 2024-10-17 José A. Adell , Beáta Bényi

This is a historical introduction to the theory of Stirling numbers of the second kind S(n,k) from the point of view of analysis. We tell the story of their birth in the book of James Stirling (1730) and show how they mature in the works of…

History and Overview · Mathematics 2018-06-26 Khristo N. Boyadzhiev

In the paper, the author elementarily unifies and generalizes eight identities involving the functions $\frac{\pm1}{e^{\pm t}-1}$ and their derivatives. By one of these identities, the author establishes two explicit formulae for computing…

Classical Analysis and ODEs · Mathematics 2014-06-24 Bai-Ni Guo , Feng Qi

In the paper, by establishing a new and explicit formula for computing the $n$-th derivative of the reciprocal of the logarithmic function, the author presents new and explicit formulas for calculating Bernoulli numbers of the second kind…

Combinatorics · Mathematics 2014-05-06 Feng Qi

In the note, the author discovers an explicit formula for computing Bernoulli numbers in terms of Stirling numbers of the second kind.

Number Theory · Mathematics 2025-02-25 Feng Qi

The partial Stirling numbers T_n(k) used here are defined as the sum over odd values of i of (n choose i) i^k. Their 2-exponents nu(T_n(k)) are important in algebraic topology. We provide many specific results, applying to all values of n,…

Number Theory · Mathematics 2011-09-23 Donald M. Davis

The aim of this paper is to prove conjectures concerning $p$-adic valuations of Stirling numbers of the second kind $S(n,k)$, $n,k\in\mathbb{N}_+$, stated by Amdeberhan, Manna and Moll and Berrizbeitia et al., where $p$ is a prime number.…

Number Theory · Mathematics 2018-03-14 Piotr Miska

We study sums of the form $\sum_{k=m}^n a_{nk} b_{km}$, where $a_{nk}$ and $b_{km}$ are binomial coefficients or unsigned Stirling numbers. In a few cases they can be written in closed form. Failing that, the sums still share many common…

Combinatorics · Mathematics 2025-09-30 Marin Knežević , Vedran Krčadinac , Lucija Relić

Integer partitions express the different ways that a positive integer may be written as a sum of positive integers. Here we explore the analytic properties of a new polynomial $f_\lambda(x)$ that we call the partition polynomial for the…

Number Theory · Mathematics 2022-06-14 Madeline Locus Dawsey , Tyler Russell , Dannie Urban

A set partition of $[n] := \{1, 2, \dots, n \}$ is called {\em $r$-Stirling} if the numbers $1, 2, \dots, r$ belong to distinct blocks. Haglund, Rhoades, and Shimozono constructed graded ring $R_{n,k}$ depending on two positive integers $k…

Combinatorics · Mathematics 2019-07-04 Brendon Rhoades , Andrew Timothy Wilson

The Stirling number of a simple graph is the number of partitions of its vertex set into a specific number of non-empty independent sets. In 2015, Engbers et al. showed that the coefficients in the normal ordering of a word $w$ in the…

Combinatorics · Mathematics 2021-06-16 Ken Joffaniel Gonzales

In this paper we give simple expressions, involving binomials coefficients, for the value of $c(n,k)$ modulo $p^{v_p(n)}$, when $v_p(n) > 0$. Here $c(n,k)$ denotes a Stirling number of the first kind, and $v_p(n)$ is the highest power of…

Number Theory · Mathematics 2015-12-04 Pierre Guillot , Yohann Ségalat

Let P be the set of the sequence of polynomials of degree n. The aim of this paper is to study the Stirling numbers of the second kind associated with P and of the first kind associated with P, in a unified and systematic way with the help…

Number Theory · Mathematics 2022-02-24 Dae san Kim , taekyun Kim

We derive new formulas for the number of unordered (distinct) factorizations with $k$ parts of a positive integer $n$ as sums over the partitions of $k$ and an auxiliary function, the number of partitions of the prime exponents of $n$,…

Combinatorics · Mathematics 2019-09-04 Jacob Sprittulla

Recent developments of Baxter algebras have lead to applications to combinatorics, number theory and mathematical physics. We relate Baxter algebras to Stirling numbers of the first kind and the second kind, partitions and multinomial…

Commutative Algebra · Mathematics 2007-05-23 Li Guo

We study set partitions with $r$ distinguished elements and block sizes found in an arbitrary index set $S$. The enumeration of these $(S,r)$-partitions leads to the introduction of $(S,r)$-Stirling numbers, an extremely wide-ranging…

Combinatorics · Mathematics 2018-12-03 Beáta Bényi , Miguel Méndez , José L. Ramírez , Tanay Wakhare

We generalize the Stirling numbers of the first kind $s(a,k)$ to the case where $a$ may be an arbitrary real number. In particular, we study the case in which $a$ is an integer. There, we discover new combinatorial properties held by the…

Combinatorics · Mathematics 2008-02-03 Daniel E. Loeb

We study inverse factorial series and their relation to Stirling numbers of the first kind. We prove a special representation of the polylogarithm function in terms of series with such numbers. Using various identities for Stirling numbers…

Number Theory · Mathematics 2022-06-15 Khristo N. Boyadzhiev
‹ Prev 1 2 3 10 Next ›