Commutators in Residually Finite Groups

 The following result is proved. Let G be a residually finite group satisfying the identity ([x ₁, x ₂][x ₃, x ₄]) ⁿ  ≡ 1 for a positive integer n that is not divisible by p ² q ² for any distinct primes p and q. Then G′ is locally finite. Received 7 May 2001; in revised form 3 December 2001     

Engel Values in Residually Finite Groups

The following theorem is proved. Let n be a positive integer and q a power of a prime p. There exists a number m = m(n, q) depending only on n and q such that if G is any residually finite group satisfying the identity ([x _1,n y ₁] ⋯ [x _m,n y _m ])^q ≡ 1, then the verbal subgroup of G corresponding to the nth Engel word is locally finite.     

A new characterization of L 2(q) by its noncommuting graph

Let G be a non-abelian group and associate a non-commuting graph ∇(G) with G as follows: the vertex set of ∇(G) is G\Z(G) with two vertices x and y joined by an edge whenever the commutator of x and y is not the identity. In this short paper we prove that if G is a finite group with ∇(G) ≅ ∇(M), where M = L ₂(q) (q = p ⁿ , p is a prime), then G ≅ M.      

Parity patterns associated with lifts of Hecke groups

Let q be an odd prime, m a positive integer, and let Γ _m (q) be the group generated by two elements x and y subject to the relations x ^2m =y ^qm =1 and x ²=y ^q ; that is, Γ _m (q) is the free product of two cyclic groups of orders 2m respectively qm, amalgamated along their subgroups of order m. Our main result determines the parity behaviour of the generalized subgroup numbers of Γ _m (q) which were defined in Müller (Adv. Math. 153:118–154, 2000), and which count all the homomorphisms of index n subgroups of Γ _m (q) into a given finite group H, in the case when gcd (m,| H |)=1. This computation depends upon the solution of three counting problems in the Hecke group ℋ(q)=C ₂*C _q : (i) determination of the parity of the subgroup numbers of ℋ(q); (ii) determination of the parity of the number of index n subgroups of ℋ(q) which are isomorphic to a free product of copies of C ₂ and of C _∞; (iii) determination of the parity of the number of index n subgroups in ℋ(q) which are isomorphic to a free product of copies of C _q . The first problem has already been solved in Müller (Groups: Topological, Combinatorial and Arithmetic Aspects, LMS Lecture Notes Series, vol. 311, pp. 327–374, Cambridge University Press, Cambridge, 2004). The bulk of our paper deals with the solution of Problems (ii) and (iii). Research of C. Krattenthaler partially supported by the Austrian Science Foundation FWF, grant S9607-N13, in the framework of the National Research Network “Analytic Combinatorics and Probabilistic Number Theory”.     

Groups whose nonlinear irreducible characters separate element orders or conjugacy class sizes

A class function φ on a finite group G is said to be an order separator if, for every x and y in G \ {1}, φ(x) = φ(y) is equivalent to x and y being of the same order. Similarly, φ is said to be a class-size separator if, for every x and y in G\ {1}, φ(x) = φ(y) is equivalent to |C _G (x)| = |C _G (y)|. In this paper, finite groups whose nonlinear irreducible complex characters are all order separators (respectively, class-size separators) are classified. In fact, a more general setting is studied, from which these classifications follow. This analysis has some connections with the study of finite groups such that every two elements lying in distinct conjugacy classes have distinct orders, or, respectively, in which disctinct conjugacy classes have distinct sizes. Received: 10 April 2007     

On the composition length of finite primitive linear groups

LetG be a finite primitive linear group over a fieldK, whereK is a finite field or a number field. We bound the composition length ofG in terms of the dimension of the underlying vector space and of the degree ofK over its prime subfield. As a byproduct, we prove a result of number theory which bounds the number of prime factors (counting multiplicities) ofq ⁿ−1, whereq, n>1 are integers, improving a result of Turull and Zame [6].     

Center conditions II: Parametric and model center problems

We consider an Abel equation (*)y’=p(x)y ² +q(x)y ³ withp(x), q(x) polynomials inx. A center condition for (*) (closely related to the classical center condition for polynomial vector fields on the plane) is thaty ₀=y(0)≡y(1) for any solutiony(x) of (*). We introduce a parametric version of this condition: an equation (**)y’=p(x)y ² +εq(x)y ³ p, q as above, ℂ, is said to have a parametric center, if for any ε and for any solutiony(ε,x) of (**),y(ε,0)≡y(ε,1). We show that the parametric center condition implies vanishing of all the momentsm _k (1), wherem _k (x)=∫ ₀ ^{x pk} (t)q(t)(dt),P(x)=∫ ₀ ^x p(t)dt. We investigate the structure of zeroes ofm _k (x) and on this base prove in some special cases a composition conjecture, stated in [10], for a parametric center problem. The research of the first and the third author was supported by the Israel Science Foundation, Grant No. 101/95-1 and by the Minerva Foundation.     

Center conditions III: Parametric and model center problems

We consider an Abel equation (*)y’=p(x)y ² +q(x)y ³ withp(x), q(x) polynomials inx. A center condition for (*) (closely related to the classical center condition for polynomial vector fields on the plane) is thaty ₀=y(0)≡y(1) for any solutiony(x) of (*). Folowing [7], we consider a parametric version of this condition: an equation (**)y’=p(x)y ² +εq(x)y ³ p, q as above, ε ∈ ℂ, is said to have a parametric center, if for any ɛ and for any solutiony(ɛ,x) of (**)y(ɛ, 0)≡y(ɛ, 1).. We give another proof of the fact, shown in [6], that the parametric center condition implies vanishing of all the momentsm _k (1), wherem _k (x)=∫ ₀ ^{x pk} (t)q(t)(dt),P(x)=∫ ₀ ^x p(t)dt. We investigate the structure of zeroes ofm _k (x) and generalize a “canonical representation” ofm _k (x) given in [7]. On this base we prove in some additional cases a composition conjecture, stated in [6, 7] for a parametric center problem. The research of the first and the third author was supported by the Israel Science Foundation, Grant No. 101/95-1 and by the Minerva Foundation.     

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 ⁿ⁻¹ .

     

