Calculating the Hilbert Series for symmetric polynomials The Next CEO of Stack OverflowBasis for $Bbb Z[x_1,cdots,x_n]$ over $Bbb Z[e_1,cdots,e_n]$'Galois Resolvent' and elementary symmetric polynomials in a paper by NoetherCalculating the ring of invariants for the action of $mathbb C^*$ on $mathbb C^2setminus 0$Two definitions of Hilbert series/Hilbert function in algebraic geometryPolynomials with $S_n times mathbbZ_2$ symmetryAlternating polynomials under $S_4$-action: Version of Chevalley's TheoremMultiplicity is always positiveInvariants in the ring of coinvariantsDegree of Projections???Which polynomials in the minors of a matrix are invariant under conjugation?

Is fine stranded wire ok for main supply line?

Do I need to write [sic] when including a quotation with a number less than 10 that isn't written out?

Free fall ellipse or parabola?

What happened in Rome, when the western empire "fell"?

Film where the government was corrupt with aliens, people sent to kill aliens are given rigged visors not showing the right aliens

What flight has the highest ratio of timezone difference to flight time?

Help! I cannot understand this game’s notations!

Where do students learn to solve polynomial equations these days?

How can the PCs determine if an item is a phylactery?

Defamation due to breach of confidentiality

Help understanding this unsettling image of Titan, Epimetheus, and Saturn's rings?

Point distance program written without a framework

What is the difference between "hamstring tendon" and "common hamstring tendon"?

Does the Idaho Potato Commission associate potato skins with healthy eating?

Is there a way to save my career from absolute disaster?

Is it okay to majorly distort historical facts while writing a fiction story?

Towers in the ocean; How deep can they be built?

Can Sneak Attack be used when hitting with an improvised weapon?

Won the lottery - how do I keep the money?

Is there an equivalent of cd - for cp or mv

Spaces in which all closed sets are regular closed

Can this note be analyzed as a non-chord tone?

Inductor and Capacitor in Parallel

(How) Could a medieval fantasy world survive a magic-induced "nuclear winter"?



Calculating the Hilbert Series for symmetric polynomials



The Next CEO of Stack OverflowBasis for $Bbb Z[x_1,cdots,x_n]$ over $Bbb Z[e_1,cdots,e_n]$'Galois Resolvent' and elementary symmetric polynomials in a paper by NoetherCalculating the ring of invariants for the action of $mathbb C^*$ on $mathbb C^2setminus 0$Two definitions of Hilbert series/Hilbert function in algebraic geometryPolynomials with $S_n times mathbbZ_2$ symmetryAlternating polynomials under $S_4$-action: Version of Chevalley's TheoremMultiplicity is always positiveInvariants in the ring of coinvariantsDegree of Projections???Which polynomials in the minors of a matrix are invariant under conjugation?










0












$begingroup$


Let $S = mathbbC[x_1,...,x_n]$ be the polynomial ring in $n$ variables, $S_d subset S$ the subspace of homogeneous polynomials of degree $d$, i.e., the polynomials with the property
beginalign
f(tx) = t^d f(x).
endalign



Let G be the symmetric group consisting of $n times n$ permutation matrices. Then $S^G subset S$ is defined as the subspace of invariant polynomials under G, i.e. the set
beginalign
S^G &= f in S~ \&= ~ f(x_sigma(1),...,x_sigma(n)) = f(x_1,...,x_n) ~for~all~sigma in mathcalS_n
endalign



So all the invariant Polynomials are the symmetric Polynomials, which are generated by the $n$ elementary symmetric polynomials
beginalign
sigma_1 (x) &= sum_ix_i \
sigma_2 (x) &= sum_i<j x_i x_j \
&...... \
sigma_n (x) &= x_1 cdot x_2cdot... cdot x_n
endalign



The Hilbert Series, which I want to find out, is defined as the formal power series
beginalign P(t) = sum_d geq 0 dim(S^G cap S_d)t^d in mathbbZ[[t]].
endalign



