The solvable radical of Sylow factorizable groups

Let G be a finite group. A complete Sylow product of G is a product of Sylow subgroups of G, one for each prime divisor of |G|. We shall call G a Sylow factorizable group if it is equal to at least one of its complete Sylow products. We prove that if G is a Sylow factorizable group then the intersection of all complete Sylow products of G is equal to the solvable radical of G. We generalize the concepts and the result to Sylow products which involve an arbitrary subset of the prime divisors of |G|. Received: 26 January 2005     

Fields of values of Fong characters

If G is a p-solvable finite group with a p-complement H and φ ∈ IBr(G), then P. Fong showed that there exists α ∈ Irr(H) such that α^G=Φ_φ. In this note we prove that α can be chosen such that the field of values index divides φ (1)p. Received: 6 May 2005     

Block separation in solvable groups

If π is a set of primes, a finite group G is block π-separated if for every two distinct irreducible complex characters α, β ∈ Irr(G) there exists a prime p ∈ π such that α and β lie in different Brauer p-blocks. A group G is block separated if it is separated by the set of prime divisors of |G|. Given a set π with n different primes, we construct an example of a solvable π-group G which is block separated but it is not separated by every proper subset of π. Received: 22 December 2004     

Automorfismi spezzanti di ordine primo

LetG be a group andα εAut(G);α is calledn-splitting if gg^α...g^{α n-1}=1 ∀g εG. In this note we study the structure of finite groups admitting an-splitting automorphism of orderp (p an odd prime number).

     

Una nota sui gruppi policiclici che ammettono un automorfismo con numero di Reidemeister finito

LetG be a group and ϕ an automorphism ofG. Two elementsx, y ∈ G are called ϕ-conjugate if there existsg ∈ G such thatx=g ⁻¹ yg ^θ. It is easily verified that the ϕ-conjugation is an equivalence relation; the numberR(ϕ) of ϕ-classes ofG is called the Reidemeister number of the automorphism ϕ. In this paper we prove that if a polycyclic groupsG admits an automorphism ϕ of ordern such thatR(ϕ)<∞, thenG contains a subgroup of finite index with derived length at most 2 ⁿ⁻¹ .

     

Finite 2-groups with a nonabelian Frattini subgroup of order 16

According to a classical result of Burnside, if G is a finite 2-group, then the Frattini subgroup Φ(G) of G cannot be a nonabelian group of order 8. Here we study the next possible case, where G is a finite 2-group and Φ(G) is nonabelian of order 16. We show that in that case Φ(G) ≅ M × C₂, where M ≅ D₈ or M ≅ Q₈ and we shall classify all such groups G (Theorem A). Received: 16 February 2005; revised: 7 March 2005     

Conjecture of Li and Praeger concerning the isomorphisms of Cayley graphs of A5

LetG be a finite group, andS a subset ofG \ |1| withS =S ⁻¹. We useX = Cay(G,S) to denote the Cayley graph ofG with respect toS. We callS a Cl-subset ofG, if for any isomorphism Cay(G,S) ≈ Cay(G,T) there is an α∈ Aut(G) such thatS ^α =T. Assume that m is a positive integer.G is called anm-Cl-group if every subsetS ofG withS =S ⁻¹ and | S | ≤m is Cl. In this paper we prove that the alternating groupA ₅ is a 4-Cl-group, which was a conjecture posed by Li and Praeger.     

A description of Baer-Suzuki type of the solvable radical of a finite group

We obtain the following characterization of the solvable radical R(G) of any finite group G: R(G) coincides with the collection of all g∈G such that for any 3 elements a₁,a₂,a₃∈G the subgroup generated by the elements , i=1,2,3, is solvable. In particular, this means that a finite group G is solvable if and only if in each conjugacy class of G every 4 elements generate a solvable subgroup. The latter result also follows from a theorem of P. Flavell on {2,3}^′-elements in the solvable radical of a finite group (which does not use the classification of finite simple groups).     

How many elements are needed to generate a finite group with good probability?

We prove that for any real number 0<α<1, there exists a constantc _α such that the probability of generating a finite groupG with [d(G)+c _α log log |G| log log log |G|] elements is at least α.     

The average number of Sylow subgroups of a finite group

We prove that if the average Sylow number (ignoring the Sylow numbers that are one) of a finite group G is ?7, then G is solvable.     

Group algebras

Given a group G and a commutative ring k with identity, one can define an k-algebra k[G] called the group algebra of G over k. An element α ∈ k[G] is said to be algebraic if f(α) = 0 for some non-zero polynomial f(X) ∈ k[X]. We will discuss some of the developments in the study of algebraic elements in group algebras.     

