Related papers: Signed enumeration of ribbon tableaux

We analyze a combinatorial rule satisfied by the signs of principal minors of a real symmetric matrix. The sign patterns satisfying this rule are equivalent to uniform oriented Lagrangian matroids. We first discuss their structure and…

We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.

We prove that the number of oscillating tableaux of length $n$ with at most $k$ columns, starting at $\emptyset$ and ending at the one-column shape $(1^m)$, is equal to the number of standard Young tableaux of size~$n$ with $m$ columns of…

We introduce a generalization of semistandard composition tableaux called permuted composition tableaux. These tableaux are intimately related to permuted basement semistandard augmented fillings studied by Haglund, Mason and Remmel. Our…

Stanley introduced the chromatic symmetric function of a simple graph, which is a generalization of a chromatic polynomial. This is expressed in terms of the integer points of the complements of the corresponding graphic arrangement.…

Coverings of the Riemann sphere by itself, ramified over two points, are given by so-called Shabat polynomials. The correspondence between Grothendieck's dessins d'enfants and Belyi maps then implies a bijection between Shabat polynomials…

The general normal ordering problem for boson strings is a combinatorial problem. In this note we restrict ourselves to single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, such as…

Baryshnikov and Romik derived the combinatorial identities for the numbers of the $m$-strip tableaux. This generalized the classical Andr\'e's theorem for the number of up-down permutations. They asked for a bijective proof for the…

We study the Steinberg variety associated to matrix Schubert varieties, and develop a Robinson-Schensted type correspondence, $\tau\leftrightarrow(\Lambda,\mathsf Q,\mathsf P)$. Here $\tau$ is a partial permutation of size $p\times q$,…

An identity that is reminiscent of the Littlewood identity plays a fundamental role in recent proofs of the facts that alternating sign triangles are equinumerous with totally symmetric self-complementary plane partitions and that…

Drisko proved that $2n-1$ matchings of size $n$ in a bipartite graph have a rainbow matching of size $n$. For general graphs it is conjectured that $2n$ matchings suffice for this purpose (and that $2n-1$ matchings suffice when $n$ is…

Using the correspondence between a cycle up-down permutation and a pair of matchings, we give a combinatorial proof of the enumeration of alternating permutations according to the given peak set.

Hall-Littlewood functions indexed by rectangular partitions, specialized at primitive roots of unity, can be expressed as plethysms. We propose a combinatorial proof of this formula using A. Schilling's bijection between ribbon tableaux and…

Amdeberhan recently proposed certain equalities between sums in the character table of symmetric groups. These equalities are between signed column sums in the character table, summing over the rows labeled by partitions in $\Ev$, where…

We study Gr\"obner degenerations of Schubert varieties inside flag varieties. We consider toric degenerations of flag varieties induced by matching fields and semi-standard Young tableaux. We describe an analogue of matching field ideals…

In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the…

Combinatorial aspects of multivariate diagonal invariants of the symmetric group are studied. As a consequence it is proved the existence of a multivariate extension of the classical Robinson-Schensted correspondence. Further byproduct are…

We study the distribution of the major index with sign on some parabolic quotients of the symmetric group, extending and generalizing simultaneously results Gessel-Simion and Adin-Gessel-Roichman, and on some special trees that we call…

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…

Two skew diagrams are defined to be equivalent if their corresponding skew Schur functions are equal. The equivalence classes for ribbons have been classified by Billera, Thomas and van Willigenburg in 2006. In this paper, we provide a…