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. DMTCS [electronic only] (1999)
- Volume: 3, Issue: 2, page 65-70
- ISSN: 1365-8050
Access Full Article
top
How to cite
topGöbel, Manfred. "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. DMTCS [electronic only] 3.2 (1999): 65-70. <http://eudml.org/doc/120148>.
@article{Göbel1999,
author = {Göbel, Manfred},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {SAGBI basis; analysis of algorithms; generators of invariant rings},
language = {eng},
number = {2},
pages = {65-70},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {The optimal lower bound for generators of invariant rings without finite SAGBI bases with respect to any admissible order.},
url = {http://eudml.org/doc/120148},
volume = {3},
year = {1999},
}
TY - JOUR
AU - Göbel, Manfred
TI - The optimal lower bound for generators of invariant rings without finite SAGBI bases with respect to any admissible order.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 1999
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 3
IS - 2
SP - 65
EP - 70
LA - eng
KW - SAGBI basis; analysis of algorithms; generators of invariant rings
UR - http://eudml.org/doc/120148
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.