𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing invariants of reductive groups in positive characteristic

✍ Scribed by Gregor Kemper


Publisher
SP Birkhäuser Verlag Boston
Year
2003
Tongue
English
Weight
217 KB
Volume
8
Category
Article
ISSN
1083-4362

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Computation of Invariants for Reductive
✍ Harm Derksen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 171 KB

We will give an algorithm for computing generators of the invariant ring for a given representation of a linearly reductive group. The algorithm basically consists of a single Gro bner basis computation. We will also show a connection between some open conjectures in commutative algebra and finding

Rings of matrix invariants in positive c
✍ M. Domokos; S.G. Kuzmin; A.N. Zubkov 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 196 KB

Denote by Rn;m the ring of invariants of m-tuples of n × n matrices (m; n ¿ 2) over an inÿnite base ÿeld K under the simultaneous conjugation action of the general linear group. When char(K) = 0, Razmyslov (Izv. Akad. Nauk SSSR Ser. Mat. 38 (1974) 723) and Procesi (Adv. Math. 19 (1976) 306) establis

Reductive subgroups of reductive groups
✍ Benjamin M.S. Martin 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 224 KB

Let G be a (possibly nonconnected) reductive linear algebraic group over an algebraically closed field k, and let N ∈ N. The group G acts on G N by simultaneous conjugation. Let H be a reductive subgroup of G. We prove that if k has nonzero characteristic then the natural map of quotient varieties H

Computing Modular Invariants of p-groups
✍ R James Shank; David L Wehlau 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 388 KB

Let V be a finite dimensional representation of a p-group, G, over a field, k, of characteristic p. We show that there exists a choice of basis and monomial order for which the ring of invariants, k[V ] G , has a finite SAGBI basis. We describe two algorithms for constructing a generating set for k[