scientific article; zbMATH DE number 1272996
algorithmsblack box groupscentralizers of involutionsgroups of finite Morley ranksimple algebraic groupssimple tame \(K^*\)-groups of odd type
Classification theory, stability, and related concepts in model theory (03C45) Models with special properties (saturated, rigid, etc.) (03C50) Model-theoretic algebra (03C60) Software, source code, etc. for problems pertaining to group theory (20-04) Applications of logic to group theory (20A15) Simple groups (20E32) Linear algebraic groups over arbitrary fields (20G15) Linear algebraic groups over finite fields (20G40) Symbolic computation and algebraic computation (68W30)
A \(K\)-group is a group of finite Morley rank such that every of its infinite simple definable and connected sections is an algebraic group over an algebraically closed field. A \(K^*\)-group is a group of finite Morley rank in which every proper definable subgroup is a \(K\)-group. The topic of research is the classification of simple tame \(K^*\)-groups of odd type. In this connection the author discovers new examples of how involutions determine the structure of groups. The main result is the characterization of simple algebraic groups of rank 2 over an algebraically closed field of characteristic \(\neq 2\) in the class of tame \(K^*\)-groups of finite Morley rank by means of centralizers of involutions. The second part of the paper is concerned with algorithms for black box groups. The main result here is the following theorem: There is a Monte Carlo algorithm which, when given a black box group \(G\) isomorphic to a simple classical group of type \(B_n\) or \(C_n\) defined over some field of given size \(q\), can decide if \(G\) is of type \(C_n\) in time \(O(\mu n^3\log q+\varepsilon n)\). The algorithm is one-sided if \(n\) is odd.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4237289)
