Counting Generating Invariants Under Semisimple Group and Torus Actions

Details Counting Generating Invariants Under Semisimple Group and Torus Actions Counting Generating Invariants Under Semisimple Group and Torus Actions

2011-06-14

arxiv.org/abs/1106.2762v1

Mathematics

Commutative Algebra

Scientific paper

Although degree bounds and algorithms for the generators of various invariant rings have been known for decades, little is known about the cardinality of minimal generating sets. Estimates of such would provide lower bounds for the runtime of algorithms that compute invariants. Fix a semisimple linear algebraic group, choose an irreducible representation of highest weight w, and consider the irreducible representations of highest weight nw. As n goes to infinity, the cardinality of a minimal set of generating invariants grows faster than any polynomial in n. On the other hand, combinatorial methods yield sub-exponential upper bounds for the growth of generating sets for torus invariants on the binary forms.

Affiliated with

Also associated with

No associations

Rating

Counting Generating Invariants Under Semisimple Group and Torus Actions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting Generating Invariants Under Semisimple Group and Torus Actions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting Generating Invariants Under Semisimple Group and Torus Actions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-114111