Related papers: Labeled Partitions with Colored Permutations

Grounded partitions, introduced by Dousse and Konan, are coloured partitions satisfying difference conditions given by a matrix with nonnegative integer entries. For the matrices studied in this paper, the generating functions are known to…

Set partitions closed under certain operations form a tensor category. They give rise to certain subgroups of the free orthogonal quantum group $O_n^+$, the so called easy quantum groups, introduced by Banica and Speicher in 2009. This…

For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After…

In a recent paper, Carrell and Goulden found a combinatorial identity of the Bernstein operators that they then used to prove Bernstein's Theorem. We show that this identity is a straightforward consequence of the classical result. We also…

A cubic partition is an integer partition wherein the even parts can appear in two colors. In this paper, we introduce the notion of generalized cubic partitions and prove a number of new congruences akin to the classical Ramanujan-type. We…

In his recent work, Andrews revisited two-color partitions with certain restrictions on the differences between consecutive parts, and he established three theorems linking these two-color partitions with more familiar kinds of partitions.…

Very recently, Thejitha, Sellers, and Fathima defined the function $a_{r,s}(n)$, which enumerates the number of multicolored partitions of $n$, wherein both even parts and odd parts may appear in one of $r$-colors and $s$-colors,…

For any positive integers $a$ and $b$, we enumerate all colored partitions made by noncrossing diagonals of a convex polygon into polygons whose number of sides is congruent to $b$ modulo $a$. For the number of such partitions made by a…

Let $k$ and $n$ be positive integers. Let $c\phi_{k}(n)$ denote the number of $k$-colored generalized Frobenius partitions of $n$ and $\mathrm{C}\Phi_k(q)$ be the generating function of $c\phi_{k}(n)$. In this article, we study…

In 1917, Hardy and Ramanujan obtained the asymptotic formula for the classical partition function $p(n)$. The classical partition function $p(n)$ has been extensively studied. Recently, Luca and Ralaivaosaona obtained the asymptotic formula…

Recently, Capparelli, Meurman, A. Primc and M. Primc introduced a class of colored partitions which has since been called CMPP partitions. This generalized earlier work by M. Primc and \v{S}iki\'{c}, and by Trup\v{c}evi\'{c}. One main…

Extensions of a set partition obtained by imposing bounds on the size of the parts and the coloring of some of the elements are examined. Combinatorial properties and the generating functions of some counting sequences associated with these…

We generalize the work of Fomin, Greene, Reiner, and Shimozono on balanced labellings in two directions: (1) we define the diagrams of affine permutations and the balanced labellings on them; (2) we define the set-valued version of the…

Within the framework of unitary easy quantum groups, we study an analogue of Brauer's Schur-Weyl approach to the representation theory of the orthogonal group. We consider concrete combinatorial categories whose morphisms are formed by…

In a series of two papers, S. Capparelli, A. Meurman, A. Primc, M. Primc (CMPP) and then M. Primc put forth three remarkable sets of conjectures, stating that the generating functions of coloured integer partition in which the parts satisfy…

In a recent paper (Tran et al., Ann.Phys.311(2004)204), some asymptotic number theoretical results on the partitioning of an integer were derived exploiting its connection to the quantum density of states of a many-particle system. We…

In his 1984 AMS Memoir, George Andrews defined the family of $k$--colored generalized Frobenius partition functions. These are denoted by $c\phi_k(n)$ where $k\geq 1$ is the number of colors in question. In that Memoir, Andrews proved…

We present a unified framework of combinatorial descriptions, and the analogous asymptotic growth of the coefficients of two general families of functions related to integer partitions. In particular, we resolve several conjectures and…

We describe proofs of the standard generating formulas for unsigned and signed Stirling numbers of the first kind that follow from a natural combinatorial interpretation based on cycle-colored permutations.

We show that the number Z of q-edge-colourings of a simple regular graph of degree q is deducible from functions describing dimers on the same graph, viz. the dimer generating function or equivalently the set of connected dimer correlation…