相关论文: Another refinement of the Bender-Knuth (ex-)Conjec…

Donald Knuth recently introduced the notion of a Baxter matrix, generalizing Baxter permutations. We show that for fixed number of rows, $r$, the number of Baxter matrices with $r$ rows and $k$ columns eventually satisfies a polynomial in…

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…

We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…

The connection between the generating functions of various sets of tableaux and the appropriate families of quasisymmetric functions is a significant tool to give a direct analytical proof of some advanced bijective results and provide new…

Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…

Building on work of Hardy and Ramanujan, Rademacher proved a well-known formula for the values of the ordinary partition function $p(n)$. More recently, Bruinier and Ono obtained an algebraic formula for these values. Here we study the…

We prove a new formula for the generating function of polynomials counting absolutely stable representations of quivers over finite fields. The case of irreducible representations is studied in more detail.

Branched covers of the complex projective line ramified over $0,1$ and $\infty$ (Grothendieck's {\em dessins d'enfant}) of fixed genus and degree are effectively enumerated. More precisely, branched covers of a given ramification profile…

We resolve an open conjecture from algebraic geometry, which states that two generating functions for plane partition-like objects (the "box-counting" formulae for the Calabi-Yau topological vertices in Donaldson-Thomas theory and…

We give explicit positive combinatorial interpretations for the plethysm coefficients $\langle s_\mu[s_\nu], s_\lambda\rangle$, when $\lambda$ has at most two rows, as counting certain marked trees. In the special case $\mu=(n)$, this also…

We construct a vertex model whose partition function is a refined dual Grothendieck polynomial, where the states are interpreted as nonintersecting lattice paths. Using this, we show refined dual Grothendieck polynomials are multi-Schur…

The Kronecker coefficients are the structure constants for the restriction of irreducible representations of the general linear group $GL(n m)$ into irreducibles for the subgroup $GL(n)\times GL(m)$. In this work we study the…

We develop a method to construct elusive functions using techniques of commutative algebra and algebraic geometry. The key notions of this method are elusive subsets and evaluation mappings. We also develop the effective elimination theory…

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

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

Using elementary methods, we prove new formulas for $\operatorname{pp}(n)$, the number of plane partitions of $n$, $\operatorname{pp}_r(n)$, the number of plane partitions of $n$ with at most $r$ rows, $\operatorname{pp}^s(n)$, the number…

We define a counting function that is related to the binomial coefficients. An explicit formula for this function is proved. In some particular cases, simpler explicit formuls are derived. We also derive a formula for the number of…

The fact that Schubert polynomials are the weighted counting functions for reduced RC-graphs, also known as reduced pipe dreams, was established using their generating functions inside an appropriate Demazure algebra. Here we investigate…

We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by…

We examine combinatorial counting functions with two parameters, $n$ and $q$. For fixed $q$, these functions are (quasi-)polynomial in $n$. As $q$ varies, the degree of this polynomial is itself polynomial in $q$, as are the leading…