Related papers: An insertion algorithm for multiplying Demazure ch…
Based on the recently proposed character theory of projective representations of finite groups proposed, we generalise several algorithms for computing character tables and matrices of irreducible linear representations to projective…
Demazure characters of type A, which are equivalent to key polynomials, have been decomposed by Lascoux and Sch\"{u}tzenberger into standard bases. We prove that the resulting polynomials, which we call Demazure atoms, can be obtained from…
We give a signed puzzle rule to compute Schubert coefficients. The rule is based on a careful analysis of Knutson's recurrence arXiv:math/0306304. We use the rule to prove polynomiality of the sums of Schubert coefficients with bounded…
We give new algorithms based on the sum-of-squares method for tensor decomposition. Our results improve the best known running times from quasi-polynomial to polynomial for several problems, including decomposing random overcomplete…
We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by…
Revisiting Kra\'skiewicz and Pragacz's construction of Schubert modules, we provide a new proof that their characters are equal to Schubert polynomials. The main innovation is a representation-theoretic interpretation of a recurrence…
A new algorithm to compute the restricted singular value decomposition of dense matrices is presented. Like Zha's method \cite{Zha92}, the new algorithm uses an implicit Kogbetliantz iteration, but with four major innovations. The first…
We give a Littlewood-Richardson type rule for expanding the product of a row-strict quasisymmetric Schur function and a symmetric Schur function in terms of row-strict quasisymmetric Schur functions. We then discuss a family of polynomials…
We continue investigating the superintegrability property of matrix models, i.e. factorization of the matrix model averages of characters. This paper focuses on the Gaussian Hermitian example, where the role of characters is played by the…
We establish the conjecture of Reiner and Yong for an explicit combinatorial formula for the expansion of a Grothendieck polynomial into the basis of Lascoux polynomials. This expansion is a subtle refinement of its symmetric function…
We define convex-geometric counterparts of divided difference (or Demazure) operators from the Schubert calculus and representation theory. These operators are used to construct inductively polytopes that capture Demazure characters of…
We generalize a theorem of Littlewood concerning the factorization of Schur polynomials when their variables are twisted by roots of unity. We show that a certain family of flagged skew Schur polynomials admit a similar factorization. These…
We provide a combinatorial way of computing Speyer's $g$-polynomial on arbitrary Schubert matroids via the enumeration of certain Delannoy paths. We define a new statistic of a basis in a matroid, and express the $g$-polynomial of a…
We describe an algorithm for computing Schur indices of irreducible characters of a finite group $G$, based on computations within $G$ and its subgroups and with their character tables. The algorithm has been implemented within \Magma\ and…
We give a Littlewood-Richardson type rule for expanding the product of a row-strict quasisymmetric Schur function and a symmetric Schur function in terms of row-strict quasisymmetric Schur functions. This expansion follows from several new…
We extend the family non-symmetric Macdonald polynomials and define general-basement Macdonald polynomials. We show that these also satisfy a triangularity property with respect to the monomials bases and behave well under the…
In this paper we extend the Robinson-Schensted-Knuth (RSK) superinsertion algorithm to hook-multipartitions and derive the super Frobenius formula for the characters of cyclotomic Hecke algebras (Linear and Multilinear Algebra, DOI:…
The Schubert polynomials lift the Schur basis of symmetric polynomials into a basis for Z[x1,x2,...]. We suggest the "prism tableau model" for these polynomials. A novel aspect of this alternative to earlier results is that it directly…
We give a combinatorial proof that Postnikov and Stanley's formula for dual Schubert polynomials in terms of weighted chains in Bruhat order is equivalent to a classical Cauchy identity for polynomials. This gives a natural interpretation…
Ikeda-Mihalcea-Naruse's double Schubert polynomials represent the equivariant cohomology classes of Schubert varieties in the type C flag varieties. The goal of this paper is to obtain a new tableau formula of these polynomials associated…