I started calculating the $dim(S^G cap S_d)$ for each $d$ and I got:
$dim(S^G cap S_d) = 1 $ for all $d$, since I took the $sigma_i$ as a basis for each summand $S^G cap S_d$.



But this must obviously be wrong, because then I get the Hilbert Series
beginalign
frac11-t.
endalign



In Mukai it says the Hilbert Series for the symmetric Group is



beginalign
frac1(1-t)(1-t^2)...(1-t^n).
endalign

So I am missing a few factors in my calculation but don't know how to get them. Can anyone show me how to calculate the Hilbert Series in the correct way ?










share|cite|improve this question









$endgroup$











  • $begingroup$
    Your graded ring generated by symmetric polynomials will be similar to $R(n) = BbbC[y_1^1,y_2^2,ldots,y_n^n]$ graded by degree. Then $R(n)_d = bigoplus_mn le d y_n^mn R(n-1)_d-mn$ so $dim(R(n)_d) = sum_mnle d dim(R(n-1)_d-mn)$ and $P(n)(t) = sum_d=0^infty dim(R(n)_d)t^d= frac11-t^n P(n-1)(t)=frac1(1-t)(1-t^2)...(1-t^n)$.
    $endgroup$
    – reuns
    Mar 20 at 0:47
















0












$begingroup$


Let $S = mathbbC[x_1,...,x_n]$ be the polynomial ring in $n$ variables, $S_d subset S$ the subspace of homogeneous polynomials of degree $d$, i.e., the polynomials with the property
beginalign
f(tx) = t^d f(x).
endalign



Let G be the symmetric group consisting of $n times n$ permutation matrices. Then $S^G subset S$ is defined as the subspace of invariant polynomials under G, i.e. the set
beginalign
S^G &= f in S~ \&= ~ f(x_sigma(1),...,x_sigma(n)) = f(x_1,...,x_n) ~for~all~sigma in mathcalS_n
endalign



So all the invariant Polynomials are the symmetric Polynomials, which are generated by the $n$ elementary symmetric polynomials
beginalign
sigma_1 (x) &= sum_ix_i \
sigma_2 (x) &= sum_i<j x_i x_j \
&...... \
sigma_n (x) &= x_1 cdot x_2cdot... cdot x_n
endalign



The Hilbert Series, which I want to find out, is defined as the formal power series
beginalign P(t) = sum_d geq 0 dim(S^G cap S_d)t^d in mathbbZ[[t]].
endalign



I started calculating the $dim(S^G cap S_d)$ for each $d$ and I got:
$dim(S^G cap S_d) = 1 $ for all $d$, since I took the $sigma_i$ as a basis for each summand $S^G cap S_d$.



But this must obviously be wrong, because then I get the Hilbert Series
beginalign
frac11-t.
endalign



In Mukai it says the Hilbert Series for the symmetric Group is



beginalign
frac1(1-t)(1-t^2)...(1-t^n).
endalign

So I am missing a few factors in my calculation but don't know how to get them. Can anyone show me how to calculate the Hilbert Series in the correct way ?










share|cite|improve this question









$endgroup$











  • $begingroup$
    Your graded ring generated by symmetric polynomials will be similar to $R(n) = BbbC[y_1^1,y_2^2,ldots,y_n^n]$ graded by degree. Then $R(n)_d = bigoplus_mn le d y_n^mn R(n-1)_d-mn$ so $dim(R(n)_d) = sum_mnle d dim(R(n-1)_d-mn)$ and $P(n)(t) = sum_d=0^infty dim(R(n)_d)t^d= frac11-t^n P(n-1)(t)=frac1(1-t)(1-t^2)...(1-t^n)$.
    $endgroup$
    – reuns
    Mar 20 at 0:47














0












0








0





$begingroup$


