Sold Out
Book Categories |
This work develops a theory for counting nonintersecting lattice paths by the major index and generalizations of it. As applications, Krattenthaler computes certain tableaux and plane partition generating functions. In particular, he derives refinements of the Bender-Knuth and McMahon conjectures, thereby giving new proofs of these conjectures. Providing refinements of famous results in plane partition theory, this work combines in an effective and nontrivial way classical tools from bijective combinatorics and the theory of special functions.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionThe Major Counting of Nonintersecting Lattice Paths and Generating Functions for Tableaux
X
This Item is in Your InventoryThe Major Counting of Nonintersecting Lattice Paths and Generating Functions for Tableaux
X
You must be logged in to review the productsX
X
X
Add The Major Counting of Nonintersecting Lattice Paths and Generating Functions for Tableaux, This work develops a theory for counting nonintersecting lattice paths by the major index and generalizations of it. As applications, Krattenthaler computes certain tableaux and plane partition generating functions. In particular, he derives refinements o, The Major Counting of Nonintersecting Lattice Paths and Generating Functions for Tableaux to the inventory that you are selling on WonderClubX
X
Add The Major Counting of Nonintersecting Lattice Paths and Generating Functions for Tableaux, This work develops a theory for counting nonintersecting lattice paths by the major index and generalizations of it. As applications, Krattenthaler computes certain tableaux and plane partition generating functions. In particular, he derives refinements o, The Major Counting of Nonintersecting Lattice Paths and Generating Functions for Tableaux to your collection on WonderClub |