On Residually Finite Groups with Engel-like Conditions

Let m, n be positive integers. Suppose that G is a residually finite group in which for every element x ∈ G there exists a positive integer q = q(x) ≤ m such that x^q is left n-Engel. We show that G is locally virtually nilpotent. Further, let w be a multilinear commutator and G a residually finite group in which for every product of at most 896 w-values x there exists a positive integer q = q(x) dividing m such that x^q is left n-Engel. Then w(G) is locally virtually nilpotent.     

Conjugacy classes and finite p-groups

Let G be a finite p-group, where p is a prime number, and a ∈ G. Denote by Cl(a) = {gag⁻¹| g ∈ G} the conjugacy class of a in G. Assume that |Cl(a)| = pⁿ. Then Cl(a) Cl(a⁻¹) = {xy | x ∈ Cl(a), y ∈ Cl(a⁻¹)} is the union of at least n(p − 1) + 1 distinct conjugacy classes of G. Received: 16 December 2004     

Graphs whose every transitive orientation contains almost every relation

Given a graphG onn vertices and a total ordering ≺ ofV(G), the transitive orientation ofG associated with ≺, denotedP(G; ≺), is the partial order onV(G) defined by settingx<y inP(G; ≺) if there is a pathx=x ₁ x ₂…x _r=y inG such thatx ₁ ≺x _j for 1≦i<j≦r. We investigate graphsG such that every transitive orientation ofG contains ₂ ⁿ −o(n ²) relations. We prove that almost everyG _n,p satisfies this requirement if , but almost noG _n,p satisfies the condition if (pn log log logn)/(logn log logn) is bounded. We also show that every graphG withn vertices and at mostcn logn edges has some transitive orientation with fewer than ₂ ⁿ −δ(c)n ² relations. Partially supported by MCS Grant 8104854.     

On the definability of verbal subgroups

We show that if G is a group of finite Morley rank, then the verbal subgroup <w(G)> is of finite width, where w is a concise word. As a byproduct, we show that if G is any abelian-by-finite group, then G ⁿ =<x ⁿ (G)> is definable. Received: 15 March 1996 / Published online: 18 July 2001     

Verifying Huppert’s Conjecture for <Superscript>2</Superscript><Emphasis Type="Italic">G</Emphasis><Subscript>2</Subscript>(<Emphasis Type="Italic">q</Emphasis><Superscript>2</Superscript>)

Let G be a finite group and cd(G) be the set of irreducible character degrees of G. Bertram Huppert conjectured that if H is a finite nonabelian simple group such that cd(G) = cd(H), then G ≅ H×A, where A is an abelian group. In this paper, we verify the conjecture for the twisted Ree groups ² G ₂(q ²) for q ² = 3^2m + 1, m ≥ 1. The argument involves verifying five steps outlined by Huppert in his arguments establishing his conjecture for many of the nonabelian simple groups.     

An Extremal Problem on Degree Sequences of Graphs

 Let G=(I _n ,E) be the graph of the n-dimensional cube. Namely, I _n ={0,1} ⁿ and [x,y]∈E whenever ||x−y||₁=1. For A⊆I _n and x∈A define h _A (x) =#{y∈I _n A|[x,y]∈E}, i.e., the number of vertices adjacent to x outside of A. Talagrand, following Margulis, proves that for every set A⊆I _n of size 2 ⁿ⁻¹ we have for a universal constant K independent of n. We prove a related lower bound for graphs: Let G=(V,E) be a graph with . Then , where d(x) is the degree of x. Equality occurs for the clique on k vertices. Received: January 7, 2000 RID="*" ID="*" Supported in part by BSF and by the Israeli academy of sciences     

The residual finiteness of negatively curved polygons of finite groups

A subgroup M⊂G is almost malnormal provided that for each g∈G−M, the intersection M ^g ∩M is finite. It is proven that the free product of two virtually free groups amalgamating a finitely generated almost malnormal subgroup, is residually finite. A consequence of a generalization of this result is that an acute-angled n-gon of finite groups is residually finite if n≥4. Another consequence is that if G acts properly discontinuously and cocompactly on a 2-dimensional hyperbolic building whose chambers have acute angles and at least 4 sides, then G is residually finite. Oblatum 17-VII-2000 & 13-II-2002?Published online: 29 April 2002     

Caps with free pairs of points

We say that two points x, y of a cap C form a free pair of points if any plane containing x and y intersects C in at most three points. For given N and q, we denote by m₂⁺ (N, q) the maximum number of points in a cap of PG(N, q) that contains at least one free pair of points. It is straightforward to prove that m₂⁺ (N, q) ≤ (q^N-1 + 2q − 3)/(q − 1), and it is known that this bound is sharp for q = 2 and all N. We use geometric constructions to prove that this bound is sharp for all q when N ≤ 4. We briefly survey the motivation for constructions of caps with free pairs of points which comes from the area of statistical experimental design. Research supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) and MITACS NCE of Canada.     

New relationships between steenrod operations for certain spaces

In this paper, we show that under a certain technical condition, if a space has no 2-torsion, then eitherS q ² n x≠0 or there exists somey withS q ² n y=S q ² n ⁺¹ x, if for somen≥3S q ² n ⁺¹ x≠0. The proof uses relations between Steenrod operations and operations in connective realK-Theory. This research was partially supported by NSERC.