Welcome to MathOverflow

Question

10

3

Let $V$ be a polynomial representation of the general linear group $\Gamma:=\DeclareMathOperator{\Gl}{Gl}\Gl_n(\newcommand{\C}{\mathbb C}\C)$ .

In chapter 4.6 of his book "Algorithms in Invariant Theory", Bernd Sturmfels describes an algorithm he calls Hilbert's Algorithm, which calculates a finite set of generators for the ring of invariants $$\C[V]^\Gamma = \left\{~ f\in\C[V] ~:~ \forall\gamma\in\Gamma:~ \gamma.f=f ~\right\}.$$ My question: Are there any software implementations of this algorithm (or, of any algorithm that does the same thing) in computer algebra systems? I would prefer free software, but if the only implementation is in a commercial product, I'd still use it.

flag	asked Sep 10 at 15:55 Garfield 152●5

I have no useful comment on this very interesting question (although I think I heard people talking about implementing this recently at a Macaulay2 conference -- but it's not there yet), but I thought it might be worth remarking that this appears to me to be the 5000th question in ag.algebraic-geometry. – Karl Schwede Sep 11 at 4:14

pbelmans · Accepted Answer · 2012-09-10 19:54:00Z UTC

3

Magma (not free, unfortunately) is capable of this. The method FundamentalInvariants(R) : RngInvar -> RngMPol should do what you need.

answered Sep 10 at 19:54

pbelmans
76●1●4

Melania · Answer 2 · 2012-09-14 19:48:17Z UTC

1

http://arxiv.org/abs/1101.0622

answered Sep 14 at 19:48

Melania
95●4

Dung Duong · Answer 3 · 2012-11-20 07:44:08Z UTC

1

I dont know whether this helps : http://www.sciencedirect.com/science/article/pii/S074771711200079X

answered Nov 20 at 7:44

Dung Duong
75●4

Algorithms in Invariant Theory

Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

3 Answers

You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.