Four positive formulae for type A quiver polynomials

We give four positive formulae for the (equioriented type A) quiver polynomials of Buch and Fulton [BF99 ]. All four formulae are combinatorial, in the sense that they are expressed in terms of combinatorial objects of certain types: Zelevinsky permutations, lacing diagrams, Young tableaux, and pipe dreams (also known as rc-graphs). Three of our formulae are multiplicity-free and geometric, meaning that their summands have coefficient 1 and correspond bijectively to components of a torus-invariant scheme. The remaining (presently non-geometric) formula is a variant of the conjecture of Buch and Fulton in terms of factor sequences of Young tableaux [BF99 ]; our proof of it proceeds by way of a new characterization of the tableaux counted by quiver constants. All four formulae come naturally in “doubled” versions, two for double quiver polynomials, and the other two for their stable limits, the double quiver functions, where setting half the variables equal to the other half specializes to the ordinary case. Our method begins by identifying quiver polynomials as multidegrees [BB82 , Jos84 , BB85 , Ros89 ] via equivariant Chow groups [EG98 ]. Then we make use of Zelevinsky’s map from quiver loci to open subvarieties of Schubert varieties in partial flag manifolds [Zel85 ]. Interpreted in equivariant cohomology, this lets us write double quiver polynomials as ratios of double Schubert polynomials [LS82 ] associated to Zelevinsky permutations; this is our first formula. In the process, we provide a simple argument that Zelevinsky maps are scheme-theoretic isomorphisms (originally proved in [LM98 ]). Writing double Schubert polynomials in terms of pipe dreams [FK96 ] then provides another geometric formula for double quiver polynomials, via [KM05 ]. The combinatorics of pipe dreams for Zelevinsky permutations implies an expression for limits of double quiver polynomials in terms of products of Stanley symmetric functions [Sta84 ]. A degeneration of quiver loci (orbit closures of GL on quiver representations) to unions of products of matrix Schubert varieties [Ful92 , KM05 ] identifies the summands in our Stanley function formula combinatorially, as lacing diagrams that we construct based on the strands of Abeasis and Del Fra in the representation theory of quivers [AD80 ]. Finally, we apply the combinatorial theory of key polynomials to pass from our lacing diagram formula to a double Schur function formula in terms of peelable tableaux [RS95a , RS98 ], and from there to our formula of Buch–Fulton type.     

Skew Schubert polynomials

We define skew Schubert polynomials to be normal form (polynomial) representatives of certain classes in the cohomology of a flag manifold. We show that this definition extends a recent construction of Schubert polynomials due to Bergeron and Sottile in terms of certain increasing labeled chains in Bruhat order of the symmetric group. These skew Schubert polynomials expand in the basis of Schubert polynomials with nonnegative integer coefficients that are precisely the structure constants of the cohomology of the complex flag variety with respect to its basis of Schubert classes. We rederive the construction of Bergeron and Sottile in a purely combinatorial way, relating it to the construction of Schubert polynomials in terms of rc-graphs.

     

Schubert polynomials and Bott-Samelson varieties

Schubert polynomials generalize Schur polynomials, but it is not clear how to generalize several classical formulas: the Weyl character formula, the Demazure character formula, and the generating series of semistandard tableaux. We produce these missing formulas and obtain several surprising expressions for Schubert polynomials.?The above results arise naturally from a new geometric model of Schubert polynomials in terms of Bott-Samelson varieties. Our analysis includes a new, explicit construction for a Bott-Samelson variety Z as the closure of a B-orbit in a product of flag varieties. This construction works for an arbitrary reductive group G, and for G = GL(n) it realizes Z as the representations of a certain partially ordered set.?This poset unifies several well-known combinatorial structures: generalized Young diagrams with their associated Schur modules; reduced decompositions of permutations; and the chamber sets of Berenstein-Fomin-Zelevinsky, which are crucial in the combinatorics of canonical bases and matrix factorizations. On the other hand, our embedding of Z gives an elementary construction of its coordinate ring, and allows us to specify a basis indexed by tableaux. Received: November 27, 1997     

Combinatorics of the K-theory of affine Grassmannians

We introduce a family of tableaux that simultaneously generalizes the tableaux used to characterize Grothendieck polynomials and k-Schur functions. We prove that the polynomials drawn from these tableaux are the affine Grothendieck polynomials and k-K-Schur functions – Schubert representatives for the K-theory of affine Grassmannians and their dual in the nil Hecke ring. We prove a number of combinatorial properties including Pieri rules.     

Skew Schubert functions and the Pieri formula for flag manifolds

