Related papers: Partition Identities From Partial Supersymmetry

We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…

We present a new partition identity and give a combinatorial proof of our result. This generalizes a result of Andrew's in which he considers the generation function for partitions with respect to size, number of odd parts, and number of…

We generalise Euler's partition theorem involving odd parts and different parts for all moduli and provide new companions to Rogers-Ramanujan- Andrews-Gordon identities related to this theorem.

Linear inequalities involving Euler's partition function $p(n)$ have been the subject of recent studies. In this article, we consider the partition function $Q(n)$ counting the partitions of $n$ into distinct parts. Using truncated theta…

Superstrings have been postulated based on parafermionic partition functions which permit spacetime supersymmetry by generalized Jacobi identities. A comprehensive search finds new such identities. Quadrilateral anomaly cancellation gives…

The fundamentals of Statistical Mechanics require a fresh definition in the context of the developments in Classical Mechanics of integrable and chaotic systems. This is done with the introduction of Micro Partitions ; a union of disjoint…

We consider finite quantum systems defined by a mixed set of commutation and anti-commutation relations between components of the Hamiltonian operator. These relations are represented by an anti-commutativity graph which contains a…

Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m-1$ times is equal to the number of partitions of $n$ into parts which are not divisible by $m$. The $m=2$ case is Euler's famous partition…

We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m+1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is bounded by m.…

We exploit transformations relating generalized $q$-series, infinite products, sums over integer partitions, and continued fractions, to find partition-theoretic formulas to compute the values of constants such as $\pi$, and to connect sums…

We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…

In classical statistical mechanics, the partition function is defined in phase space. We extend this concept to quantum statistical mechanics using Bohmian trajectories. The quantum partition function in phase space captures the ensemble of…

In this paper, we show that the difference between the number of parts in the odd partitions of $n$ and the number of parts in the distinct partitions of $n$ satisfies Euler's recurrence relation for the partition function $p(n)$ when $n$…

We consider $\mathcal{N}=2$ supersymmetric pure gauge theories on toric K\"ahler manifolds, with particular emphasis on $\mathbb{CP}^2$. By choosing a vector generating a $U(1)$ action inside the torus of the manifold, we construct…

We describe a new model of massless thermal bosons which predicts an hyperbolic fluctuation spectrum at low frequencies. It is found that the partition function per mode is the Euler generating function for unrestricted partitions $p(n)$.…

New formulas are given for the grand partition function of paraboson systems of order p with n orbitals and parafermion systems of order p with m orbitals. These formulas allow the computation of statistical and thermodynamic functions for…

By considering a limiting form of the q-Dixon_4\phi_3 summation, we prove a weighted partition theorem involving odd parts differing by >= 4. A two parameter refinement of this theorem is then deduced from a quartic reformulation of…

The paper contains an exposition of part of topology using partitions of unity. The main idea is to create variants of the Tietze Extension Theorem and use them to derive classical theorems. This idea leads to a new result generalizing…

We give Euler-like recursive formulas for the $t$-colored partition function when $t=2$ or $t=3,$ as well as for all $t$-regular partition functions. In particular, we derive an infinite family of ``triangular number" recurrences for the…

We study a bijective map from integer partitions to the prime factorizations of integers that we call the "supernorm" of a partition, in which the multiplicities of the parts of partitions are mapped to the multiplicities of prime factors…