Jump to ContentJump to Main Navigation

You are looking at 1-10 of 10 items

  • Keywords: Gelfand-Tsetlin pattern x
Clear All Modify Search

View:

Outline of the Proof

Ben Brubaker, Daniel Bump, and Solomon Friedberg

in Weyl Group Multiple Dirichlet Series: Type A Combinatorial Theory (AM-175)

Published in print:
2011
Published Online:
October 2017
ISBN:
9780691150659
eISBN:
9781400838998
Item type:
chapter
Publisher:
Princeton University Press
DOI:
10.23943/princeton/9780691150659.003.0006
Subject:
Mathematics, Combinatorics / Graph Theory / Discrete Mathematics

This chapter presents the proof of the equivalence of the two definitions for the λ‎-parts in terms of Gelfand-Tsetlin patterns. The equivalence of these two descriptions is a deep fact that uses ... More


Crystals and Gelfand-Tsetlin Patterns

Ben Brubaker, Daniel Bump, and Solomon Friedberg

in Weyl Group Multiple Dirichlet Series: Type A Combinatorial Theory (AM-175)

Published in print:
2011
Published Online:
October 2017
ISBN:
9780691150659
eISBN:
9781400838998
Item type:
chapter
Publisher:
Princeton University Press
DOI:
10.23943/princeton/9780691150659.003.0002
Subject:
Mathematics, Combinatorics / Graph Theory / Discrete Mathematics

This chapter translates the definitions of the Weyl group multiple Dirichlet series into the language of crystal bases. It reinterprets the entries in these arrays and the accompanying boxing and ... More


Type A Weyl Group Multiple Dirichlet Series

Ben Brubaker, Daniel Bump, and Solomon Friedberg

in Weyl Group Multiple Dirichlet Series: Type A Combinatorial Theory (AM-175)

Published in print:
2011
Published Online:
October 2017
ISBN:
9780691150659
eISBN:
9781400838998
Item type:
chapter
Publisher:
Princeton University Press
DOI:
10.23943/princeton/9780691150659.003.0001
Subject:
Mathematics, Combinatorics / Graph Theory / Discrete Mathematics

This chapter describes Type A Weyl group multiple Dirichlet series. It begins by defining the basic shape of the class of Weyl group multiple Dirichlet series. To do so, the following parameters are ... More


Statement B Implies Statement A

Ben Brubaker, Daniel Bump, and Solomon Friedberg

in Weyl Group Multiple Dirichlet Series: Type A Combinatorial Theory (AM-175)

Published in print:
2011
Published Online:
October 2017
ISBN:
9780691150659
eISBN:
9781400838998
Item type:
chapter
Publisher:
Princeton University Press
DOI:
10.23943/princeton/9780691150659.003.0007
Subject:
Mathematics, Combinatorics / Graph Theory / Discrete Mathematics

This chapter recalls the use of the Schützenberger involution on Gelfand-Tsetlin patterns to prove that Statement B implies Statement A. These statements will be discussed two more times in the later ... More


Statement B and Crystal Graphs

Ben Brubaker, Daniel Bump, and Solomon Friedberg

in Weyl Group Multiple Dirichlet Series: Type A Combinatorial Theory (AM-175)

Published in print:
2011
Published Online:
October 2017
ISBN:
9780691150659
eISBN:
9781400838998
Item type:
chapter
Publisher:
Princeton University Press
DOI:
10.23943/princeton/9780691150659.003.0018
Subject:
Mathematics, Combinatorics / Graph Theory / Discrete Mathematics

This chapter translates Statements A and B into Statements A′ and B′ in the language of crystal bases, and explains in this language how Statement B′ implies Statement A′. It first introduces the ... More


Cartoons

Ben Brubaker, Daniel Bump, and Solomon Friedberg

in Weyl Group Multiple Dirichlet Series: Type A Combinatorial Theory (AM-175)

Published in print:
2011
Published Online:
October 2017
ISBN:
9780691150659
eISBN:
9781400838998
Item type:
chapter
Publisher:
Princeton University Press
DOI:
10.23943/princeton/9780691150659.003.0008
Subject:
Mathematics, Combinatorics / Graph Theory / Discrete Mathematics

This chapter introduces a method of marking up a short Gelfand-Tsetlin pattern based on inequalities between its entries, that encodes the effect of the involution t 7 → t′ and the boxing and ... More


Knowability

Ben Brubaker, Daniel Bump, and Solomon Friedberg

in Weyl Group Multiple Dirichlet Series: Type A Combinatorial Theory (AM-175)

Published in print:
2011
Published Online:
October 2017
ISBN:
9780691150659
eISBN:
9781400838998
Item type:
chapter
Publisher:
Princeton University Press
DOI:
10.23943/princeton/9780691150659.003.0012
Subject:
Mathematics, Combinatorics / Graph Theory / Discrete Mathematics

This chapter introduces the Knowability Lemma, which explains when products of Gauss sums associated to elements of a preaccordion are explicitly evaluable as polynomials in q, the order of the ... More


Tokuyama’s Theorem

Ben Brubaker, Daniel Bump, and Solomon Friedberg

in Weyl Group Multiple Dirichlet Series: Type A Combinatorial Theory (AM-175)

Published in print:
2011
Published Online:
October 2017
ISBN:
9780691150659
eISBN:
9781400838998
Item type:
chapter
Publisher:
Princeton University Press
DOI:
10.23943/princeton/9780691150659.003.0005
Subject:
Mathematics, Combinatorics / Graph Theory / Discrete Mathematics

This chapter introduces the Tokuyama's Theorem, first by writing the Weyl character formula and restating Schur polynomials, the values of the Whittaker function multiplied by the normalization ... More


Types

Ben Brubaker, Daniel Bump, and Solomon Friedberg

in Weyl Group Multiple Dirichlet Series: Type A Combinatorial Theory (AM-175)

Published in print:
2011
Published Online:
October 2017
ISBN:
9780691150659
eISBN:
9781400838998
Item type:
chapter
Publisher:
Princeton University Press
DOI:
10.23943/princeton/9780691150659.003.0011
Subject:
Mathematics, Combinatorics / Graph Theory / Discrete Mathematics

This chapter divides the prototypes into much smaller units called types. It fixes a top and bottom row, and therefore a cartoon. For each episode ε‎ of the cartoon, the chapter fixes an integer ... More


The Reduction to Statement D

Ben Brubaker, Daniel Bump, and Solomon Friedberg

in Weyl Group Multiple Dirichlet Series: Type A Combinatorial Theory (AM-175)

Published in print:
2011
Published Online:
October 2017
ISBN:
9780691150659
eISBN:
9781400838998
Item type:
chapter
Publisher:
Princeton University Press
DOI:
10.23943/princeton/9780691150659.003.0013
Subject:
Mathematics, Combinatorics / Graph Theory / Discrete Mathematics

This chapter focuses on the language of resotopes and assumes that γ‎Lsubscript Greek small letter epsilon and γ‎Rsubscript Greek small letter epsilon are multiples of n for every totally resonant ... More


View: