Related papers: A combinatorial interpretation for certain plethys…

We give a combinatorial proof of the skew Kostka analogue of the K-saturation theorem. More precisely, for any positive integer k, we give an explicit injection from the set of skew semistandard Young tableaux with skew shape…

This thesis finds its place in the interplay between algebraic and geometric combinatorics. We focus on studying two different families of lattices in relation to the weak order: the permutree lattices and the $s$-weak order. The first part…

We propose a new approach to the combinatorial interpretations of linearization coefficient problem of orthogonal polynomials. We first establish a difference system and then solve it combinatorially and analytically using the method of…

A set S of integers is said to be multiplicative if for every pair m and n of coprime integers we have that mn is in S iff both m and n are in S. Both Landau and Ramanujan gave approximations to S(x), the number of n<=x that are in S, for…

This survey article is devoted to general results in combinatorial enumeration. The first part surveys results on growth of hereditary properties of combinatorial structures. These include permutations, ordered and unordered graphs and…

We study the complexity and expressive power of conjunctive queries over unranked labeled trees represented using a variety of structure relations such as ``child'', ``descendant'', and ``following'' as well as unary relations for node…

We present a decomposition of the generalized binomial coefficients associated with Jack polynomials into two factors: a stem, which is described explicitly in terms of hooks of the indexing partitions, and a leaf, which inherits various…

We use a q-series identity by Ramanujan to give a combinatorial interpretation of Ramanujan's tau function which involves t-cores and a new class of partitions which we call (m,k)-capsids. The same method can be applied in conjunction with…

In this paper we prove a combinatorial theorem for finite labellings of trees, and show that it is equivalent to a theorem for finite covers of metric trees and a fixed point theorem on metric trees. We trace how these connections mimic the…

It is known that the combinatorial classes in the cohomology of the mapping class group of punctures surfaces defined by Witten and Kontsevich are polynomials in the adjusted Miller-Morita-Mumford classes. The leading coefficient was…

While Kronecker coefficients $g(\lambda,\mu,\nu)$ with bounded rows are polynomial-time computable via lattice-point methods, no explicit closed-form formulas have been obtained for genuinely three-row cases in the 87 years since…

Let R_n be the ring of coinvariants for the diagonal action of the symmetric group S_n. It is known that the character of R_n as a doubly-graded S_n module can be expressed using the Frobenius characteristic map as \nabla e_n, where e_n is…

Let $w_{n,k,m}$ be the number of Dyck paths of semilength $n$ with $k$ occurrences of $UD$ and $m$ occurrences of $UUD$. We establish in two ways a new interpretation of the numbers $w_{n,k,m}$ in terms of plane trees and internal nodes.…

Let kK be the path algebra of the Kronecker quiver and consider the category of finite dimensional right modules over kK (called Kronecker modules). We prove that extensions of Kronecker modules are field independent up to Segre classes, so…

Stanley introduces polynomials which help evaluate symmetric group characters and conjectures that the coefficients of the polynomials are positive. Stanley later gives a conjectured combinatorial interpretation for the coefficients of the…

We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies…

We develop a combinatorial model of the associated Hermite polynomials and their moments, and prove their orthogonality with a sign-reversing involution. We find combinatorial interpretations of the moments as complete matchings, connected…

We use Cramer's formula for the inverse of a matrix and a combinatorial expression for the determinant in terms of paths of an associated digraph (which can be traced back to Coates) to give a combinatorial interpretation of M\"obius…

The Exponential Formula allows one to enumerate any class of combinatorial objects built by choosing a set of connected components and placing a structure on each connected component which depends only on its size. There are multiple…

The group $S_4$ of permutations on four elements has an irreducible representation corresponding to the partition 4=2+2. This representation appears in several different mathematical contexts: the Jacobi identity of Lie algebras; the…