Let $S = mathbbC[x_1,...,x_n]$ be the polynomial ring in $n$ variables, $S_d subset S$ the subspace of homogeneous polynomials of degree $d$, i.e., the polynomials with the property
beginalign
f(tx) = t^d f(x).
endalign



Let G be the symmetric group consisting of $n times n$ permutation matrices. Then $S^G subset S$ is defined as the subspace of invariant polynomials under G, i.e. the set
beginalign
S^G &= f in S~ \&= ~ f(x_sigma(1),...,x_sigma(n)) = f(x_1,...,x_n) ~for~all~sigma in mathcalS_n
endalign



So all the invariant Polynomials are the symmetric Polynomials, which are generated by the $n$ elementary symmetric polynomials
beginalign
sigma_1 (x) &= sum_ix_i \
sigma_2 (x) &= sum_i<j x_i x_j \
&...... \
sigma_n (x) &= x_1 cdot x_2cdot... cdot x_n
endalign



The Hilbert Series, which I want to find out, is defined as the formal power series
beginalign P(t) = sum_d geq 0 dim(S^G cap S_d)t^d in mathbbZ[[t]].
endalign



I started calculating the $dim(S^G cap S_d)$ for each $d$ and I got:
$dim(S^G cap S_d) = 1 $ for all $d$, since I took the $sigma_i$ as a basis for each summand $S^G cap S_d$.



But this must obviously be wrong, because then I get the Hilbert Series
beginalign
frac11-t.
endalign



In Mukai it says the Hilbert Series for the symmetric Group is



beginalign
frac1(1-t)(1-t^2)...(1-t^n).
endalign

So I am missing a few factors in my calculation but don't know how to get them. Can anyone show me how to calculate the Hilbert Series in the correct way ?










share|cite|improve this question









$endgroup$




Let $S = mathbbC[x_1,...,x_n]$ be the polynomial ring in $n$ variables, $S_d subset S$ the subspace of homogeneous polynomials of degree $d$, i.e., the polynomials with the property
beginalign
f(tx) = t^d f(x).
endalign



Let G be the symmetric group consisting of $n times n$ permutation matrices. Then $S^G subset S$ is defined as the subspace of invariant polynomials under G, i.e. the set
beginalign
S^G &= f in S~ \&= ~ f(x_sigma(1),...,x_sigma(n)) = f(x_1,...,x_n) ~for~all~sigma in mathcalS_n
endalign



So all the invariant Polynomials are the symmetric Polynomials, which are generated by the $n$ elementary symmetric polynomials
beginalign
sigma_1 (x) &= sum_ix_i \
sigma_2 (x) &= sum_i<j x_i x_j \
&...... \
sigma_n (x) &= x_1 cdot x_2cdot... cdot x_n
endalign



The Hilbert Series, which I want to find out, is defined as the formal power series
beginalign P(t) = sum_d geq 0 dim(S^G cap S_d)t^d in mathbbZ[[t]].
endalign



I started calculating the $dim(S^G cap S_d)$ for each $d$ and I got:
$dim(S^G cap S_d) = 1 $ for all $d$, since I took the $sigma_i$ as a basis for each summand $S^G cap S_d$.



But this must obviously be wrong, because then I get the Hilbert Series
beginalign
frac11-t.
endalign



In Mukai it says the Hilbert Series for the symmetric Group is



beginalign
frac1(1-t)(1-t^2)...(1-t^n).
endalign

So I am missing a few factors in my calculation but don't know how to get them. Can anyone show me how to calculate the Hilbert Series in the correct way ?







invariant-theory hilbert-polynomial






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Mar 19 at 21:51









GilligansGilligans

496




