The Optimal Lower Bound for Generators of Invariant Rings without Finite SAGBI Bases with Respect to Any Admissible Order - Archive ouverte HAL
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 1999

The Optimal Lower Bound for Generators of Invariant Rings without Finite SAGBI Bases with Respect to Any Admissible Order

Abstract

We prove the existence of an invariant ring \textbfC[X_1,...,X_n]^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.
Fichier principal
Vignette du fichier
dm030203.pdf (80.53 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00958927 , version 1 (13-03-2014)

Identifiers

Cite

Manfred Göbel. 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, 1999, Vol. 3 no. 2 (2), pp.65-70. ⟨10.46298/dmtcs.259⟩. ⟨hal-00958927⟩

Collections

TDS-MACS
40 View
835 Download

Altmetric

Share

More