Related papers: A Recursive Relation for Bipartition Numbers

We introduce the subsum polynomial of a partition $\lambda=(\lambda_1, \lambda_2, \ldots, \lambda_k)$ defined by $\mathrm{sp}(\lambda, x)=\prod_{i=1}^k(1+x^{\lambda_i})$. We study the sum of reciprocals of $\mathrm{sp}(\lambda, x)$ over all…

The partition functions $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, and $Q(n,m,p)$, the number of integer partitons of $n$ into exactly $m$ distinct parts with each part at most…

Partition functions of a canonical ensemble of non-interacting bound electrons are a key ingredient of the super-transition-array approach to the computation of radiative opacity. A few years ago, we published a robust and stable recursion…

The Eulerian triangle is a classical array of combinatorial numbers defined by a linear recursion. The associated boundary problem asks one to find all extreme nonnegative solutions to a dual recursion. Exploiting connections with random…

We visualize the identity p(n) = sum s(k) p(n-k)/n for the integer partition function p(n) involving the divisor function s, add comments on the history of visualizations of numbers, illustrate how different mathematical fields play…

The coefficient of x^{-1} of a formal Laurent series f(x) is called the formal residue of f(x). Many combinatorial numbers can be represented by the formal residues of hypergeometric terms. With these representations and the extended…

Jantzen-Seitz partitions are those $p$-regular partitions of~$n$ which label $p$-modular irreducible representations of the symmetric group $S_n$ which remain irreducible when restricted to $S_{n-1}$; they have recently also been found to…

Motivated by Alladi's recent multi-dimensional generalization of Sylvester's classical identity, we provide a simple combinatorial proof of an overpartition analogue, which contains extra parameters tracking the numbers of overlined parts…

The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [n+1] is equal to the n-th large Schroder number $r_n$, which…

We consider alternative orders of summation for the conditionally convergent series defining the weight-2 Eisenstein series G2 and the Weierstrass p-function. The resulting sums differ from the standard ones by a residual term that can be…

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…

We introduce and survey results on two families of zeta functions connected to the multiplicative and additive theories of integer partitions. In the case of the multiplicative theory, we provide specialization formulas and results on the…

Definitions and notations with historical references are given for some numerical coefficients commonly used to quantify relations among collections of objects for the purpose of expressing approximate knowledge and probabilistic reasoning.

Let $p$ be an odd prime. The bar partitions with sign and $p$-bar-core partitions with sign respectively label the spin characters and $p$-defect zero spin characters of the double cover of the symmetric group, and by restriction, those of…

We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.

We study certain bijection between plane partitions and $\mathbb{N}$-matrices. As applications, we prove a Cauchy-type identity for generalized dual Grothendieck polynomials. We introduce two statistics on plane partitions, whose generating…

We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…

Bicommutant categories are higher categorical analogs of von Neumann algebras that were recently introduced by the first author. In this article, we prove that every unitary fusion category gives an example of a bicommutant category. This…

The Toeplitz determinants (of increasing size) associated with the symbols $exp{t(z+z^{-1})}$ or $(1-{\xi}{z})^{\alpha} (1-{\xi}{z^{-1}})^{\beta}$ satisfy recursion relations, thus expressing all the Toeplitz determinants as a rational…

Euler's theorem asserts that $A(n)=B(n)$ where $A(n)$ is the number of partitions of $n$ into distinct parts and $B(n)$ is the number of partitions of $n$ into odd parts. In this paper, it is proved that for $n>0$, \begin{align*}…