On the validity of Thompson’s conjecture for alternating groups
نویسندگان
چکیده
Let G be a group. Let π(G) be the set of prime divisor of |G|. Let GK(G) denote the graph with vertex set π(G) such that two primes p and q in π(G) are joined by an edge if G has an element of order p · q. We use s(G) to denote the number of connected components of the prime graph GK(G). Let N(G) be the set of nonidentity orders of conjugacy classes of elements in G. Some authors have proved that the groups An where n = p, p + 1, p + 2 with s(G) ≥ 2, are characterized by N(G). Then if s(G) = 1, we know that Liu and Yang proved that alternating groups Ap+3 are characterized by N(G). As the development of this topics, we will prove that if G is a finite group with trivial center and N(G) = N(Ap+4) with p+ i composite and 1 ≤ i ≤ 4, then G is isomorphic to Ap+4. Key–Words: Element order, Alternating group, Thompson’s conjecture, Conjugacy classes, Simple group.
منابع مشابه
Simple groups with the same prime graph as $D_n(q)$
Vasil'ev posed Problem 16.26 in [The Kourovka Notebook: Unsolved Problems in Group Theory, 16th ed.,Sobolev Inst. Math., Novosibirsk (2006).] as follows:Does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? Conjecture: $k = 5$.In [Zvezdina, On nonabelian simple groups having the same prime graph a...
متن کاملThompson’s conjecture for real semi-simple Lie groups
A proof of Thompson’s conjecture for real semi-simple Lie groups has been given by Kapovich, Millson, and Leeb. In this note, we give another proof of the conjecture by using a theorem of Alekseev, Meinrenken, and Woodward from symplectic geometry.
متن کاملCharacterizability of Finite Simple Groups by their Order Components: A Summary of Results
Let G be a finite group and let OC(G) be the set of order components of G. The number of non-isomorphic classes of finite groups H satisfying OC(G) = OC(H) is denoted by h(G). If h(G) = k then G is called a k-recognizable group by the set of its order components and if k = 1, G is called a recognizable group. The main consequence of recognizability of a group G by its order components is the va...
متن کاملLocal Similarity Groups with Context-free Co-word Problem
Let G be a group, and let S be a finite subset of G that generates G as a monoid. The co-word problem is the collection of words in the free monoid S that represent non-trivial elements of G. A current conjecture, based originally on a conjecture of Lehnert and modified into its current form by Bleak, Matucci, and Neuhöffer, says that Thompson’s group V is a universal group with context-free co...
متن کاملEmbeddings into Thompson's group V and coCF groups
Lehnert and Schweitzer show in [21] that R. Thompson’s group V is a co-context-free (coCF ) group, thus implying that all of its finitely generated subgroups are also coCF groups. Also, Lehnert shows in his thesis that V embeds inside the coCF group QAut(T2,c), which is a group of particular bijections on the vertices of an infinite binary 2-edge-colored tree, and he conjectures that QAut(T2,c)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015