|
Finite SAGBI bases for polynomial invariants of conjugates of alternating groups
Author:
Manfred Göbel
Journal:
Math. Comp. 71 (2002), 761-765
MSC (2000):
Primary 13A50, 12Y05; Secondary 20B35, 14Q99
Posted:
October 25, 2001
MathSciNet review:
1885626
Full-text PDF Free Access
Abstract |
References |
Similar Articles |
Additional Information
Abstract: It is well-known, that the ring of polynomial invariants of the alternating group has no finite SAGBI basis with respect to the lexicographical order for any number of variables . This note proves the existence of a nonsingular matrix such that the ring of polynomial invariants , where denotes the conjugate of with respect to , has a finite SAGBI basis for any .
- 1.
K.
N. Raghavan, Local-global principle for annihilation of local
cohomology, (South Hadley, MA, 1992) Contemp. Math., vol. 159,
Amer. Math. Soc., Providence, RI, 1994, pp. 329–331. MR 1266189
(95c:13018), http://dx.doi.org/10.1090/conm/159/01513
- 2.
Göbel, M. (1992). Reduktion
-symmetrischer Polynome für beliebige Permutationsgruppen . Diplomarbeit. Universität Passau
- 3.
Manfred
Göbel, Computing bases for rings of permutation-invariant
polynomials, J. Symbolic Comput. 19 (1995),
no. 4, 285–291. MR 1339909
(96f:13006), http://dx.doi.org/10.1006/jsco.1995.1017
- 4.
Hubert
Comon (ed.), Rewriting techniques and applications, Lecture
Notes in Computer Science, vol. 1232, Springer-Verlag, Berlin, 1997.
MR
1605520 (98i:68015)
- 5.
Manfred
Göbel, A constructive description of SAGBI bases for
polynomial invariants of permutation groups, J. Symbolic Comput.
26 (1998), no. 3, 261–272. MR 1633927
(99f:13002), http://dx.doi.org/10.1006/jsco.1998.0210
- 6.
Manfred
Göbel, The “smallest” ring of polynomial
invariants of a permutation group which has no finite SAGBI bases w.r.t.
any admissible order, Theoret. Comput. Sci. 225
(1999), no. 1-2, 177–184. MR 1708024
(2000f:13007), http://dx.doi.org/10.1016/S0304-3975(98)00340-5
- 7.
Göbel, M, Walter, J. (1999). Bases for Polynomial Invariants of Conjugates of Permutation Groups. Journal of Algorithms 32(1), 58-61 CMP 99:14
- 8.
Lorenzo
Robbiano and Moss
Sweedler, Subalgebra bases, Commutative algebra (Salvador,
1988) Lecture Notes in Math., vol. 1430, Springer, Berlin, 1990,
pp. 61–87. MR 1068324
(91f:13027), http://dx.doi.org/10.1007/BFb0085537
- 9.
Bernd
Sturmfels, Gröbner bases and convex polytopes, University
Lecture Series, vol. 8, American Mathematical Society, Providence, RI,
1996. MR
1363949 (97b:13034)
- 10.
Weispfenning, V. (1987). Admissible Orders and Linear Forms. ACM SIGSAM Bulletin 21/2, 16-18
- 1.
- Becker, T., Weispfenning, V., in Cooperation with Kredel, H. (1993). Gröbner Bases: A Computational Approach to Commutative Algebra. Springer MR 95c:13018
- 2.
- Göbel, M. (1992). Reduktion
-symmetrischer Polynome für beliebige Permutationsgruppen . Diplomarbeit. Universität Passau
- 3.
- Göbel, M. (1995). Computing Bases for Permutation-Invariant Polynomials. Journal of Symbolic Computation 19, 285-291 MR 96f:13006
- 4.
- Göbel, M. (1997). The Invariant Package of MAS. In: Comon, H., (ed.), Rewriting Techniques and Applications, 8th Intl. Conf., RTA-97, volume 1232 of LNCS, Springer, 327-330 MR 98i:68015
- 5.
- Göbel, M. (1998). A Constructive Description of SAGBI Bases for Polynomial Invariants of Permutation Groups. Journal of Symbolic Computation 26, 261-272 MR 99f:13002
- 6.
- Göbel, M. (1999). The ``Smallest'' Ring of Polynomial Invariants of a Permutation Group which has No Finite SAGBI Bases with respect to Any Admissible Order. Theoretical Computer Science 225(1-2), 177-184 MR 2000f:13007
- 7.
- Göbel, M, Walter, J. (1999). Bases for Polynomial Invariants of Conjugates of Permutation Groups. Journal of Algorithms 32(1), 58-61 CMP 99:14
- 8.
- Robbiano, L., Sweedler, M. (1990). Subalgebra Bases. In: Bruns, W., Simis, A. (eds.), Commutative Algebra (Lect. Notes Math. 1430). Springer, 61-87 MR 91f:13027
- 9.
- Sturmfels, B. (1995). Gröbner Bases and Convex Polytopes. AMS University Lecture Series, Vol. 8, Providence RI MR 97b:13034
- 10.
- Weispfenning, V. (1987). Admissible Orders and Linear Forms. ACM SIGSAM Bulletin 21/2, 16-18
Similar Articles
Retrieve articles in Mathematics of Computation
with MSC (2000):
13A50,
12Y05,
20B35,
14Q99
Retrieve articles in all journals
with MSC (2000):
13A50,
12Y05,
20B35,
14Q99
Additional Information
Manfred Göbel
Affiliation:
Dettenbachstraße 16, 94154 Neukirchen vorm Wald, Germany
Email:
goebel@informatik.uni-tuebingen.de
DOI:
http://dx.doi.org/10.1090/S0025-5718-01-01405-3
PII:
S 0025-5718(01)01405-3
Keywords:
Algorithmic invariant theory,
finite SAGBI bases,
alternating groups,
rewriting techniques
Received by editor(s):
September 7, 1999
Received by editor(s) in revised form:
July 19, 2000
Posted:
October 25, 2001
Article copyright:
© Copyright 2001 American Mathematical Society
|