LR-rule and Standard Young Tableau counting
up vote
1
down vote
favorite
given that $s_lambda s_mu=sum_{nu} C_{lambda mu}^nu s_nu$ with $vert lambdavert +vertmu vert=vert nuvert$, why does apparently also hold that $$h(lambda) h(mu) {vert nuvert choose vert lambda vert}=sum_{nu} C_{lambda mu}^nu h(nu)$$ where $h(lambda)$ denotes the count of Standard Young Tableaux as given by the hooklength formula? A similar relation, but without the binomial factor, is well known for the semi-standard tableaux. This last one is easily understood by comparing monomials in the schur functions on both sides together with the relation between the weights of the monomials and semi-standard tableaux. For the relation above, I fail to grasp the link.
Any hints?
combinatorics reference-request symmetric-functions young-tableaux
add a comment |
up vote
1
down vote
favorite
given that $s_lambda s_mu=sum_{nu} C_{lambda mu}^nu s_nu$ with $vert lambdavert +vertmu vert=vert nuvert$, why does apparently also hold that $$h(lambda) h(mu) {vert nuvert choose vert lambda vert}=sum_{nu} C_{lambda mu}^nu h(nu)$$ where $h(lambda)$ denotes the count of Standard Young Tableaux as given by the hooklength formula? A similar relation, but without the binomial factor, is well known for the semi-standard tableaux. This last one is easily understood by comparing monomials in the schur functions on both sides together with the relation between the weights of the monomials and semi-standard tableaux. For the relation above, I fail to grasp the link.
Any hints?
combinatorics reference-request symmetric-functions young-tableaux
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
given that $s_lambda s_mu=sum_{nu} C_{lambda mu}^nu s_nu$ with $vert lambdavert +vertmu vert=vert nuvert$, why does apparently also hold that $$h(lambda) h(mu) {vert nuvert choose vert lambda vert}=sum_{nu} C_{lambda mu}^nu h(nu)$$ where $h(lambda)$ denotes the count of Standard Young Tableaux as given by the hooklength formula? A similar relation, but without the binomial factor, is well known for the semi-standard tableaux. This last one is easily understood by comparing monomials in the schur functions on both sides together with the relation between the weights of the monomials and semi-standard tableaux. For the relation above, I fail to grasp the link.
Any hints?
combinatorics reference-request symmetric-functions young-tableaux
given that $s_lambda s_mu=sum_{nu} C_{lambda mu}^nu s_nu$ with $vert lambdavert +vertmu vert=vert nuvert$, why does apparently also hold that $$h(lambda) h(mu) {vert nuvert choose vert lambda vert}=sum_{nu} C_{lambda mu}^nu h(nu)$$ where $h(lambda)$ denotes the count of Standard Young Tableaux as given by the hooklength formula? A similar relation, but without the binomial factor, is well known for the semi-standard tableaux. This last one is easily understood by comparing monomials in the schur functions on both sides together with the relation between the weights of the monomials and semi-standard tableaux. For the relation above, I fail to grasp the link.
Any hints?
combinatorics reference-request symmetric-functions young-tableaux
combinatorics reference-request symmetric-functions young-tableaux
asked Nov 25 at 11:57
Wouter M.
640611
640611
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
up vote
1
down vote
accepted
Write $r=|lambda|$, $t=|mu|$. Then $|nu|=r+t$ for all the $nu$
in the sum.
Consider the relation
$$s_lambda s_mu=sum_nu C_{nu}^{lambdamu} s_nu.tag{1}$$
Take the coefficient of $x_1x_2cdots x_{r+t}$ in $(1)$.
From the right-hand side, this coefficient is
$$sum_nu C_{nu}^{lambdamu}h(nu).$$
But there are $binom{r+t}r$ pairs of monomials of degrees $r$ and $t$ that
multiply to give $x_1x_2cdots x_{r+t}$. As the Schur functions are symmetric
the coefficient from the LHS is $binom{r+t}r$ times that coefficient
of $x_1cdots x_r$ in $s_lambda$ times the coefficient of
of $x_1cdots x_t$ in $s_mu$, that is
$$binom{r+t}r h(lambda)h(mu).$$
Lesson taken away: SYT are just special cases of SSYT that have their weights all 1. Nice ...
– Wouter M.
Nov 27 at 15:51
add a comment |
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
accepted
Write $r=|lambda|$, $t=|mu|$. Then $|nu|=r+t$ for all the $nu$
in the sum.
Consider the relation
$$s_lambda s_mu=sum_nu C_{nu}^{lambdamu} s_nu.tag{1}$$
Take the coefficient of $x_1x_2cdots x_{r+t}$ in $(1)$.
From the right-hand side, this coefficient is
$$sum_nu C_{nu}^{lambdamu}h(nu).$$
But there are $binom{r+t}r$ pairs of monomials of degrees $r$ and $t$ that
multiply to give $x_1x_2cdots x_{r+t}$. As the Schur functions are symmetric
the coefficient from the LHS is $binom{r+t}r$ times that coefficient
of $x_1cdots x_r$ in $s_lambda$ times the coefficient of
of $x_1cdots x_t$ in $s_mu$, that is
$$binom{r+t}r h(lambda)h(mu).$$
Lesson taken away: SYT are just special cases of SSYT that have their weights all 1. Nice ...
– Wouter M.
Nov 27 at 15:51
add a comment |
up vote
1
down vote
accepted
Write $r=|lambda|$, $t=|mu|$. Then $|nu|=r+t$ for all the $nu$
in the sum.
Consider the relation
$$s_lambda s_mu=sum_nu C_{nu}^{lambdamu} s_nu.tag{1}$$
Take the coefficient of $x_1x_2cdots x_{r+t}$ in $(1)$.
From the right-hand side, this coefficient is
$$sum_nu C_{nu}^{lambdamu}h(nu).$$
But there are $binom{r+t}r$ pairs of monomials of degrees $r$ and $t$ that
multiply to give $x_1x_2cdots x_{r+t}$. As the Schur functions are symmetric
the coefficient from the LHS is $binom{r+t}r$ times that coefficient
of $x_1cdots x_r$ in $s_lambda$ times the coefficient of
of $x_1cdots x_t$ in $s_mu$, that is
$$binom{r+t}r h(lambda)h(mu).$$
Lesson taken away: SYT are just special cases of SSYT that have their weights all 1. Nice ...
– Wouter M.
Nov 27 at 15:51
add a comment |
up vote
1
down vote
accepted
up vote
1
down vote
accepted
Write $r=|lambda|$, $t=|mu|$. Then $|nu|=r+t$ for all the $nu$
in the sum.
Consider the relation
$$s_lambda s_mu=sum_nu C_{nu}^{lambdamu} s_nu.tag{1}$$
Take the coefficient of $x_1x_2cdots x_{r+t}$ in $(1)$.
From the right-hand side, this coefficient is
$$sum_nu C_{nu}^{lambdamu}h(nu).$$
But there are $binom{r+t}r$ pairs of monomials of degrees $r$ and $t$ that
multiply to give $x_1x_2cdots x_{r+t}$. As the Schur functions are symmetric
the coefficient from the LHS is $binom{r+t}r$ times that coefficient
of $x_1cdots x_r$ in $s_lambda$ times the coefficient of
of $x_1cdots x_t$ in $s_mu$, that is
$$binom{r+t}r h(lambda)h(mu).$$
Write $r=|lambda|$, $t=|mu|$. Then $|nu|=r+t$ for all the $nu$
in the sum.
Consider the relation
$$s_lambda s_mu=sum_nu C_{nu}^{lambdamu} s_nu.tag{1}$$
Take the coefficient of $x_1x_2cdots x_{r+t}$ in $(1)$.
From the right-hand side, this coefficient is
$$sum_nu C_{nu}^{lambdamu}h(nu).$$
But there are $binom{r+t}r$ pairs of monomials of degrees $r$ and $t$ that
multiply to give $x_1x_2cdots x_{r+t}$. As the Schur functions are symmetric
the coefficient from the LHS is $binom{r+t}r$ times that coefficient
of $x_1cdots x_r$ in $s_lambda$ times the coefficient of
of $x_1cdots x_t$ in $s_mu$, that is
$$binom{r+t}r h(lambda)h(mu).$$
answered Nov 25 at 12:13
Lord Shark the Unknown
98.8k958131
98.8k958131
Lesson taken away: SYT are just special cases of SSYT that have their weights all 1. Nice ...
– Wouter M.
Nov 27 at 15:51
add a comment |
Lesson taken away: SYT are just special cases of SSYT that have their weights all 1. Nice ...
– Wouter M.
Nov 27 at 15:51
Lesson taken away: SYT are just special cases of SSYT that have their weights all 1. Nice ...
– Wouter M.
Nov 27 at 15:51
Lesson taken away: SYT are just special cases of SSYT that have their weights all 1. Nice ...
– Wouter M.
Nov 27 at 15:51
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3012744%2flr-rule-and-standard-young-tableau-counting%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown