相关论文: Simple Procedures for Left and Right Keys of Semi-…

The right key of a semistandard Young tableau is a tool used to find Demazure characters for $sl_n(\mathbb{C})$. This thesis gives methods to obtain the right and left keys by inspection of the semistandard Young tableau. Given a partition…

The right and left key of a semistandard Young tableau were introduced by Lascoux and Schutzenberger in 1990. Most prominently, the right key is a tool used to find Demazure characters for sl(n,C). Previous methods used to compute these…

There are several combinatorial methods that can be used to produce type A Demazure characters (key polynomials). The alcove path model of Lenart and Postnikov provides a procedure that inputs a semistandard tableau $T$ and outputs a…

The Schur function indexed by a partition lambda with at most n parts is the sum of the weight monomials for the Young tableaux of shape lambda. Let pi be an n-permutation. We give two descriptions of the tableaux that contribute their…

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 study, by means of Littelmann's theory of paths, Kostant-Kumar modules (KK modules for short), which by definition are certain submodules of the tensor product of two irreducible integrable highest weight representations of a…

The Key map is an important tool in the determination of the Demazure crystals associated to Kac-Moody algebras. In finite type A, it can be computed in the tableau realization of crystals by a simple combinatorial procedure due to Lascoux…

A standard barely set-valued tableau of shape $\lambda$ is a filling of the Young diagram $\lambda$ with integers $1,2,\dots,|\lambda|+1$ such that the integers are increasing in each row and column, and every cell contains one integer…

This paper studies the properties of Demazure atoms and characters using linear operators and also tableaux-combinatorics. It proves the atom-positivity property of the product of a dominating monomial and an atom, which was an open…

Recollements of derived module categories are investigated, using a new technique, ladders of recollements, which are mutation sequences. The position in the ladder is shown to control whether a recollement restricts from unbounded to…

We study the path realization of Demazure crystals related to solvable lattice models in statistical mechanics. Various characters are represented in a unified way as the sums over one dimensional configurations which we call unrestricted,…

Lascoux and Sch\"utzenberger introduced a notion of key associated to any Young tableau. More recently Lascoux defined the key of an alternating sign matrix by recursively removing all -1's in such matrices. But alternating sign matrices…

In this paper we derive a counterpart of the well-known Ram-Yip formula for symmetric and nonsymmetric Macdonald polynomials of arbitrary type. Our new formula is in terms of a generalization of the Lakshmibai-Seshadri paths (originating in…

Properties of metrics and pairs consisting of left and right connections are studied on the bimodules of differential 1-forms. Those bimodules are obtained from the derivation based calculus of an algebra of matrix valued functions, and an…

A standard monomial theory for Schubert varieties is constructed exploiting (1) the geometry of the Seshadri stratifications of Schubert varieties by their Schubert subvarieties and (2) the combinatorial LS-path character formula for…

Young's lattice is a partial order on integer partitions whose saturated chains correspond to standard Young tableaux, one type of combinatorial object that generates the Schur basis for symmetric functions. Generalizing Young's lattice, we…

We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure…

Using the language of Seshadri stratifications we develop a geometrical interpretation of Lakshmibai-Seshadri-tableaux and their associated standard monomial bases. These tableaux are a generalization of Young-tableaux and…

We provide two shifted analogues of the tableau switching process due to Benkart, Sottile, and Stroomer, the shifted tableau switching process and the modified shifted tableau switching process. They are performed by applying a sequence of…

Let X,Y be finite sets and T a set of functions from X -> Y which we will call "tableaux". We define a simplicial complex whose facets, all of the same dimension, correspond to these tableaux. Such "tableau complexes" have many nice…