sagemath / sage

Main repository of SageMath
https://www.sagemath.org
Other
1.23k stars 429 forks source link

Algebra of multivariate polynomials invariant under the action of a permutation group #6889

Open 0f5ae6f6-e03a-45d9-b571-4ce01615e676 opened 14 years ago

0f5ae6f6-e03a-45d9-b571-4ce01615e676 commented 14 years ago

First implementation of the Algebra of multivariate polynomials invariant under the action of a permutation group.

From a permutation group and a ring, the goal is to implement an algebra on which one can ask the primary invariants, a minimal generating set and (irreducible)secondary invariants...

Using the category framework, we construct the abstract algebra of PermutationGroupInvariantRing and two representations of it : the graded algebra of multivariate polynomials view as combination of orbit sum of monomials (here #6812 is needed) and the polynomials view as vector evaluated in a collection of points.

This is a long run work but first implementation is comming in one or two months.

sage: mupad('package("Combinat")')                                    
sage: G = mupad.Dom.PermutationGroup(3, [[[1,2,3]]])
sage: I = mupad.Dom.PermutationGroupInvariantRing(mupad.Dom.Rational, G)
sage: I

Dom::PermutationGroupInvariantRing(Dom::Rational,Dom::PermutationGroup(3, [[[1, 2, 3]]]))

sage: I.minimalGeneratingSet()
         3 = [o([1, 1, 1]), o([2, 0, 1])],
         2 = [o([1, 1, 0])],
         1 = [o([1, 0, 0])]

sage: I.basisIndices.list(3)
         [[1, 1, 1], [2, 0, 1], [2, 1, 0], [3, 0, 0]]

sage: I.HilbertSeries()

                                  2            1
                           - ---------- - ----------
                                 3                 3
                             3 (z  - 1)   3 (z - 1)

depends on #6812 and #5891

CC: @sagetrac-sage-combinat @tscrim

Component: combinatorics

Keywords: invariants, permutation, group, ring, orbit, evaluation

Issue created by migration from https://trac.sagemath.org/ticket/6889

simon-king-jena commented 5 years ago
comment:6

Note that Sage (via Singular) can compute minimal generating sets for invariant rings of permutation groups. But the result is not implemented as a ring on its own (i.e., it is a method that returns a list of generators).