496











  • $begingroup$
    Your graded ring generated by symmetric polynomials will be similar to $R(n) = BbbC[y_1^1,y_2^2,ldots,y_n^n]$ graded by degree. Then $R(n)_d = bigoplus_mn le d y_n^mn R(n-1)_d-mn$ so $dim(R(n)_d) = sum_mnle d dim(R(n-1)_d-mn)$ and $P(n)(t) = sum_d=0^infty dim(R(n)_d)t^d= frac11-t^n P(n-1)(t)=frac1(1-t)(1-t^2)...(1-t^n)$.
    $endgroup$
    – reuns
    Mar 20 at 0:47

















  • $begingroup$
    Your graded ring generated by symmetric polynomials will be similar to $R(n) = BbbC[y_1^1,y_2^2,ldots,y_n^n]$ graded by degree. Then $R(n)_d = bigoplus_mn le d y_n^mn R(n-1)_d-mn$ so $dim(R(n)_d) = sum_mnle d dim(R(n-1)_d-mn)$ and $P(n)(t) = sum_d=0^infty dim(R(n)_d)t^d= frac11-t^n P(n-1)(t)=frac1(1-t)(1-t^2)...(1-t^n)$.
    $endgroup$
    – reuns
    Mar 20 at 0:47
















$begingroup$
Your graded ring generated by symmetric polynomials will be similar to $R(n) = BbbC[y_1^1,y_2^2,ldots,y_n^n]$ graded by degree. Then $R(n)_d = bigoplus_mn le d y_n^mn R(n-1)_d-mn$ so $dim(R(n)_d) = sum_mnle d dim(R(n-1)_d-mn)$ and $P(n)(t) = sum_d=0^infty dim(R(n)_d)t^d= frac11-t^n P(n-1)(t)=frac1(1-t)(1-t^2)...(1-t^n)$.
$endgroup$
– reuns
Mar 20 at 0:47





$begingroup$
Your graded ring generated by symmetric polynomials will be similar to $R(n) = BbbC[y_1^1,y_2^2,ldots,y_n^n]$ graded by degree. Then $R(n)_d = bigoplus_mn le d y_n^mn R(n-1)_d-mn$ so $dim(R(n)_d) = sum_mnle d dim(R(n-1)_d-mn)$ and $P(n)(t) = sum_d=0^infty dim(R(n)_d)t^d= frac11-t^n P(n-1)(t)=frac1(1-t)(1-t^2)...(1-t^n)$.
$endgroup$
– reuns
Mar 20 at 0:47











0






active

oldest

votes












Your Answer





StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













draft saved

draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3154660%2fcalculating-the-hilbert-series-for-symmetric-polynomials%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes















draft saved

draft discarded
















































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.




draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3154660%2fcalculating-the-hilbert-series-for-symmetric-polynomials%23new-answer', 'question_page');

);

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







Popular posts from this blog

How should I support this large drywall patch? Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How do I cover large gaps in drywall?How do I keep drywall around a patch from crumbling?Can I glue a second layer of drywall?How to patch long strip on drywall?Large drywall patch: how to avoid bulging seams?Drywall Mesh Patch vs. Bulge? To remove or not to remove?How to fix this drywall job?Prep drywall before backsplashWhat's the best way to fix this horrible drywall patch job?Drywall patching using 3M Patch Plus Primer

random experiment with two different functions on unit interval Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Random variable and probability space notionsRandom Walk with EdgesFinding functions where the increase over a random interval is Poisson distributedNumber of days until dayCan an observed event in fact be of zero probability?Unit random processmodels of coins and uniform distributionHow to get the number of successes given $n$ trials , probability $P$ and a random variable $X$Absorbing Markov chain in a computer. Is “almost every” turned into always convergence in computer executions?Stopped random walk is not uniformly integrable

Lowndes Grove History Architecture References Navigation menu32°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661132°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661178002500"National Register Information System"Historic houses of South Carolina"Lowndes Grove""+32° 48' 6.00", −79° 57' 58.00""Lowndes Grove, Charleston County (260 St. Margaret St., Charleston)""Lowndes Grove"The Charleston ExpositionIt Happened in South Carolina"Lowndes Grove (House), Saint Margaret Street & Sixth Avenue, Charleston, Charleston County, SC(Photographs)"Plantations of the Carolina Low Countrye