Related papers: Labeled Partitions with Colored Permutations

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…

Recently, Chan and Wang (Fractional powers of the generating function for the partition function. Acta Arith. 187(1), 59--80 (2019)) studied the fractional powers of the generating function for the partition function and found several…

In this text we introduce and analyze families of symmetric functions arising as partition functions for colored fermionic vertex models associated with the quantized affine Lie superalgebra $U_q \big( \widehat{\mathfrak{sl}} (1 | n)…

We give a bijection between certain colored partitions and the elements in the quotient of an affine Weyl group modulo its Weyl group. By Bott's formula these colored partitions give rise to some partition identities. In certain types,…

We use the Mallows permutation model to construct a new family of stationary finitely dependent proper colorings of the integers. We prove that these colorings can be expressed as finitary factors of i.i.d. processes with finite mean coding…

Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…

The color-flavor transformation for the unitary group (Zirnbauer 1996) is extended to the special unitary group. The resulting partition function is represented as sum over disconnected sectors characterized by a U(1)-charge. Application to…

MacMahon showed that the generating function for partitions into at most $k$ parts can be decomposed into a partial fractions-type sum indexed by the partitions of $k$. In this present work, a generalization of MacMahon's result is given,…

We study a weighted-set graph coloring problem in which one assigns $q$ colors to the vertices of a graph such that adjacent vertices have different colors, with a vertex weighting $w$ that either disfavors or favors a given subset of $s$…

In this article we will derive a combinatorial formula for the partition function p(n). In the second part of the paper we will establish connection between partitions and q-binomial coefficients and give new interpretation for q-binomial…

Using sequences of finite length with positive integer elements and the inversion statistic on such sequences, a collection of binomial and multinomial identities are extended to their $q$-analog form via combinatorial proofs. Using the…

We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…

In this note we conjecture Rogers-Ramanujan type colored partition identities for an array with odd number of rows w such that the first and the last row consist of even positive integers. In a strange way this is different from the…

We present a new correspondence between acyclic orientations and coloring of a signed graph (symmetric graph). Goodall et al. introduced a bivariate chromatic polynomial $\chi_G(k,l)$ that counts the number of signed colorings using colors…

In a pair of recent papers, Andrews, Fraenkel and Sellers provide a complete characterization for the number of $m$-ary partitions modulo $m$, with and without gaps. In this paper we extend these results to the case of coloured $m$-ary…

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 address the enumeration of q-coloured planar maps counted bythe number of edges and the number of monochromatic edges. We prove that the associated generating function is differentially algebraic,that is, satisfies a non-trivial…

In these two companion papers, we give infinite families of partition identities which generalise Primc's and Capparelli's identities, and study their consequences on the theory of crystal bases of the affine Lie algebra $A_{n-1}^{(1)}.$ In…

We say that a permutation p is 'merged' from permutations q and r, if we can color the elements of p red and blue so that the red elements are order-isomorphic to q and the blue ones to r. A 'permutation class' is a set of permutations…

Let $k, d$ ($2d \leq k)$ be two positive integers. We generalize the well studied notions of $(k,d)$-colorings and of the circular chromatic number $\chi_c$ to signed graphs. This implies a new notion of colorings of signed graphs, and the…