Related papers: The $n$-Color Partition Function and Some Counting…

Partition functions, also known as homomorphism functions, form a rich family of graph invariants that contain combinatorial invariants such as the number of k-colourings or the number of independent sets of a graph and also the partition…

Let $A_k(n)$ denote the set of $k$-distinct partitions of $n$, and let $B_k(n)$ be the set of $k$-regular partitions of $n$. Glaisher showed that $\# A_k(n) = \# B_k(n)$. For $k=2$, this equality yields the celebrated Euler's partition…

An M-partition of a positive integer m is a partition with as few parts as possible such that any positive integer less than m has a partition made up of parts taken from that partition of m. This is equivalent to partitioning a weight m so…

We offer new Tauberian theorems for a generalized partition function as our main result. Our analysis provides insight into asymptotic behavior of power series with arithmetic functions as coefficients.

Holmsen, Kyn\v{c}l and Valculescu recently conjectured that if a finite set $X$ with $\ell n$ points in $\mathbb{R}^d$ that is colored by $m$ different colors can be partitioned into $n$ subsets of $\ell$ points each, such that each subset…

We establish two expansions of the Potts model partition function of a graph. One is along the deletions of a graph, a rewritten formula given in Biggs (1977). The other is along the contractions of a graph. Then, we specialize the…

We present two algorithms, one quantum and one classical, for estimating partition functions of quantum spin Hamiltonians. The former is a DQC1 (Deterministic quantum computation with one clean qubit) algorithm, and the first such for…

We derive continued fractions for partition generating functions, utilizing both Euler's techniques and Ramanujan's techniques. Although our results are for integer partitions there is scope to extend this work to vector partitions,…

Although the P\'olya enumeration theorem has been used extensively for decades, an optimized, purely numerical algorithm for calculating its coefficients is not readily available. We present such an algorithm for finding the number of…

In this paper, we generalize a few important results in Integer Partitions; namely the results known as Stanley's theorem and Elder's theorem, and the congruence results proposed by Ramanujan for the partition function. We generalize the…

Atkin and Garvan introduced the functions $N_k(n)$ and $M_k(n)$, which denote the $k$-th moments of ranks and cranks in the theory of partitions. Let $e_{2r}(n)$ be the $n$-th Fourier coefficient of $E_{2r}(\tau)/\eta(\tau)$, where…

We give a new combinatorial interpretation of the stationary distribution of the (partially) asymmetric exclusion process on a finite number of sites in terms of decorated alternative trees and colored permutations. The corresponding…

In this expository note, we revisit several classical arithmetic functions - namely Euler's totient function, the divisor sum functions and Dedekind's $\psi$-function - within a unifying algebraic framework that highlights their connections…

Motivated by recent work of Hirschhorn and the author, Thejitha and Fathima recently considered arithmetic properties satisfied by the function $a_5(n)$ which counts the number of integer partitions of weight $n$ wherein even parts come in…

Recently, Kaur and Rana introduced the partition function denoted by $\rho(n)$, where the largest part $\lambda$ appears exactly once, and the remaining parts constitute a partition of $\lambda$. In this paper, we establish new generating…

Probabilistic graphical models have emerged as a powerful modeling tool for several real-world scenarios where one needs to reason under uncertainty. A graphical model's partition function is a central quantity of interest, and its…

The 2-color partitions may be considered as an extension of regular partitions of a natural number $n$, with $p_{k}(n)$ defined as the number of 2-colored partitions of $n$ where one of the 2 colors appears only in parts that are multiples…

We use sums over integer compositions analogous to generating functions in partition theory, to express certain partition enumeration functions as sums over compositions into parts that are $k$-gonal numbers; our proofs employ Ramanujan's…

Recent work by Craig, van Ittersum, and Ono constructs explicit expressions in the partition functions of MacMahon that detect the prime numbers. Furthermore, they define generalizations, the MacMahonesque functions, and prove there are…

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*}…