Related papers: An iterative-bijective approach to generalizations…

Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m-1$ times is equal to the number of partitions of $n$ into parts which are not divisible by $m$. The $m=2$ case is Euler's famous partition…

The symmetric Grothendieck polynomials generalize Schur polynomials and are Schur-positive by degree. Combinatorially this is manifested as the generalization of semistandard Young tableaux by set-valued tableaux. We define a (weak)…

Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number is satisfied. We generalize three theorems of this kind,…

This is a short note about Schur positivity. We introduce Schur polynomials and explain how they appear in the representation theory of the general linear group. We end with a new result of the author with F. Bergeron and V. Reiner that…

Using techniques from integrable systems, we obtain a number of exact results for random partitions. In particular, we prove a simple formula for correlation functions of what we call the Schur measure on partitions (which is a far reaching…

We resolve the Ramsey problem for $\{x,y,z:x+y=p(z)\}$ for all polynomials $p$ over $\mathbb{Z}$. In particular, we characterise all polynomials that are $2$-Ramsey, that is, those $p(z)$ such that any $2$-colouring of $\mathbb{N}$ contains…

We define and study a new class of bialgebras, which generalize certain Turner double algebras related to generic blocks of symmetric groups. Bases and generators of these algebras are given. We investigate when the algebras are symmetric,…

We prove a general theorem that gives a linear recurrence for tuples of paths in every cylindrical network. This can be seen as a cylindrical analog of the Lindstr\"om-Gessel-Viennot theorem. We illustrate the result by applying it to Schur…

The chromatic polynomial and its generalization, the chromatic symmetric function, are two important graph invariants. Celebrated theorems of Birkhoff, Whitney, and Stanley show how both objects can be expressed in three different ways: as…

The generalized composition graph is used by Cardoso and some researchers for factorization of the adjacency spectrum and Laplacian of a simple graph. Because the generalized composition graph is an example of a set-theoretic linear operad,…

This work highlights the existence of partial symmetries in large families of iterated plethystic coefficients. The plethystic coefficients involved come from the expansion in the Schur basis of iterated plethysms of Schur functions indexed…

In a work of 1995, Alladi, Andrews, and Gordon provided a generalization of the two Capparelli identities involving certain classes of integer partitions. Inspired by that contribution, in particular as regards the general setting and the…

A class of generalized Schr\"{o}dinger problems in bounded domain is studied. A complete overview of the set of solutions is provided, depending on the values assumed by parameters involved in the problem. In order to obtain the results, we…

We define a generic multiplication in quantised Schur algebras and thus obtain a new algebra structure in the Schur algebras. We prove that via a modified version of the map from quantum groups to quantised Schur algebras, defined by A. A.…

We generalize the "motivated proof" of the Rogers-Ramanujan identities given by Andrews and Baxter to provide an analogous "motivated proof" of Gordon's generalization of the Rogers-Ramanujan identities. Our main purpose is to provide…

I settle a conjecture of Andrews related to the Alladi-Schur polynomials. In addition, I give further relations and implications to two families of polynomials related to the Alladi-Schur polynomials.

Here, we establish a polynomial identity in three variables $a, b, c$, and with the degree of the polynomial given in terms of two integers $L, M$. By letting $L$ and $M$ tend to infinity, we get the 1993 Alladi-Gordon $q$-hypergeometric…

Recently, Andrews and EI Bachraoui obtained several iden tities on two-colored partitions. While solving open problems they posed, Chen and Zhou derived a number of identities using analytic methods and asked for combinatorial proofs. In…

We prove that the set of matchings with a fixed number of unmatched vertices is Schur-positive with respect to the set of short chords. Two proofs are presented. The first proof applies a new combinatorial criterion for Schur-positivity,…

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;…