Related papers: Partition Identities From Partial Supersymmetry
We revisit the factorisation of supersymmetric partition functions of 3d $\mathcal{N}=4$ gauge theories. The building blocks are hemisphere partition functions of a class of UV $\mathcal{N}=(2,2)$ boundary conditions that mimic the presence…
We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a…
We derive a formula for $p(n)$ (the number of partitions of $n$) in terms of the partial Bell polynomials using Fa\`{a} di Bruno's formula and Euler's pentagonal number theorem.
Using a new presentation for partition algebras (J. Algebraic Combin. 37(3):401-454, 2013), we derive explicit combinatorial formulae for the seminormal representations of the partition algebras. These results generalise to the partition…
We consider a microscopic model of spacetime, where spacetime is assumed to be a specific graph with Planck size quantum black holes on its vertices. As a thermodynamical system under consideration we take a certain uniformly accelerating,…
The Euler numbers have been widely studied. A signed version of the Euler numbers of even subscript are given by the coefficients of the exponential generating function 1/(1+x^2/2!+x^4/4!+...). Leeming and MacLeod introduced a…
The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several…
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)…
We give a supersymmetric generalization of the sine algebra and the quantum algebra $U_{t}(sl(2))$. Making use of the $q$-pseudo-differential operators graded with a fermionic algebra, we obtain a supersymmetric extension of sine algebra.…
Recently, Merca and Schmidt found some decompositions for the partition function $p(n)$ in terms of the classical M\"{o}bius function as well as Euler's totient. In this paper, we define a counting function $T_k^r(m)$ on the set of…
Given a partition $\lambda$, we write $e_j(\lambda)$ for the $j^{\textrm{th}}$ elementary symmetric polynomial $e_j$ evaluated at the parts of $\lambda$ and $e_jp_A(n)$ for the sum of $e_j(\lambda)$ as $\lambda$ ranges over the set of…
In 2015, Bringmann, Lovejoy and Mahlburg considered certain kinds overpartitions, which can been seen as the overpartition analogue of Schur's partition. The motivation of their work is that the difference between the generating function of…
This work follows the spirit of Andrews' series of papers on Partition Analysis. In $2011$, Savage and Sills found new sum sides for the little G\"ollnitz identities and provided their partition interpretations. It turns out that similar…
The partitions of the integers can be expressed exactly in an iterative and closed-form expression. This equation is derived from distributing the partitions of a number in a network that locates each partition in a unique and orderly…
We describe a unified approach to calculating the partition functions of a general multi-level system with a free Hamiltonian. Particularly, we present new results for parastatistical systems of any order in the second quantized approach.…
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.
We present an algorithm to invert the Euler function $\phi(m)$. The algorithm, for a given $n \geq 1$, in polynomial time ``on average'', finds the set $\Psi(n)$ of all solutions $m$ to $\phi(m) = n$. In fact, in the worst case, $\Psi(n)$…
Categories of partitions are combinatorial structures arising from the representation theory of certain compact quantum groups and are linked to classical diagram algebras such as the Temperley-Lieb algebra. In this paper, we present…
In the article integer divisibility properties and related prime factors natural number representation concepts have been defined over the whole infinite hyperoperation hierarchy. The definitions have been made across and above of unique…
The partition function for a system of non-interacting $N-$particles can be found by summing over all the states of the system. The classical partition function for an ideal gas differs from Bosonic or Fermionic partition function in the…