The ``smallest ring of polynomial invariants of a permutation group which has no finite SAGBI bases w. r. t. any admissible order

DOI10.1016/S0304-3975(98)00340-5zbMath0930.68172MaRDI QIDQ1960663

Manfred Göbel

Publication date: 12 January 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

SAGBI basisalgorithmic invariant theoryalternating group \(A_{3}\)

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (3)

Finite SAGBI bases for polynomial invariants of conjugates of alternating groups ⋮ Reduction of permutation-invariant polynomials. A noncommutative case study ⋮ Rings of polynomial invariants of the alternating group have no finite SAGBI bases with respect to any admissible order

Cites Work

• A constructive description of SAGBI bases for polynomial invariants of permutation groups
• Computing bases for rings of permutation-invariant polynomials
• Calculating invariant rings of finite groups over arbitrary fields
• Admissible orders and linear forms
• Algorithms in invariant theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The ``smallest ring of polynomial invariants of a permutation group which has no finite SAGBI bases w. r. t. any admissible order