Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with invariant-theory
Search options not deleted
user 6816
Invariant theory deals with an algebraic, geometric or analytic structure $X$, submitted to the action of an (algebraic) group $G$. It studies $G$-invariant elements of $X$ as well as the set of $G$-orbits.
2
votes
2
answers
346
views
Subrings of rational functions invariant under change of sign
Let $R$ be a ring generated by $k$ rational functions in the
variables $x_1,...,x_n$ over the real numbers.
Is there an algorithm that computes a set of rational functions
$f_1,...,f_l \in R$ which …
- 12.3k