Related papers: Bijective proofs of skew Schur polynomial factoriz…
We define two refinements of the skew length statistic on simultaneous core partitions. The first one relies on hook lengths and is used to prove a refined version of the theorem stating that the skew length is invariant under conjugation…
Reiner, Shaw and van Willigenburg showed that if two skew Schur functions s_A and s_B are equal, then the skew shapes A and B must have the same "row overlap partitions." Here we show that these row overlap equalities are also implied by a…
Graph reordering is a powerful technique to increase the locality of the representations of graphs, which can be helpful in several applications. We study how the technique can be used to improve compression of graphs and inverted indexes.…
The polynomial ring $B$ in infinitely many indeterminates $(x_1,x_2,\ldots)$, with rational coefficients, has a vector space basis of Schur polynomials, parametrized by partitions. The goal of this note is to provide an explanation of the…
Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and…
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,…
In this paper, we study Grothendieck polynomials from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials, analogues of the factorial Schur functions and present some of their properties, and use them to produce a…
We consider the factorization problem in toy models of holography, in SYK and in Matrix Models. In a theory with fixed couplings, we introduce a fictitious ensemble averaging by inserting a projector onto fixed couplings. We compute the…
This paper contains a partial answer to the open problem 3.11 of \cite{[H2008]}. That is to find an explicit bijection on Schr\"oder paths that inverts the statistics area and bounce. This paper started as an attempt to write the sum over…
We introduce a new combinatorial object, semistandard increasing decomposition tableau and study its relation to a semistandard decomposition tableau introduced by Kra\'skiewicz and developed by Lam and Serrano. We also introduce…
The question of when two skew Young diagrams produce the same skew Schur function has been well-studied. We investigate the same question in the case of stable Grothendieck polynomials, which are the K-theoretic analogues of the Schur…
An element of a Weyl group of classical type is skew if it is the left factor in a reduced factorization of a Grassmannian element. The skew Grothendieck polynomials are those which are indexed by skew elements of the Weyl group. We define…
In 1995, the first author introduced a multivariate generating function {$G$} that tracks the distribution of ascents and descents in labeled binary trees. In addition to proving that $G$ is symmetric, he conjectured that $G$ is Schur…
A classical result by Kreweras (1965) allows one to compute the number of plane partitions of a given skew shape and bounded parts as certain determinants. We prove that these determinants expand as polynomials with nonnegative…
We study the Schur algebra counterpart of a vast class of quantum wreath products. This is achieved by developing a theory of twisted convolution algebras, inspired by geometric intuition. In parallel, we provide an algebraic Schurification…
This paper proposes a family of permutation-invariant graph embeddings, generalizing the Skew Spectrum of graphs of Kondor & Borgwardt (2008). Grounded in group theory and harmonic analysis, our method introduces a new class of graph…
We study a family of polynomials whose values express degrees of Schubert varieties in the generalized complex flag manifold G/B. The polynomials are given by weighted sums over saturated chains in the Bruhat order. We derive several…
Starting with an inclusion-exclusion proof of a combinatorial identity, a direct bijection can be produced using recursive subtraction (sometimes with a direct combinatorial description). We apply this method to identities for generalized…
We study the Schur polynomial expansion of a family of symmetric polynomials related to the refined enumeration of alternating sign matrices with respect to their inversion number, complementary inversion number and the position of the…
We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…