Black box groups

2007-01-01
Yalcinkaya, Sukru
We propose a uniform approach for recognizing all black box groups of Lie type which is based on the analysis of the structure of the centralizers of involutions. Our approach can be viewed as a computational version of the classification of the finite simple groups. We present an algorithm which constructs a long root SL2(q)-subgroup in a finite simple group of Lie type of odd characteristic, then we use the Aschbacher's "Classical Involution Theorem" as a model in the recognition algorithm and we construct all root SL2(q)-subgroups corresponding to the nodes in the extended Dynkin diagram, that is, we construct the extended Curtis - Phan - Tits system of the finite simple groups of Lie type of odd characteristic. In particular, we construct all subsystem subgroups which can be read from the extended Dynkin diagram. We also present an algorithm which determines whether the p-core (or "unipotent radical") O-p(G) of a black box group G is trivial or not, where G/O-p(G) is a finite simple classical group of odd characteristic p, answering a well-known question of Babai and Shalev.
TURKISH JOURNAL OF MATHEMATICS

Suggestions

Adaptation and Fine-Tuning of the Weighted Sum Method on Personnel Assignment Problem with Hierarchical Ordering and Team Constraints
Arslanoglu, Yilmaz; Toroslu, İsmail Hakkı (2011-09-28)
This work deals with the multi-objective optimization problem, Personnel Assignment Problem with Hierarchical Ordering and Team Constraints, which appears in personnel assignment of large hierarchical organizations, such as military. Weighted Sum Method, which is one of the pioneering approaches towards multi-objective optimization, is considered as the means of solution to the problem. The adaptation of this intuitive and successful method to the problem, and an analysis on fine-tuning of its various param...
Black box groups and related group theoretic constructions
Yalçınkaya, Şükrü; Berkman, Ayşe; Department of Mathematics (2007)
The present thesis aims to develop an analogy between the methods for recognizing a black box group and the classification of the finite simple groups. We propose a uniform approach for recognizing simple groups of Lie type which can be viewed as the computational version of the classification of the finite simple groups. Similar to the inductive argument on centralizers of involutions which plays a crucial role in the classification project, our approach is based on a recursive construction of the centrali...
Gray level topological corner detection
Cihan, Ibrahim Kivanc; Senel, Hakan Gueray (2007-06-07)
A new corner detection algorithm based on the topological median filter is proposed. Topological quasi dilation and erosion operators with circular structuring element are used to detect the corners on gray level images.
Descriptive complexity of subsets of the space of finitely generated groups
Benli, Mustafa Gökhan; Kaya, Burak (2022-12-01)
© 2022 Elsevier GmbHIn this paper, we determine the descriptive complexity of subsets of the Polish space of marked groups defined by various group theoretic properties. In particular, using Grigorchuk groups, we establish that the sets of solvable groups, groups of exponential growth and groups with decidable word problem are Σ20-complete and that the sets of periodic groups and groups of intermediate growth are Π20-complete. We also provide bounds for the descriptive complexity of simplicity, amenability,...
Universal groups of intermediate growth and their invariant random subgroups
Benli, Mustafa Gökhan; Nagnibeda, Tatiana (2015-07-01)
We exhibit examples of groups of intermediate growth with ergodic continuous invariant random subgroups. The examples are the universal groups associated with a family of groups of intermediate growth.
Citation Formats
S. Yalcinkaya, “Black box groups,” TURKISH JOURNAL OF MATHEMATICS, pp. 171–210, 2007, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/63344.