Difference between revisions of "Affine Balanced Labellings"
Jump to navigation
Jump to search
(Created page with "*Fomin, Greene, Reiner, Shimozono - Balanced labellings and Schubert polynomials - http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.12.163&rep=rep1&type=pdf *Edelman, ...") |
|||
| Line 2: | Line 2: | ||
*Edelman, Greene - Balanced tableaux - http://www.sciencedirect.com/science/article/pii/0001870887900636 | *Edelman, Greene - Balanced tableaux - http://www.sciencedirect.com/science/article/pii/0001870887900636 | ||
| − | *When is an affine diagram connected? ( | + | *When is an affine diagram connected? |
| + | ** Answer: An affine digram is connected if and only if it is a diagonal shift of finite permutation diagram. | ||
| + | |||
| + | == Classification of (Affine) Permutation Diagrams by Local Conditions == | ||
| + | |||
| + | === IDEAS === | ||
| + | |||
| + | # Only look at 3 $\times\ 3 sublattice. | ||
Revision as of 15:45, 13 January 2013
- Fomin, Greene, Reiner, Shimozono - Balanced labellings and Schubert polynomials - http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.12.163&rep=rep1&type=pdf
- Edelman, Greene - Balanced tableaux - http://www.sciencedirect.com/science/article/pii/0001870887900636
- When is an affine diagram connected?
- Answer: An affine digram is connected if and only if it is a diagonal shift of finite permutation diagram.
Classification of (Affine) Permutation Diagrams by Local Conditions
IDEAS
- Only look at 3 $\times\ 3 sublattice.