We show the equivalence of the Pieri formula for flag manifolds with certain identities among the structure constants for the Schubert basis of the polynomial ring. This gives new proofs of both the Pieri formula and of these identities. A key step is the association of a symmetric function to a finite poset with labeled Hasse diagram satisfying a symmetry condition. This gives a unified definition of skew Schur functions, Stanley symmetric functions, and skew Schubert functions (defined here). We also use algebraic geometry to show the coefficient of a monomial in a Schubert polynomial counts certain chains in the Bruhat order, obtainng a combinatorial chain construction of Schubert polynomials.

     

Maximal 0–1-fillings of moon polyominoes with restricted chain lengths and rc-graphs

We show that maximal 0–1-fillings of moon polynomials with restricted chain lengths can be identified with certain rc-graphs, also known as pipe dreams. In particular, this exhibits a connection between maximal 0–1-fillings of Ferrers shapes and Schubert polynomials. Moreover, it entails a bijective proof showing that the number of maximal fillings of a stack polyomino S with no north-east chains longer than k depends only on k and the multiset of column heights of S.     

A Bijection from Staircase Tableaux to Inversion Tables,Giving Some Eulerian and Mahonian Statistics

We give a simple bijection between staircase tableaux and inversion tables. Some nice properties of the bijection allow us to easily compute the generating polynomials of subsets of the staircase tableaux. We also give a combinatorial interpretation of some statistics of these tableaux in terms of permutations.     

Multiplication of a Schubert polynomial by a Schur polynomial

Schur polynomials are a special case of Schubert polynomials. In this paper, we give an algorithm to compute the product of a Schubert polynomial with a Schur polynomial on the basis of Schubert polynomials. This is a special case of the general problem of the multiplication of two Schubert polynomials, where the corresponding algorithm is still missing. The main tools for the given algorithm is a factorization property of a special class of Schubert polynomials and the transition formula for Schubert polynomials.     

Combinatorial Aspects of the K-Theory of Grassmannians

In this paper we study Grothendieck polynomials indexed by Grassmannian permutations, which are representatives for the classes corresponding to the structure sheaves of Schubert varieties in the K-theory of Grassmannians. These Grothendieck polynomials are nonhomogeneous symmetric polynomials whose lowest homogeneous component is a Schur polynomial. Our treatment, which is closely related to the theory of Schur functions, gives new information about these polynomials. Our main results are concerned with the transition matrices between Grothendieck polynomials indexed by Grassmannian permutations and Schur polynomials on the one hand and a Pieri formula for these Grothendieck polynomials on the other.     

Schubert polynomials of types A--D

Schubert polynomials of type B, C, and D have been described first by S. Billey and M. Haiman [BH] using a combinatorial method. In this paper we give a unified algebraic treatment of Schubert polynomials of types A–D in the style of the Lascoux–Schützenberger theory in type A, i.e. Schubert polynomials are generated by the application of sequences of divided difference operators to “top polynomials”. The use of the creation operators for Q-Schur and P-Schur functions allows us to give: (1) simple and natural forms of the “top polynomials”, (2) formulas for the easy computation with all divided differences, (3) recursive structures, and (4) simplified derivations of basic properties. Received: 23 July 1998     

Greek letters in random staircase tableaux

In this paper we study a relatively new combinatorial object called staircase tableaux. Staircase tableaux were introduced by Corteel and Williams in the connection with Asymmetric Exclusion Process and has since found interesting connections with Askey–Wilson polynomials. We develop a probabilistic approach that allows us to analyze several parameters of a randomly chosen staircase tableau of a given size. In particular, we obtain limiting distributions for statistics associated with appearances of Greek letters in staircase tableaux. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012     

Pieri’s formula for generalized Schur polynomials

Young's lattice, the lattice of all Young diagrams, has the Robinson-Schensted-Knuth correspondence, the correspondence between certain matrices and pairs of semi-standard Young tableaux with the same shape. Fomin introduced generalized Schur operators to generalize the Robinson-Schensted-Knuth correspondence. In this sense, generalized Schur operators are generalizations of semi-standard Young tableaux. We define a generalization of Schur polynomials as expansion coefficients of generalized Schur operators. We show that the commutation relation of generalized Schur operators implies Pieri's formula for generalized Schur polynomials.     

Chains in the Bruhat order

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 explicit formulas for these polynomials, and investigate their relations with Schubert polynomials, harmonic polynomials, Demazure characters, and generalized Littlewood-Richardson coefficients. In the second half of the paper, we study the classical flag manifold and discuss related combinatorial objects: flagged Schur polynomials, 312-avoiding permutations, generalized Gelfand-Tsetlin polytopes, the inverse Schubert-Kostka matrix, parking functions, and binary trees. A.P. was supported in part by National Science Foundation grant DMS-0201494 and by Alfred P. Sloan Foundation research fellowship. R.S. was supported in part by National Science Foundation grant DMS-9988459.     

Young-Fibonacci insertion, tableauhedron and Kostka numbers

