Related papers: On partition polynomials and partition functions
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…
In this paper, by the generalized Bell umbra and Rolle's theorem, we give some results on the real rootedness of polynomials. Some applications on partition polynomials and the sigma polynomials of graphs are given.
By using techniques of poset representation theory, we present a formula for the number of partitions of a positive integer into three polygonal numbers.
We give an explicit formula for an operator that sends a wreath Macdonald polynomial to the delta function at a character associated to its partition. This allows us to prove many new results for wreath Macdonald polynomials, especially…
Recently, Andrews introduced separable integer partition classes and studied some well-known theorems. In this article, we will consider the types of partitions with restrictions on consecutive parts. We will show that such partitions are…
We recall the notion of fractional enumeration and immediately focus on the fractional counting of integer partitions, where each partition gets credit equal to the reciprocal of the product of its parts. We raise two intriguing questions…
In this article we obtain an explicit formula in terms of the partitions of the positive integer $n$ to express the $n$-th term of a wide class of sequences of numbers defined by recursion. Our proof is based only on arithmetics. We compare…
We present a unified algebraic framework utilizing the formal Bell transform to bridge the Dirichlet convolution of arithmetic functions with the combinatorial structure of infinite Euler-type products. By analyzing the logarithmic…
Stanley defined a partition function t(n) as the number of partitions $\lambda$ of n such that the number of odd parts of $\lambda$ is congruent to the number of odd parts of the conjugate partition $\lambda'$ modulo 4. We show that t(n)…
Partition functions of probability distributions are important quantities for model evaluation and comparisons. We present a new method to compute partition functions of complex and multimodal distributions. Such distributions are often…
In 1938 E. T. Bell introduced "The Iterated Exponential Integers". He proved that these numbers may be expressed by polynomials with rational coefficients. However, Bell gave no formulas for any of the coefficients except the trivial one,…
We consider a partially asymmetric exclusion process (PASEP) on a finite number of sites with open and directed boundary conditions. Its partition function was calculated by Blythe, Evans, Colaiori, and Essler. It is known to be a…
In this paper, we extend the work of Andrews, Beck and Hopkins by considering partitions and compositions with bounded gaps between each pair of consecutive parts. We show that both their generating functions and two matrices determined by…
The aim of this paper is to introduce truncated degenerate Bell polynomials and numbers and to investigate some of their properties. In more detail, we obtain explicit expressions, identities involving other special polynomials, integral…
We examine the $q$-Pell sequences and their applications to weighted partition theorems and values of $L$-functions. We also put them into perspective with sums of tails.
We study the number $p(n,t)$ of partitions of $n$ with difference $t$ between largest and smallest parts. Our main result is an explicit formula for the generating function $P_t(q) := \sum_{n \ge 1} p(n,t) \, q^n$. Somewhat surprisingly,…
We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…
In this note I revisit the calculation of partition function of simple one dimensional systems solvable by Bethe Ansatz. Particularly I show that by the precise definition and treatment of the partition function the nontrivial normalization…
In this paper we use Faa di Bruno's formula to associate Bell polynomial values to differential equations of the form $y^{\prime}=f(y)$. That is, we use partial Bell polynomials to represent the solution of such an equation and use the…
We introduce new refinements of the Bell, factorial, and unsigned Stirling numbers of the first and second kind that unite the derangement, involution, associated factorial, associated Bell, incomplete Stirling, restricted factorial,…