English
Related papers

Related papers: Signed partitions - A balls into urns approach

200 papers

We give some theoretical and computational results on "random" harmonic sums with prime numbers, and more generally, for integers with a fixed number of prime factors.

Number Theory · Mathematics 2020-12-08 Alessandro Gambini , Remis Tonon , Alessandro Zaccagnini

An urn scheme is a probabilistic model in which balls are placed into urns sequentially and independently of each other. All balls share the same probability distribution for hitting the urns. In the simplest case, there is a finite number…

Probability · Mathematics 2026-02-17 Berhane Abebe , Mikhail Chebunin , Artyom Kovalevskii

The Euler number $E_n$ (resp. Entringer number $E_{n,k}$) enumerates the alternating (down-up) permutations of $\{1,\dots,n\}$ (resp. starting with $k$). The Springer number $S_n$ (resp. Arnold number $S_{n,k}$) enumerates the type $B$…

Combinatorics · Mathematics 2022-03-22 Heesung Shin , Jiang Zeng

The second Eulerian numbers are defined via the descent enumerator of Stirling permutations, a class of permutations introduced by Gessel and Stanley. We give a simple and conceptual proof of two identities relating the Bernoulli numbers…

Combinatorics · Mathematics 2026-05-26 Jack Boncompagni

A classical method for partition generating functions is developed into a tool with wide applications. New expansions of well-known theorems are derived, and new results for partitions with n copies of n are presented.

Number Theory · Mathematics 2020-08-17 George E. Andrews

In the paper, the authors find two closed forms involving the Stirling numbers of the second kind and in terms of a determinant of combinatorial numbers for the Bernoulli polynomials and numbers.

Combinatorics · Mathematics 2015-09-15 Feng Qi , Robin J. Chapman

We introduce and study a new notion of patterns in Stirling and $k$-Stirling permutations, which we call block patterns. We prove a general result which allows us to compute generating functions for the occurrences of various block patterns…

Combinatorics · Mathematics 2014-02-17 Jeffrey B. Remmel , Andrew Timothy Wilson

A finite collection $P$ of finite sets tiles the integers iff the integers can be expressed as a disjoint union of translates of members of $P$. We associate with such a tiling a doubly infinite sequence with entries from $P$. The set of…

Combinatorics · Mathematics 2007-05-23 Ethan M. Coven , William Geller , Sylvia Silberger , William P. Thurston

We introduce several statistics on ordered partitions of sets, that is, set partitions where the blocks are permuted arbitrarily. The distribution of these statistics is closely related to the q-Stirling numbers of the second kind. Some of…

Combinatorics · Mathematics 2019-04-26 Einar Steingrimsson

We start with a bijective proof of Schur's theorem due to Alladi and Gordon and describe how a particular iteration of it leads to some very general theorems on colored partitions. These theorems imply a number of important results,…

Combinatorics · Mathematics 2007-09-11 Sylvie Corteel , Jeremy Lovejoy

In the paper, the author finds an explicit formula for computing Bell numbers in terms of Lah numbers and Stirling numbers of the second kind.

Combinatorics · Mathematics 2016-10-07 Feng Qi

Recently, authors studied the unsigned degenerate r-Stirling number of the first kind and the degenerate r-Stirling number of the second kind, respectively of which are the degenerate versions of the unsigned r-Stirling numbers of the first…

Number Theory · Mathematics 2022-02-18 Taekyun Kim , Dae san Kim

In this note, we consider ordered partitions of integers such that each entry is no more than a fixed portion of the sum. We give a method for constructing all such compositions as well as both an explicit formula and a generating function…

Number Theory · Mathematics 2013-04-23 Darren Glass

We prove an identity about partitions with a very elementary formulation. We had previously conjectured this identity, encountered in the study of shifted Jack polynomials (math.CO/9901040). The proof given is using a trivariate generating…

Combinatorics · Mathematics 2007-05-23 Michel Lassalle

The classical Bernoulli numbers $B_m$ can be expressed using Stirling numbers of the second kind, and M. Kaneko extended this framework by defining poly-Bernoulli numbers ${\mathbb B}_m^{(k)}$, for which explicit formulas using the Stirling…

Number Theory · Mathematics 2026-03-17 Tomoko Kikuchi , Maki Nakasuji

A $k$-Stirling permutation of order $n$ is said to be "flattened" if the leading terms of its increasing runs are in ascending order. We show that flattened $k$-Stirling permutations of order $n+1$ are in bijection correspondence with a…

Combinatorics · Mathematics 2023-08-09 Umesh Shankar

Refined versions, analytic and combinatorial, are given for classical integer partition theorems. The examples include the Rogers-Ramanujan identities, the Gollnitz-Gordon identities, Euler's odd=distinct theorem, and the Andrews-Gordon…

Combinatorics · Mathematics 2018-09-11 Kathleen O'Hara , Dennis Stanton

For all integers $n \geq k \geq 1$, define $H(n,k) := \sum 1 / (i_1 \cdots i_k)$, where the sum is extended over all positive integers $i_1 < \cdots < i_k \leq n$. These quantities are closely related to the Stirling numbers of the first…

Number Theory · Mathematics 2017-08-29 Paolo Leonetti , Carlo Sanna

In this note, we present several identities involving binomial coefficients and the two kind of Stirling numbers.

Combinatorics · Mathematics 2009-11-03 L. C. Hsu

Several new estimates for the 2-adic valuations of Stirling numbers of the second kind are proved. These estimates, together with criteria for when they are sharp, lead to improvements in several known theorems and their proofs, as well as…

Number Theory · Mathematics 2019-12-04 Arnold Adelberg
‹ Prev 1 4 5 6 7 8 10 Next ›