Related papers: Neighborly partitions, hypergraphs and Gordon's id…
We show how certain suitably modified N-modular diagrams of integer partitions provide a nice combinatorial interpretation for the general term of Zeilberger's KOH identity. This identity is the reformulation of O'Hara's famous proof of the…
In this paper, we provide combinatorial proofs for certain partition identities which arise naturally in the context of Langlands' beyond endoscopy proposal. These partition identities motivate an explicit plethysm expansion of…
The Alladi-Gordon identity plays an important role for the Alladi-Gordon generalization of Schur's partition theorem. By using Joichi-Stanton's insertion algorithm, we present an overpartition interpretation for the Alladi-Gordon key…
We propose and prove a new polynomial identity that implies Schur's partition theorem. We give combinatorial interpretations of some of our expressions in the spirit of Kur\c{s}ung\"oz. We also present some related polynomial and $q$-series…
In this paper we prove the identity that generalizes the Andrews-Gordon identity. Also we discuss the relation of our formula to the geometry of affine flag varieties and to the geometry of polyhedra.
In this brief note a straightforward combinatorial proof for an identity directly connecting rooted forests and unordered set partitions is provided. Furthermore, references that put this type of identity in the context of forest volumes…
An identity that is reminiscent of the Littlewood identity plays a fundamental role in recent proofs of the facts that alternating sign triangles are equinumerous with totally symmetric self-complementary plane partitions and that…
We introduce two remarkable identities written in terms of single commutators and anticommutators for any three elements of arbitrary associative algebra. One is a consequence of other (fundamental identity). From the fundamental identity,…
In this paper we conjecture combinatorial Rogers-Ramanujan type colored partition identities related to standard representations of the affine Lie algebra of type $C^{(1)}_\ell$, $\ell\geq2$, and we conjecture similar colored partition…
The paper consider an equivalence relation in the set of vertices of a bipartite graph. Some numerical characteristics showing the cardinality of equivalence classes are introduced. A combinatorial identity that is in relationship to these…
We provide a refinement of MacMahon's partition identity on sequence-avoiding partitions, and use it to produce another mod 6 partition identity. In addition, we show that our technique also extends to cover Andrews's generalization of…
We obtain a finite form of Jacobi's identity and present a combinatorial proof based on the structure of synchronized partitions.
We show that the homology of the partition algebras, interpreted as appropriate Tor-groups, is isomorphic to that of the symmetric groups in a range of degrees that increases with the number of nodes. Furthermore, we show that when the…
In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called {\it partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…
Graph partitioning, or the dividing of a graph into two or more parts based on certain conditions, arises naturally throughout discrete mathematics, and problems of this kind have been studied extensively. In the 1990s, Ando conjectured…
Andrews and El Bachraoui recently studied various two-colored integer partitions, including those related to two-colored partitions into distinct parts with constraints and overpartitions. Their work raised questions about the existence of…
Associated to a graph $G$ is a set $\mathcal{S}(G)$ of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be…
In 1980, Bressoud conjectured a combinatorial identity $A_j=B_j$ for $j=0$ or $1$, where the function $A_j$ counts the number of partitions with certain congruence conditions and the function $B_j$ counts the number of partitions with…
The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…
We present what we call a "motivated proof" of the Andrews-Bressoud partition identities for even moduli. A "motivated proof" of the Rogers-Ramanujan identities was given by G. E. Andrews and R. J. Baxter, and this proof was generalized to…