Related papers: Combinatorial Formula for the Partition Function

We present a natural multiplicative theory of integer partitions (which are usually considered in terms of addition), and find many theorems of classical number theory arise as particular cases of extremely general combinatorial structure…

We provide a combinatorial interpretation of the reduced composition polynomials of Ardila and Doker [Adv. Appl. Math. 50 (2013), 607], and relate them to the $(1-q)$-transform of noncommutative symmetric functions.

In this article, we investigate partial integrals and partial derivatives of bivariate fractal interpolation functions. We prove also that the mixed Riemann-Liouville fractional integral and derivative of order $\gamma = (p, q); p > 0,q >…

Schur's $Q$-functions with reduced variables are discussed by employing a combinatorics of strict partitions. They are called reduced $Q$-functions. We give a description of the linear relations among reduced $Q$-functions.

In this paper, we derive some formulae involving coefficients of polynomials which occur quite naturally in the study of restricted partitions. Our method involves a recently discovered sieve technique by Li and Wan (Sci. China. Math.…

An asymptotic formula for the number of partitions into p-cores is derived. As a byproduct some integer valued trigonometric sums are found

One of the most basic results concerning the number-theoretic properties of the partition function $p(n)$ is that $p(n)$ takes each value of parity infinitely often. This statement was first proved by Kolberg in 1959, and it was…

In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…

This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…

We pose the question of what is the best generalization of the factorial and the binomial coefficient. We give several examples, derive their combinatorial properties, and demonstrate their interrelationships. On cherche ici \`a…

We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…

In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…

We prove a closed formula for the derivative, of any order, of a implicit function, in terms of some binomial building blocks, and explain the combinatorics behind the coefficients appearing in the formula.

We provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [Adi18]. One of the main advantages is that it is entirely self-contained, using only a minimal knowledge…

For a polynomial f: {-1, 1}^n --> C, we define the partition function as the average of e^{lambda f(x)} over all points x in {-1, 1}^n, where lambda in C is a parameter. We present a quasi-polynomial algorithm, which, given such f, lambda…

Let $A$ be a nonempty set of positive integers. The restricted partition function $p_A(n)$ denotes the number of partitions of $n$ with parts in $A$. When the elements in $A$ are pairwise relatively prime positive integers, Ehrhart,…

An algebraic structure, Quotient Algebra Partition or QAP, is introduced in a serial of articles. The structure QAP is universal to Lie Algebras and enables algorithmic and exhaustive Cartan decompositions. The first episode draws the…

The aim of this sequence of work is to investigate polynomial equations satisfied by additive functions. As a result of this, new characterization theorems for homomorphisms and derivations can be given. More exactly, in this paper the…

We start with a (q,t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is…

In this paper, we generalize recent work of Mizuhara, Sellers, and Swisher that gives a method for establishing restricted plane partition congruences based on a bounded number of calculations. Using periodicity for partition functions, our…