Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

24

COMBINATORICS
2006

favoriteEmaildiscussreport

104views more COMBINATORICS 2006»

Factorial Grothendieck Polynomials

13 years 11 months ago

Factorial Grothendieck Polynomials

Download www.univie.ac.at

In this paper, we study Grothendieck polynomials indexed by Grassmannian permutations from a combinatorial viewpoint. We introduce the factorial Grothendieck polynomials which are analogues of the factorial Schur functions, study their properties, and use them to produce a generalisation of a Littlewood-Richardson rule for Grothendieck polynomials.

Peter McNamara

Real-time Traffic

COMBINATORICS 2006 | Factorial Grothendieck Polynomials | Factorial Schur Functions | Grothendieck Polynomials |

claim paper

Related Content

» Combinatorics with definable sets Euler characteristics and Grothendieck rings

» The Positive Semidefinite Grothendieck Problem with Rank Constraint

» On polynomial integrals over the orthogonal group

» Sharp kernel clustering algorithms and their associated Grothendieck inequalities

» Regression models and experimental designs a tutorial for simulation analysts

» Quasirandomness and Algorithmic Regularity for Graphs with General Degree Distributions

» Lower Bounds on Quantum Multiparty Communication Complexity

» Optimal Routing for DecodeandForward based Cooperation in Wireless Networks

» Optimal Routing for DecodeForward in Cooperative Wireless Networks

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	COMBINATORICS
Authors	Peter McNamara

Comments (0)