Related papers: Identities for vacillating tableaux via growth dia…

We present identities for permutations with fixed points. The formulas are based on successive derivations or integrations of the determinant of a particular matrix.

The partition functions $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, and $Q(n,m,p)$, the number of integer partitons of $n$ into exactly $m$ distinct parts with each part at most…

In this work, we give combinatorial proofs for generating functions of two problems, i.e., flushed partitions and concave compositions of even length. We also give combinatorial interpretation of one problem posed by Sylvester involving…

A definition is offered of the factorial characters of the general linear group, the symplectic group and the orthogonal group in an odd dimensional space. It is shown that these characters satisfy certain flagged Jacobi-Trudi identities.…

Using the diagrammatic approach to integrals over Gaussian random matrices, we find a representation for polynomial Lie group integrals as infinite sums over certain maps on surfaces. The maps involved satisfy a specific condition: they…

A necessary and sufficient condition is presented for a graph algebra to satisfy a bracketing identity. The associative spectrum of an arbitrary graph algebra is shown to be either constant or exponentially growing.

The idea of implicit representation of graphs was introduced in [S. Kannan, M. Naor, S. Rudich, Implicit representation of graphs, SIAM J. Discrete Mathematics, 5 (1992) 596--603] and can be defined as follows. A representation of an…

In this paper, we explore some interesting applications of the matrix tree theorem. In particular, we present a combinatorial interpretation of a distribution of $(n-1)^{n-1}$, in the context of uprooted spanning trees of the complete graph…

This is a sequel to math.AG/0003009. Here we study identities for the Fourier transform of "elementary functions" over finite field containing "exponents" of monomial rational functions. It turns out that these identities are governed by…

By a re-examination of MacMahon's original proof of his celebrated theorem on the distribution of the major indices over permutations, we give a reformulation of his argument in terms of the structure of labeled partitions. In this…

In this paper we give a combinatorial proof and refinement of a Rogers-Ramanujan type partition identity of Siladi\'c arising from the study of Lie algebras. Our proof uses generating functions and $q$-difference equations.

Let $\mathsf{mSt}_n$ be the plactic-like monoid obtained by factoring the free monoid over a finite alphabet $\mathcal{A}_n$ by the meet of the stalactic congruence and its dual. In this paper, we prove that $\mathsf{mSt}_n$ can be equipped…

A categorical theory for the discretization of a large class of dynamical systems with variable coefficients is proposed. It is based on the existence of covariant functors between the Rota category of Galois differential algebras and…

We introduce cyclic diagram monoids, a generalisation of classical diagram monoids that adds elements of arbitrary period by including internal components, with a view towards cryptography. We classify their simple representations and…

In a recent paper by L. Fel two new identities for the degree of syzygies are given. We present an algebraic proof of them, using only basic homological algebra tools. We also extend these results.

We show that the subgraph induced in Young's graph by the set of partitions with an odd number of standard Young tableaux is a binary tree. This tree exhibits self-similarities at all scales, and has a simple recursive description.

Explicit expressions for the Temperley-Lieb-Martin algebras, i.e., the quotients of the Hecke algebra that admit only representations corresponding to Young diagrams with a given maximum number of columns (or rows), are obtained, making…

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 study certain bijection between plane partitions and $\mathbb{N}$-matrices. As applications, we prove a Cauchy-type identity for generalized dual Grothendieck polynomials. We introduce two statistics on plane partitions, whose generating…

Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.