ترغب بنشر مسار تعليمي؟ اضغط هنا

Variants of some of the Brauer-Fowler Theorems

98   0   0.0 ( 0 )
 نشر من قبل Robert Guralnick
 تاريخ النشر 2018
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

Brauer and Fowler noted restrictions on the structure of a finite group G in terms of the order of the centralizer of an involution t in G. We consider variants of these themes. We first note that for an arbitrary finite group G of even order, we have |G| is less than the number of conjugacy classes of the Fitting subgroup times the order of the centralizer to the fourth power of any involution in G. This result does require the classification of the finite simple groups. The groups SL(2,q) with q even shows that the exponent 4 cannot be replaced by any exponent less than 3. We do not know at present whether the exponent 4 can be improved in general, though we note that the exponent 3 suffices for almost simple groups G. We are however able to prove that every finite group $G$ of even order contains an involution u such that [G:F(G)] is less than the cube of the order of the centralizer of u. There is a dichotomy in the proof of this fact, as it reduces to proving two residual cases: one in which G is almost simple (where the classification of the finite simple groups is needed) and one when G has a Sylow 2-subgroup of order 2. For the latter result, the classification of finite simple groups is not needed (though the Feit-Thompson odd order theorem is). We also prove a very general result on fixed point spaces of involutions in finite irreducible linear groups which does not make use of the classification of the finite simple groups, and some other results on the existence of non-central elements (not necessarily involutions) with large centralizers in general finite groups. We also show (without the classification of finite simple groups) that if t is an involution in G and p is a prime divisor of [G:F(G)], then p is at most 1 plus the order of the centralizer of t (and this is best possible).



قيم البحث

اقرأ أيضاً

149 - Karl Auinger 2012
The Krohn--Rhodes complexity of the Brauer semigroup $mathfrak{B}_n$ and of the annular semigroup $mathfrak{A}_n$ is computed.
259 - J. Jonuv{s}as , J. D. Mitchell , 2017
In this paper, we present two algorithms based on the Froidure-Pin Algorithm for computing the structure of a finite semigroup from a generating set. As was the case with the original algorithm of Froidure and Pin, the algorithms presented here produ ce the left and right Cayley graphs, a confluent terminating rewriting system, and a reduced word of the rewriting system for every element of the semigroup. If $U$ is any semigroup, and $A$ is a subset of $U$, then we denote by $langle Arangle$ the least subsemigroup of $U$ containing $A$. If $B$ is any other subset of $U$, then, roughly speaking, the first algorithm we present describes how to use any information about $langle Arangle$, that has been found using the Froidure-Pin Algorithm, to compute the semigroup $langle Acup Brangle$. More precisely, we describe the data structure for a finite semigroup $S$ given by Froidure and Pin, and how to obtain such a data structure for $langle Acup Brangle$ from that for $langle Arangle$. The second algorithm is a lock-free concurrent version of the Froidure-Pin Algorithm.
83 - Zhengjun Cao , Lihua Liu 2015
At Eurocrypt99, Paillier presented a public-key cryptosystem based on a novel computational problem. It has interested many researchers because it was additively homomorphic. In this paper, we show that there is a big difference between the original Pailliers encryption and some variants. The Pailliers encryption can be naturally transformed into a signature scheme but these variants miss the feature. In particular, we simplify the alternative decryption procedure of Bresson-Catalano-Pointcheval encryption scheme proposed at Asiacrypt03. The new version is more applicable to cloud computing because of its double trapdoor decryption mechanism and its flexibility to be integrated into other cryptographic schemes. It captures a new feature that its two groups of secret keys can be distributed to different users so as to enhance the robustness of key management.
In this paper we study prime graphs of finite groups. The prime graph of a finite group $G$, also known as the Gruenberg-Kegel graph, is the graph with vertex set {primes dividing $|G|$} and an edge $p$-$q$ if and only if there exists an element of o rder $pq$ in $G$. In finite group theory, studying the prime graph of a group has been an important topic for the past almost half century. Only recently prime graphs of solvable groups have been characterized in graph theoretical terms only. In this paper, we continue this line of research and give complete characterizations of several classes of groups, including groups of square-free order, metanilpotent groups, groups of cube-free order, and, for any $nin mathbb{N}$, solvable groups of $n^text{th}$-power-free order. We also explore the prime graphs of groups whose composition factors are cyclic or $A_5$ and draw connections to a conjecture of Maslova. We then propose an algorithm that recovers the prime graph from a dual prime graph.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا