𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Rationality Problem for Generic Tori in Simple Groups

✍ Scribed by Anne Cortella; Boris Kunyavskiĭ

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
178 KB
Volume
225
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

✦ Synopsis

We prove that except for several already known cases, the generic torus of a simple (adjoint or simply connected) group is not stably rational. This confirms a conjecture by Le Bruyn on generic norm tori.

📜 SIMILAR VOLUMES

Generic Patterns for Extensions of Simpl
Generic Patterns for Extensions of Simple Modules for Finite Chevalley Groups
✍ Cornelius Pillen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 78 KB

This paper describes generic patterns for the extensions between simple modules of a finite Chevalley group. A one-to-one correspondence between these extensions and the extensions between certain simple modules of the ambient algebraic group are established. It is shown that an extension appears in

Standard Generators for Sporadic Simple
Standard Generators for Sporadic Simple Groups
✍ Robert A. Wilson 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 130 KB

In recent years an increasing amount of our knowledge about finite groups, and especially the sporadic simple groups, has been obtained by computer calculations. This has many advantages over more traditional methods, especially speed and accuracy, and problems can be solved that are out of reach of

Reduction in the Rationality Problem for
Reduction in the Rationality Problem for Multiplicative Invariant Fields
✍ Nicole Marie Anne Lemire 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 228 KB

For a faithful ZG lattice A and a field K on which the group G acts by field automorphisms, let R be the normal subgroup generated by the elements of G which act trivially on K and act as reflections on A. We prove that the rationality G such that GrR ( ⍀ . We then use this reduction result to prov

A Technology for Reverse-Engineering a C
A Technology for Reverse-Engineering a Combinatorial Problem from a Rational Generating Function
✍ E. Barcucci; A. Del Lungo; A. Frosini; S. Rinaldi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 178 KB

In this paper, we tackle the problem of giving, by means of a regular language, a Ž . combinatorial interpretation of a positive sequence f defined by a linear n recurrence with integer coefficients. We propose two algorithms able to determine Ž . Ž . if the rational generating function of f , f x ,

An Algorithm for Solving the Factorizati
An Algorithm for Solving the Factorization Problem in Permutation Groups
✍ T. Minkwitz 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 345 KB

The factorization problem in permutation groups is to represent an element g of some permutation group G as a word over a given set S of generators of G. For practical purposes, the word should be as short as possible, but must not be minimal. Like many other problems in computational group theory,