Generators of Simple Lie Algebras and the Lower Rank of Some Pro-P Groups

Abstract

Let  be a simple classical Lie algebra over a field F of characteristic p > 7. We show that > d () = 2, where d() is the number of generators of . Let G be a profinite group. We say that G has lower rank ≤ l, if there are {G _α} open subgroups which from a base for the topology at the identity and each G _α is generated (topologically) by no more than l elements. There is a standard way to associate a Lie algebra L(G) to a finitely generated (filtered) pro-p group G. Suppose L(G) ?  ? tF _p [t], where  is a simple Lie algebra over F _p , the field of p elements. We show that the lower rank of G is ≤ d () + 1. We also show that if  is simple classical of rank r and p > 7 or p 2r ² ? r, then the lower rank is actually 2.     

A remark on divisibility of definable groups

We show that if G is a definably compact, definably connected definable group defined in an arbitrary o‐minimal structure, then G is divisible. Furthermore, if G is defined in an o‐minimal expansion of a field, k ∈ ? and p_k : G → G is the definable map given by p_k (x ) = x^k for all x ∈ G , then we have |(p_k )^–1(x )| ≥ k^r for all x ∈ G , where r > 0 is the maximal dimension of abelian definable subgroups of G . (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Lie nilpotence of group rings

Let FG be the group algebra of a group G over a field F. Denote by ? the natural involution, (∑f_i g_i ^-1. Let S and K denote the set of symmetric and skew symmetric and skew symmetric elements respectively with respect to this involutin. It is proved that if the characteristic of F is zero p≠2 and G has no 2-elements, then the Lie nilpotence of S or K implies the Lie nilpotence of FG.     

Unit Graphs Associated with Rings

Let R be a ring with nonzero identity. The unit graph of R, denoted by G(R), has its set of vertices equal to the set of all elements of R; distinct vertices x and y are adjacent if and only if x + y is a unit of R. In this article, the basic properties of G(R) are investigated and some characterization results regarding connectedness, chromatic index, diameter, girth, and planarity of G(R) are given. (These terms are defined in Definitions and Remarks 4.1, 5.1, 5.3, 5.9, and 5.13.)     

Finite Groups Whose Second Maximal Subgroups are ℋ-QC-Subgroups

A group G is called an “?-QC-group” if for any element x of order 2 or 4 of G, ?x? ?y? = ?y? ?x? for all y in G. In this article, we investigate the structure of the groups G of the title. Suppose that G is non-2-closed and non-2-nilpotent, then it turns out that such a group is either S ₄ or a uniquely determined group of order 48 or A ₅ or SL(2,5). The corresponding problem for G 2-closed or 2-nilpotent is open but very difficult.     

On the Schur multipliers of finite p-groups of given coclass

In this paper we obtain bounds for the order and exponent of the Schur multiplier of a p-group of given coclass. These are further improved for p-groups of maximal class. In particular, we prove that if G is p-group of maximal class, then |H ₂(G, ℤ)| < |G| and expH ₂(G, ℤ) ≤ expG. The bound for the order can be improved asymptotically.     

On hamiltonian-connected graphs

One of the most fundamental results concerning paths in graphs is due to Ore: In a graph G, if deg x + deg y ≧ |V(G)| + 1 for all pairs of nonadjacent vertices x, y ? V(G), then G is hamiltonian-connected. We generalize this result using set degrees. That is, for S ? V(G), let deg S = |_x?S N(x)|, where N(x) = {v|xv ? E(G)} is the neighborhood of x. In particular we show: In a 3-connected graph G, if deg S₁ + deg S₂ ≧ |V(G)| + 1 for each pair of distinct 2-sets of vertices S₁, S₂ ? V(G), then G is hamiltonian-connected. Several corollaries and related results are also discussed.     

Irreducible Components of Fixed Point Subvarieties of Flag Varieties

Suppose G is a connected reductive algebraic group, P is a parabolic subgroup of G, L is a Levi factor of P, and e is a regular nilpotent element in Lie L. We assume that the characteristic of the underlying field is good for G. Choose a maximal torus, T, and a Borel subgroup, B, of G, so that T?B∩L, B ? P and e ∈ Lie B. Let β be the variety of Borel subgroups of G and let ??_e be the subset of ?? consisting of Borel subgroups whose Lie algebras contain e. Finally, let W be the Weyl group of G with respect to T. For ω ∈ W let ??_ω be the B-orbit in ?? containing ^ωB. We consider the intersections ??_ω ∩ ??_e. The main result is that if dim ??_ω ∩ ??_e = dim ??_e, then ??_ω ∩ ??_e is an affine space. Thus, the irreducible components of ??_e are indexed by Weyl group elements. It is also shown that if G is of type A, then this set of Weyl group elements is a right cell in W.     

Thomassen's conjecture implies polynomiality of 1‐Hamilton‐connectedness in line graphs

A graph G is 1‐Hamilton‐connected if G?x is Hamilton‐connected for every x∈V(G), and G is 2‐edge‐Hamilton‐connected if the graph G+ X has a hamiltonian cycle containing all edges of X for any X?E⁺(G) = {xy| x, y∈V(G)} with 1≤|X|≤2. We prove that Thomassen's conjecture (every 4‐connected line graph is hamiltonian, or, equivalently, every snark has a dominating cycle) is equivalent to the statements that every 4‐connected line graph is 1‐Hamilton‐connected and/or 2‐edge‐Hamilton‐connected. As a corollary, we obtain that Thomassen's conjecture implies polynomiality of both 1‐Hamilton‐connectedness and 2‐edge‐Hamilton‐connectedness in line graphs. Consequently, proving that 1‐Hamilton‐connectedness is NP‐complete in line graphs would disprove Thomassen's conjecture, unless P = NP. © 2011 Wiley Periodicals, Inc. J Graph Theory 69: 241–250, 2012     

On the Superlinear Convergence of the Successive Approximations Method

The Ostrowski theorem is a classical result which ensures the attraction of all the successive approximations x _k+1 = G(x _k ) near a fixed point x*. Different conditions [ultimately on the magnitude of G(x*)] provide lower bounds for the convergence order of the process as a whole. In this paper, we consider only one such sequence and we characterize its high convergence orders in terms of some spectral elements of G(x*); we obtain that the set of trajectories with high convergence orders is restricted to some affine subspaces, regardless of the nonlinearity of G. We analyze also the stability of the successive approximations under perturbation assumptions.     

Odd order groups with the rewriting property Q3

Let n be an integer greater than 1, and let G be a group. A subset {x₁, x₂, ..., x_n} of n elements of G is said to be rewritable if there are distinct permutations p \pi and s \sigma of {1, 2, ..., n} such that¶¶x_p(1)x_p(2) ?x_p(n) = x_s(1)x_s(2) ?x_s(n). x_{\pi(1)}x_{\pi(2)} \ldots x_{\pi(n)} = x_{\sigma(1)}x_{\sigma(2)} \ldots x_{\sigma(n)}. ¶¶A group is said to have the rewriting property Q_n if every subset of n elements of the group is rewritable. In this paper we prove that a finite group of odd order has the property Q₃ if and only if its derived subgroup has order not exceeding 5.     

A degree condition for the circumference of a graph

We present a new condition on the degree sums of a graph that implies the existence of a long cycle. Let c(G) denote the length of a longest cycle in the graph G and let m be any positive integer. Suppose G is a 2-connected graph with vertices x₁,…,x_n and edge set E that satisfies the property that, for any two integers j and k with j < k, x_jx_k ? E, d(x_i) ? j and d(x_k) ? K - 1, we have (1) d(x_i) + d(x_k ? m if j + k ? n and (2) if j + k < n, either m ? n or d(x_j) + d(x_k) ? min(K + 1,m). Then c(G) ? min(m, n). This result unifies previous results of J.C. Bermond and M. Las Vergnas, respectively.     

Real elements in groups of type <Emphasis Type="Italic">F</Emphasis><Subscript>4</Subscript>

Let G be a group. An element x ∈ G is called real if x is conjugate to x ^?1 in G. In this paper we study the structure of real elements in the compact connected Lie group of type F ₄ and algebraic groups of type F ₄ defined over an arbitrary field.     

On Weakly ℋ-Subgroups of Finite Groups

Let G be a finite group. A subgroup H of G is called an ?-subgroup in G if N _G (H) ∩ H ^x  ≤ H for all x ∈ G. A subgroup H of G is called weakly ?-subgroup in G if there exists a normal subgroup K of G such that G = HK and H ∩ K is an ?-subgroup in G. In this article, we investigate the structure of the finite group G under the assumption that all maximal subgroups of every Sylow subgroup of some normal subgroup of G are weakly ?-subgroups in G. Some recent results are extended and generalized.     

Exponent preserving subgroups of the finite simple groups

Given a group G denote with exp(G) its exponent, which is the least common multiple of the order of its elements. In this paper, we solve the problem of finding the finite simple groups having a proper subgroup with the same exponent. For each G with this property we will provide an explicit example of H<G with exp(G)?=?exp(H).     

Circular perfect graphs

For 1 ≤ d ≤ k, let K_k/d be the graph with vertices 0, 1, …, k ? 1, in which i ～j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χ_c(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to K_k/d. The circular clique number ω_c(G) of G is the maximum of those k/d for which K_k/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χ_c(H) = ω_c(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, N_G[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, N_G[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P₅ (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph K_k/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005     

Recognition by noncommuting graph of finite simple groups L 4(q)

Let G be a nonabelian group. We define the noncommuting graph ∇(G) of G as follows: its vertex set is G\Z(G), the set of non-central elements of G, and two different vertices x and y are joined by an edge if and only if x and y do not commute as elements of G, i.e., [x, y] ≠ 1. We prove that if L ∈ {L ₄(7), L ₄(11), L ₄(13), L ₄(16), L ₄(17)} and G is a finite group such that ∇(G) ≅ ∇(L), then G ≅ L.     

On Lie algebra decompositions related to spherical homogeneous spaces

LetG be a connected, reductive, linear algebraic group over an algebraically closed fieldk of characteristik zero. LetH ₁ andH ₂ be two spherical subgroups ofG. It is shown that for allg in a Zariski open subset ofG one has a Lie algebra decomposition g = h₁ + Adg ? h₂, where a is the Lie algebra of a torus and dim a ≤ min (rankG/H ₁,rankG/H ₂). As an application one obtains an estimate of the transcendence degree of the fieldk(G/H ₁ xG/H ₂) ^G for the diagonal action ofG. Ifk = ? andG _a is a real form ofG defined by an antiholomorphic involution σ :G→G then for a spherical subgroup H ? G and for allg in a Hausdorff open subset ofG one has a decomposition g = g_a + a Adg ? h, where a is the Lie algebra of σ-invariant torus and dim a ≤ rankG/H.