Discrete Mathematics & Theoretical Computer Science
| author: | Manfred Göbel |
|---|---|
| title: | The Optimal Lower Bound for Generators of Invariant Rings without Finite SAGBI Bases with Respect to Any Admissible Order |
| keywords: | SAGBI basis, Invariant ring, Analysis of algorithms |
| abstract: | We prove the existence of an invariant ring C[X1,...,Xn]T
generated by elements with a total degree of at most 2,
which has no finite SAGBI basis with respect to any admissible order.
Therefore, 2 is the optimal lower bound for the total degree
of generators of invariant rings with such a property.
If your browser does not display the abstract correctly (because of the different mathematical symbols) you can look it up in the PostScript or PDF files. |
| reference: | Manfred Göbel (1999), The Optimal Lower Bound for Generators of Invariant Rings without Finite SAGBI Bases with Respect to Any Admissible Order, Discrete Mathematics and Theoretical Computer Science 3, pp. 65-70 |
| bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |
| ps.gz-source: | dm030203.ps.gz |
| ps-source: | dm030203.ps |
| pdf-source: | dm030203.pdf |
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.