Related papers: Set-valued Rothe Tableaux and Grothendieck Polynom…
Characterizing sets of permutations whose associated quasisymmetric function is symmetric and Schur-positive is a long-standing problem in algebraic combinatorics. In this paper we present a general method to construct Schur-positive sets…
In this paper, we firstly extend a result of Bonin, Shapiro and Simion by giving the distribution of the major index over generalized Schr\"{o}der paths. Then by providing a bijection between generalized Schr\"{o}der paths and…
A homogeneous bivariate $d$-form defines an $(i+1)$-rowed Toeplitz matrix for each $i$ between $0$ and $d$. We use Hodge theory and Schur polynomials to prove that if the $(i+1)$-rowed Toeplitz matrix of a form is totally nonnegative, then…
The noncommutative (or mixed) trace algebra $T_{nd}$ is generated by $d$ generic $n\times n$ matrices and by the algebra $C_{nd}$ generated by all traces of products of generic matrices, $n,d\geq 2$. It is known that over a field of…
We consider the fusion algebras arising in e.g. Wess-Zumino-Witten conformal field theories, affine Kac-Moody algebras at positive integer level, and quantum groups at roots of unity. Using properties of the modular matrix $S$, we find…
A Littlewood identity is an identity equating a sum of Schur functions with an infinite product. A bounded Littlewood identity is one where the sum is taken over the partitions with a bounded number of rows or columns. The price to pay is…
We propose a new formula to compute Witten--Kontsevich intersection numbers. It is a closed formula, not involving recursion neither solving equations. It only involves sums over partitions of products of factorials, double factorials and…
Fix an integer partition lambda that has no more than n parts. Let beta be a weakly increasing n-tuple with entries from {1,..,n}. The flagged Schur function indexed by lambda and beta is a polynomial generating function in x_1, .., x_n for…
Let $w$ be a permutation of $\{1,2,\ldots,n \}$, and let $D(w)$ be the Rothe diagram of $w$. The Schubert polynomial $\mathfrak{S}_w(x)$ can be realized as the dual character of the flagged Weyl module associated to $D(w)$. This implies a…
Like the LR-tableau, a socle tableau is given as a skew diagram with certain entries. Unlike in the LR-tableau, the entries in the socle tableau are weakly increasing in each row, strictly increasing in each column and satisfy a modified…
The K-theoretic Littlewood-Richardson rule, established by A. Buch, is a combinatorial method for counting the structure constants involved in the product of two Grothendieck polynomials of Grassmannian type. In this paper, we provide an…
We consider real polynomial systems $f=g=0$ in two variables where $f$ has $t\geq 3$ monomial terms and $g$ has $3$ monomials terms. We prove that the number of positive isolated solutions of such a system does not exceed $3\cdot 2^{t-2} -…
We give a new formula for double Grothendieck polynomials based on Magyar's orthodontia algorithm for diagrams. Our formula implies a similar formula for double Schubert polynomials $\mathfrak S_w(\mathbf x;\mathbf y)$. We also prove a…
In this paper, we employ a version of Stepanov's method, developed by Hanson and Petridis, to prove several results on additive irreducibility of multiplicative subgroups in finite fields of prime order $p$. Specifically, we show that if a…
We show that for any permutation $\pi$ there exists an integer $k_{\pi}$ such that every permutation avoiding $\pi$ as a pattern is a product of at most $k_{\pi}$ separable permutations. In other words, every strict class $\mathcal C$ of…
Motivated by work of Buch on set-valued tableaux in relation to the K-theory of the Grassmannian, we study six combinatorial Hopf algebras. These Hopf algebras can be thought of as K-theoretic analogues of the by now classical ``square'' of…
We show that the Young tableaux theory and constructions of the irreducible representations of the Weyl groups of type A, B and D, Iwahori-Hecke algebras of types A, B, and D, the complex reflection groups G(r,p,n) and the corresponding…
We introduce the structure of vacillating Hecke tableaux, and establish a one-to-one correspondence between vacillating Hecke tableaux and linked partitions by using the Hecke insertion algorithm developed by Buch, Kresch, Shimozono,…
A difficult problem in the theory of random tensors is to calculate the expectation values of polynomials in the tensor entries, even in the large N limit and in a Gaussian distribution. Here we address this issue, focusing on a family 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…