2007
DOI: 10.1016/j.jsc.2006.03.005
|View full text |Cite
|
Sign up to set email alerts
|

Rational invariants of a group action. Construction and rewriting

Abstract: Geometric constructions applied to a rational action of an algebraic group lead to a new algorithm for computing rational invariants. A finite generating set of invariants appears as the coefficients of a reduced Gröbner basis. The algorithm comes in two variants. In the first construction the ideal of the graph of the action is considered. In the second one the ideal of a cross-section is added to the ideal of the graph. Zerodimensionality of the resulting ideal brings a computational advantage. In both cases… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
80
0

Year Published

2007
2007
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 46 publications
(80 citation statements)
references
References 9 publications
0
80
0
Order By: Relevance
“…In the second subsection we provide an algorithm to compute a generating set of rational invariants for the rational action of an algebraic group. This is a quick presentation of the main results of [31]. In the last subsection we explain how the algorithm also delivers the normalized invariants as algebraic invariants.…”
Section: Algebraic Invariantsmentioning
confidence: 99%
See 3 more Smart Citations
“…In the second subsection we provide an algorithm to compute a generating set of rational invariants for the rational action of an algebraic group. This is a quick presentation of the main results of [31]. In the last subsection we explain how the algorithm also delivers the normalized invariants as algebraic invariants.…”
Section: Algebraic Invariantsmentioning
confidence: 99%
“…The coefficients of the Chow form of O z were first shown to form a separating set of rational invariants, and hence a generating set [58]. In [31,44,35] a reduced Gröbner basis for O z is used. Its coefficients are shown to form a generating set of rational invariants by exhibiting an algorithm to rewrite any other rational invariants in terms of those.…”
Section: Algorithms For Rational Invariantsmentioning
confidence: 99%
See 2 more Smart Citations
“…Thus, we restrict ourself to Lie symmetries associated to affine infinitesimal generators for which invariant coordinates computation is easy (for general case see [5] and references therein). Hence, we do not follows methods developed for general cases because their complexity are likely exponential in input's size while we focus our attention to method of quasi-polynomial complexity.…”
Section: Main Steps and Tools Of The Reduction Processmentioning
confidence: 99%