Related papers: Enumerating coloured partitions in 2 and 3 dimensi…
We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…
As countless examples show, it can be fruitful to study a sequence of complicated objects all at once via the formalism of generating functions. We apply this point of view to the homology and combinatorics of orbit configuration spaces:…
The connection between the theory of permutation orbifolds, covering surfaces and uniformization is investigated, and the higher genus partition functions of an arbitrary permutation orbifold are expressed in terms of those of the original…
Assuming that a plane partition of the positive integer $n$ is chosen uniformly at random from the set of all such partitions, we propose a general asymptotic scheme for the computation of expectations of various plane partition statistics…
Generalizing Reiner's notion of set partitions of type $B_n$, we define colored $B_n$-partitions by coloring the elements in and not in the zero-block respectively. Considering the generating function of colored $B_n$-partitions, we get the…
Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the…
In this paper, we give a conjecture, which generalises Euler's partition theorem involving odd parts and different parts for all moduli. We prove this conjecture for two family partitions. We give $q$-difference equations for the related…
We introduce elliptic weights of boxed plane partitions and prove that they give rise to a generalization of MacMahon's product formula for the number of plane partitions in a box. We then focus on the most general positive degenerations of…
We characterize which graph invariants are partition functions of an edge-coloring model over the complex numbers, in terms of the rank growth of associated `connection matrices'.
The investigation of colour symmetries for periodic and aperiodic systems consists of two steps. The first concerns the computation of the possible numbers of colours and is mainly combinatorial in nature. The second is algebraic and…
We want to construct a homological link invariant whose Euler characteristic is MOY polynomial as Khovanov and Rozansky constructed a categorification of HOMFLY polynomial. The present paper gives the first step to construct a…
We compute the Donaldson-Thomas invariants of a local elliptic surface with section. We introduce a new computational technique which is a mixture of motivic and toric methods. This allows us to write the partition function for the…
Higher genus partition functions of two-dimensional conformal field theories have to be invariants under linear actions of mapping class groups. We illustrate recent results [4,6] on the construction of such invariants by concrete…
By work of Bringmann, Ono, and Rhoades it is known that the generating function of the $M_2$-rank of partitions without repeated odd parts is the so-called holomorphic part of a certain harmonic Maass form. Here we improve the standing of…
Given a finite coloring (or finite partition) of the free semigroup $A^+$ over a set $A$, we consider various types of monochromatic factorizations of right sided infinite words $x\in A^\omega$. Some stronger versions of the usual notion of…
To construct a BPS algebra with representations furnished by n-dimensional partitions, the first step is to find the eigenvalues of the Cartan operators acting on them. The generating function of the eigenvalues is called the charge…
Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several…
We show that, for a certain class of partitions and an even number of variables of which half are reciprocals of the other half, Schur polynomials can be factorized into products of odd and even orthogonal characters. We also obtain related…
In this paper, we initiate the study of "Generalized Divide and Color Models". A very special interesting case of this is the "Divide and Color Model" (which motivates the name we use) introduced and studied by Olle H\"aggstr\"om. In this…
In this paper, we establish that the number of partitions of a natural number with positive odd rank is equal to the number of two-color partitions (red and blue), where the smallest part is even (say $2n$) and all red parts are even and…