𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sharpening the generalized Noether bound in the invariant theory of finite groups

✍ Scribed by Müfit Sezer


Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
103 KB
Volume
254
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


The Noether Bound in Invariant Theory of
✍ Peter Fleischmann 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 133 KB

Let R be a commutative ring, V a finitely generated free R-module and G GL R (V) a finite group acting naturally on the graded symmetric algebra A=Sym(V). Let ;(A G ) denote the minimal number m, such that the ring A G of invariants can be generated by finitely many elements of degree at most m. Fur

Explicit Generators of the Invariants of
✍ David R. Richman 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 681 KB

Let R denote a commutative (and associative) ring with 1 and let A denote a finitely generated commutative R-algebra. Let G denote a finite group of R-algebra automorphisms of A. In the case that R is a field of characteristic 0, Noether constructed a finite set of R-algebra generators of the invari

Bounds in the Theory of Finite Covers
✍ David M. Evans; Osama A. Rashwan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 179 KB

We give an upper bound for the number of conjugacy classes of closed subgroups of the full wreath product FWr W Sym which project onto Sym . Here, is infinite, W is the set of n-tuples of distinct elements from (for some finite n), F is a finite nilpotent group, and the topology on the wreath produc

Generating a Noetherian Normalization of
✍ Wolfram Decker; Agnes Eileen Heydtmann; Frank-Olaf Schreyer 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 320 KB

We improve Kemper's algorithm for the computation of a noetherian normalization of the invariant ring of a finite group. The new algorithm, which still works over arbitrary coefficient fields, no longer relies on algorithms for primary decomposition.