This work is first concerned with some properties of the Young-Fibonacci insertion algorithm and its relation with Fomin's growth diagrams. It also investigates a relation between the combinatorics of Young-Fibonacci tableaux and the study of Okada's algebras associated to the Young-Fibonacci lattice. The original algorithm was introduced by Roby and we redefine it in such a way that both the insertion and recording tableaux of any permutation are conveniently interpreted as saturated chains in the Young-Fibonacci lattice. Using our conventions, we give a simpler proof of a property of Killpatrick's evacuation algorithm for Fibonacci tableaux. It also appears that this evacuation is no longer needed in making Roby's and Fomin's constructions coincide. We provide the set of Young-Fibonacci tableaux of size n with a structure of graded poset called tableauhedron, induced by the weak order of the symmetric group, and realized by transitive closure of elementary transformations on tableaux. We show that this poset gives a combinatorial interpretation of the coefficients of the transition matrix from the analogue of complete symmetric functions to analogue of the Schur functions in Okada's algebra associated to the Young-Fibonacci lattice. We prove a similar result relating usual Kostka numbers with four partial orders on Young tableaux, studied by Melnikov and Taskin.     

Arc permutations

Arc permutations and unimodal permutations were introduced in the study of triangulations and characters. This paper studies combinatorial properties and structures on these permutations. First, both sets are characterized by pattern avoidance. It is also shown that arc permutations carry a natural affine Weyl group action, and that the number of geodesics between a distinguished pair of antipodes in the associated Schreier graph, and the number of maximal chains in the weak order on unimodal permutations, are both equal to twice the number of standard Young tableaux of shifted staircase shape. Finally, a bijection from non-unimodal arc permutations to Young tableaux of certain shapes, which preserves the descent set, is described and applied to deduce a conjectured character formula of Regev.     

Generalised discriminants, deformed Calogero-Moser-Sutherland operators and super-Jack polynomials

It is shown that the deformed Calogero-Moser-Sutherland (CMS) operators can be described as the restrictions on certain affine subvarieties (called generalised discriminants) of the usual CMS operators for infinite number of particles. The ideals of these varieties are shown to be generated by the Jack symmetric functions related to the Young diagrams with special geometry. A general structure of the ideals which are invariant under the action of the quantum CMS integrals is discussed in this context. The shifted super-Jack polynomials are introduced and combinatorial formulas for them and for super-Jack polynomials are given.     

Growth diagrams for the Schubert multiplication

We present a partial generalization of the classical Littlewood-Richardson rule (in its version based on Schützenberger's jeu de taquin) to Schubert calculus on flag varieties. More precisely, we describe certain structure constants expressing the product of a Schubert and a Schur polynomial. We use a generalization of Fomin's growth diagrams (for chains in Young's lattice of partitions) to chains of permutations in the so-called k-Bruhat order. Our work is based on the recent thesis of Beligan, in which he generalizes the classical plactic structure on words to chains in certain intervals in k-Bruhat order. Potential applications of our work include the generalization of the S₃-symmetric Littlewood-Richardson rule due to Thomas and Yong, which is based on Fomin's growth diagrams.     

Double Schubert polynomials for the classical groups

For each infinite series of the classical Lie groups of type B, C or D, we construct a family of polynomials parametrized by the elements of the corresponding Weyl group of infinite rank. These polynomials represent the Schubert classes in the equivariant cohomology of the appropriate flag variety. They satisfy a stability property, and are a natural extension of the (single) Schubert polynomials of Billey and Haiman, which represent non-equivariant Schubert classes. They are also positive in a certain sense, and when indexed by maximal Grassmannian elements, or by the longest element in a finite Weyl group, these polynomials can be expressed in terms of the factorial analogues of Schur's Q- or P-functions defined earlier by Ivanov.     

Bruhat order, smooth Schubert varieties, and hyperplane arrangements

The aim of this article is to link Schubert varieties in the flag manifold with hyperplane arrangements. For a permutation, we construct a certain graphical hyperplane arrangement. We show that the generating function for regions of this arrangement coincides with the Poincaré polynomial of the corresponding Schubert variety if and only if the Schubert variety is smooth. We give an explicit combinatorial formula for the Poincaré polynomial. Our main technical tools are chordal graphs and perfect elimination orderings.     

On combinatorial formulas for Macdonald polynomials

A recent breakthrough in the theory of (type A) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of a pair of statistics on fillings of Young diagrams. Ram and Yip gave a formula for the Macdonald polynomials of arbitrary type in terms of so-called alcove walks; these originate in the work of Gaussent-Littelmann and of the author with Postnikov on discrete counterparts to the Littelmann path model. In this paper, we relate the above developments, by explaining how the Ram-Yip formula compresses to a new formula, which is similar to the Haglund-Haiman-Loehr one but contains considerably fewer terms.