Related papers: Bijective Approaches for Schmidt-Type Theorems

We construct the independent particle representation for the Semistandard Young Tableaux (SsYT) of skew shape $\lambda/\mu.$ The partition function of this particle system gives the generating function of the SsYT of skew shape…

In this paper, we confirm conjectures of Laborde-Zubieta on the enumeration of corners in tree-like tableaux and in symmetric tree-like tableaux. In the process, we also enumerate corners in (type $B$) permutation tableaux and (symmetric)…

In 2015, Bringmann, Lovejoy and Mahlburg considered certain kinds overpartitions, which can been seen as the overpartition analogue of Schur's partition. The motivation of their work is that the difference between the generating function of…

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…

Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…

P.L. Erdos and L.A. Szekely [Adv. Appl. Math. 10(1989), 488-496] gave a bijection between rooted semilabeled trees and set partitions. L.H. Harper's results [Ann. Math. Stat. 38(1967), 410-414] on the asymptotic normality of the Stirling…

In this paper we show a a proof by explicit bijections of the famous Kirkman-Cayley formula for the number of dissections of a convex polygon. Our starting point is the bijective correspondence between the set of nested sets made by \(k\)…

We show how to represent a class of expressions involving discrete sums over partitions as matrix models. We apply this technique to the partition functions of 2* theories, i.e. Seiberg-Witten theories with the massive hypermultiplet in the…

We generalize the well known Glaisher partition bijection result. For given positive integers n, d, both greater than 1, we provide a rich family of bijections between the set of partitions of n where at least one part is divisible by d,…

As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we…

A (semi)brick over an algebra $A$ is a module $S$ such that the endomorphism ring $\operatorname{\mathsf{End}}_A(S)$ is a (product of) division algebra. For each Dynkin diagram $\Delta$, there is a bijection from the Coxeter group $W$ of…

In a recent paper, Andrews and Merca investigated the number of even parts in all partitions of $n$ into distinct parts, which arise naturally from the Euler-Glaisher bijective proof. They obtained new combinatorial interpretations for this…

A permutation can be locally classified according to the four local types: peaks, valleys, double rises and double falls. The corresponding classification of binary increasing trees uses four different types of nodes. Flajolet demonstrated…

We present a simple bijection between permutation matrices and descending plane partitions without special parts. This bijection is already mentioned in work of P. Lalonde (without giving the details); it involves the inversion words of…

Consider these two distinct combinatorial objects: (1) the necklaces of length $n$ with at most $q$ colors, and (2) the multisets of integers modulo $n$ with subset sum divisible by $n$ and with the multiplicity of each element being…

The goal of the paper is two-fold. At first, we attempt to give a survey of some recent applications of symmetric polynomials and divided differences to intersection theory. We discuss: polynomials universally supported on degeneracy loci;…

We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…

We generalize overpartitions to (k,j)-colored partitions: k-colored partitions in which each part size may have at most j colors. We find numerous congruences and other symmetries. We use a wide array of tools to prove our theorems:…

We give a bijective proof of an identity relating primed shifted gl(n)-standard tableaux to the product of a gl(n) character in the form of a Schur function and a product of sums of x and y terms. This result generalises a number of…

The number of sequences of odd length in strict partitions (denoted as $\mathrm{sol}$), which plays a pivotal role in the first paper of this series, is investigated in different contexts, both new and old. Namely, we first note a direct…