Large Monotone Paths in Graphs with Bounded Degree

 We prove that for every ε>0 and positive integer r, there exists Δ₀=Δ₀(ε) such that if Δ>Δ₀ and n>n(Δ,ε,r) then there exists a packing of K _n with ⌊(n−1)/Δ⌋ graphs, each having maximum degree at most Δ and girth at least r, where at most εn ² edges are unpacked. This result is used to prove the following: Let f be an assignment of real numbers to the edges of a graph G. Let α(G,f) denote the maximum length of a monotone simple path of G with respect to f. Let α(G) be the minimum of α(G,f), ranging over all possible assignments. Now let α_Δ be the maximum of α(G) ranging over all graphs with maximum degree at most Δ. We prove that Δ+1≥α_Δ≥Δ(1−o(1)). This extends some results of Graham and Kleitman [6] and of Calderbank et al. [4] who considered α(K _n ). Received: March 15, 1999?Final version received: October 22, 1999     

Automorfismi spezzanti di ordine 2

LetG be a group and α an automorphism ofG; α is calledn-splitting if for allg∈G. In this note we study the structure of finite groups admitting an-splitting automorphism of order 2.

     

Contractions of infrainvariant systems of subgroups

We create a method which allows an arbitrary group G with an infrainvariant system ℒ(G) of subgroups to be embedded in a group G* with an infrainvariant system ℒ(G*) of subgroups, so that G _α^* ∩G ∈ ℒ(G) for every subgroup G _α^* ∩G ∈ ℒ(G*) and each factor B/A of a jump of subgroups in ℒ(G*) is isomorphic to a factor of a jump in ℒ(G), or to any specified group H. Using this method, we state new results on right-ordered groups. In particular, it is proved that every Conrad right-ordered group is embedded with preservation of order in a Conrad right-ordered group of Hahn type (i.e., a right-ordered group whose factors of jumps of convex subgroups are order isomorphic to the additive group ℝ); every right-ordered Smirnov group is embedded in a right-ordered Smirnov group of Hahn type; a new proof is given for the Holland–McCleary theorem on embedding every linearly ordered group in a linearly ordered group of Hahn type.     

On Subsets with Small Product in Torsion-Free Groups

G be a nonabelian torsion-free group. Let C be a finite generating subset of G such that . We prove that, for all subsets B of G with , we have . In particular, a finite subset X with cardinality satisfies the inequality if and only if there are elements , such that the following two conditions hold: (i) . (ii) where . Received: October 13, 1997/Revised: Revised August 18, 1998     

Projective bases of division algebras and groups of central type II

Let G be a finite group and let k be a field. We say that G is a projective basis of a k-algebra A if it is isomorphic to a twisted group algebra k ^α G for some α ∈ H ²(G, k ^×), where the action of G on k ^× is trivial. In a preceding paper by Aljadeff, Haile and the author it was shown that if a group G is a projective basis of a k-central division algebra, then G is nilpotent and every Sylow p-subgroup of G is on the short list of p-groups, denoted by Λ. In this paper we complete the classification of projective bases of division algebras by showing that every group on that list is a projective basis for a suitable division algebra. We also consider the question of uniqueness of a projective basis of a k-central division algebra. We show that basically all groups on the list Λ but one satisfy certain rigidity property. This work was supported in part by the US-Israel Binational Science Foundation Grant 82334. The author would like to thank Louis Rowen and the Department Department of Mathematics at Bar Ilan University, Ramat Gan, Israel, for kind hospitality and support.     

On hamiltonicity of <Emphasis Type="Italic">P</Emphasis><Subscript>3</Subscript>-dominated graphs

We introduce a new class of graphs which we call P ₃-dominated graphs. This class properly contains all quasi-claw-free graphs, and hence all claw-free graphs. Let G be a 2-connected P ₃-dominated graph. We prove that G is hamiltonian if α(G ²) ≤ κ(G), with two exceptions: K _2,3 and K _1,1,3. We also prove that G is hamiltonian, if G is 3-connected and |V(G)| ≤ 5δ(G) − 5. These results extend known results on (quasi-)claw-free graphs. This paper was completed when both authors visited the Center for Combinatorics, Nankai University, Tianjin. They gratefully acknowledge the hospitality and support of the Center for Combinatorics and Nankai University. The work of E.Vumar is sponsored by SRF for ROCS, REM.     

A characterisation of virtually free groups

We prove that a finitely generated group G is virtually free if and only if there exists a generating set for G and k > 0 such that all k-locally geodesic words with respect to that generating set are geodesic. Received: 30 October 2006