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     

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.     

On the irregularity strength of the m × n grid

Given a graph G with weighting w: E(G) ← Z⁺, the Strength of G(w) is the maximum weight on any edge. The sum of a vertex in G(w) is the sum of the weights of all its incident edges. The network G(w) is irregular if the vertex sums are distinct. The irregularity strength of G is the minimum strength of the graph under all irregular weightings. In this paper we determine the irregularity strength of the m × n grid for certain m and n. In particular, for every positive integer d we find the irregularity strength for all but a finite number of m × n grids where n - m = d. In addition, we present a general lower bound for the irregularity strength of graphs. © 1992 John Wiley & Sons, Inc.     

The nth Order Implicit Differentiation Formula for Two Variables with an Application to Computing All Roots of a Transcendental Function

We prove a version of a generalization of the Lagrange inversion formula (LIF) for an implicit equation G(z, w) = 0 of two variables, expressing the nth derivative of z with respect to w as a polynomial in the mixed partial derivatives function of G with respect to z and w, and negative powers of the separant G_z o \frac?G?z{G_z \equiv \frac{\partial G}{\partial z}}. Our method of proof is original, using only induction, and hence requires only that G be n-times differentiable in both variables, and requires only that the separant be nonzero. We then move on to a novel application of this LIF-like formula to derive a power series formula for each of the countably infinitely many roots of a pseudopolynomial—a finite sum of powers of a variable but allowing the powers to be any complex numbers.     

Cycles in weighted graphs

A weighted graph is one in which each edgee is assigned a nonnegative numberw(e), called the weight ofe. The weightw(G) of a weighted graphG is the sum of the weights of its edges. In this paper, we prove, as conjectured in [2], that every 2-edge-connected weighted graph onn vertices contains a cycle of weight at least 2w(G)/(n–1). Furthermore, we completely characterize the 2-edge-connected weighted graphs onn vertices that contain no cycle of weight more than 2w(G)/(n–1). This generalizes, to weighted graphs, a classical result of Erds and Gallai [4].     

Fault-tolerant routing in circulant networks and cycle prefix networks

Reliability and efficiency are important criteria in the design of interconnection networks. Connectivity is a widely used measurement for network fault-tolerance capacities, while diameter determines routing efficiency along individual paths. In practice, we are interested in high-connectivity, small-diameter networks. Recently, Hsu introduced the notion ofw-wide diameter, which unifies diameter and connectivity. This paper investigates thew-wide diameterd _w (G) and two related parameters:w-fault diameterD _w (G) andw-Rabin numberr _w (G). In particular, we determined _w (G) andD _w (G) for 2wK(G) andG is a circulant digraphG(d ⁿ ; 1,d,...,d ^n–1) or a cycle prefix digraph.Supported in part by the National Science Council under grant NSC86-2115-M009-002.     

Recognizing connectedness from vertex‐deleted subgraphs

Let G be a graph of order n. The vertex‐deleted subgraph G ? v, obtained from G by deleting the vertex v and all edges incident to v, is called a card of G. Let H be another graph of order n, disjoint from G. Then the number of common cards of G and H is the maximum number of disjoint pairs (v, w), where v and w are vertices of G and H, respectively, such that G ? v?H ? w. We prove that if G is connected and H is disconnected, then the number of common cards of G and H is at most ?n/2? + 1. Thus, we can recognize the connectedness of a graph from any ?n/2? + 2 of its cards. Moreover, we completely characterize those pairs of graphs that attain the upper bound and show that, with the exception of six pairs of graphs of order at most 7, any pair of graphs that attains the maximum is in one of four infinite families. © 2010 Wiley Periodicals, Inc. J Graph Theory 67:285‐299, 2011     

On Certain Weak Engel-Type Conditions in Groups

Let w(x, y) be a word in two variables and 𝔚 the variety determined by w. In this paper we raise the following question: if for every pair of elements a, b in a group G there exists g ∈ G such that w(a ^g , b) = 1, under what conditions does the group G belong to 𝔚? In particular, we consider the n-Engel word w(x, y) = [x, _n y]. We show that in this case the property is satisfied when the group G is metabelian. If n = 2, then we extend this result to the class of all solvable groups.     

Toughness and longest cycles in 2-connected planar graphs

Let G be a planar graph on n vertices, let c(G) denote the length of a longest cycle of G, and let w(G) denote the number of components of G. By a well-known theorem of Tutte, c(G) = n (i.e., G is hamiltonian) if G is 4-connected. Recently, Jackson and Wormald showed that c(G) ≥ βn^α for some positive constants β and α ≅ 0.2 if G is 3-connected. Now let G have connectivity 2. Then c(G) may be as small as 4, as with K_2,n-2, unless we bound w(G − S) for every subset S of V(G) with |S| = 2. Define ξ(G) as the maximum of w(G − S) taken over all 2-element subsets S ⊆ V(G). We give an asymptotically sharp lower bound for the toughness of G in terms of ξ(G), and we show that c(G) ≥ θ ln n for some positive constant θ depending only on ξ(G). In the proof we use a recent result of Gao and Yu improving Jackson and Wormald's result. Examples show that the lower bound on c(G) is essentially best-possible. © 1996 John Wiley & Sons, Inc.     

On finite groups with non-subnormal subgroups

For a finite group G, let n(G) denote the number of conjugacy classes of non-subnormal subgroups of G. In this paper, we show that a finite group G satisfying n(G)≤2|π(G)| is solvable, and for a finite non-solvable group G, n(G) = 2|π(G)|+1 if and only if G?A₅.     

Circular colorings of weighted graphs

Suppose that G is a finite simple graph and w is a weight function which assigns to each vertex of G a nonnegative real number. Let C be a circle of length t. A t-circular coloring of (G, w) is a mapping Δ of the vertices of G to arcs of C such that Δ(x)∩Δ(y) = 0 if (x, y) ∈ E(G) and Δ(x) has length w(x). The circular-chromatic number of (G, w) is the least t for which there is a t-circular coloring of (G, w). This paper discusses basic properties of circular chromatic number of a weighted graph and relations between this parameter and other graph parameters. We are particularly interested in graphs G for which the circular-chromatic number of (G, w) is equal to the fractional clique weight of (G, w) for arbitrary weight function w. We call such graphs star-superperfect. We prove that odd cycles and their complements are star-superperfect. We then prove a theorem about the circular chromatic number of lexicographic product of graphs which provides a tool of constructing new star-superperfect graphs from old ones. © 1996 John Wiley & Sons, Inc.     

Classifying Finite Simple Groups with Respect to the Number of Orbits Under the Action of the Automorphism Group

Abstract

Let ω(G) denote the number of orbits on the finite group G under the action of Aut(G). Using the classification of finite simple groups, we prove that for any positive integer n, there is only a finite number of (non-abelian) finite simple groups G satisfying ω(G) ≤ n. Then we classify all finite simple groups G such that ω(G) ≤ 17. The latter result was obtained by computational means, using the computer algebra system GAP.     

Almost fixed-point-free automorphisms of prime order

Let ϕ be an automorphism of prime order p of the group G with C _G (ϕ) finite of order n. We prove the following. If G is soluble of finite rank, then G has a nilpotent characteristic subgroup of finite index and class bounded in terms of p only. If G is a group with finite Hirsch number h, then G has a soluble characteristic subgroup of finite index in G with derived length bounded in terms of p and n only and a soluble characteristic subgroup of finite index in G whose index and derived length are bounded in terms of p, n and h only. Here a group has finite Hirsch number if it is poly (cyclic or locally finite). This is a stronger notion than that used in [Wehrfritz B.A.F., Almost fixed-point-free automorphisms of order 2, Rend. Circ. Mat. Palermo (in press)], where the case p = 2 is discussed.     

Projective Summands in Tensor Products of Simple Modules of Finite Dimensional Hopf Algebras

Abstract

Let H be a finite dimensional Hopf algebra over a field k. We show that H contains a unique maximal Hopf ideal J _w (H) contained in J(H), the Jacobson radical of H. We give various characterizations of J _w (H), for example J _w (H) = Ann _H ((H/J(H))^?n ) for all large enough n. The smallest positive integer n with this property is denoted by l _w (H). We prove that l _w (H) equals the smallest number n such that (H/J(H))^?n contains every projective indecomposable H/J _w (H)-module as a direct summand. This also equals the minimal n such that the tensor product of n suitable simple H-modules contains the projective cover of the trivial H/J _w (H)-module as a direct summand. We define projective homomorphisms between H-modules, which are used to obtain various reciprocity laws for tensor products of simple H-modules and their projective indecomposable direct summands. We also discuss some consequences of our general results in case H = kG is a group algebra of a finite group G and k is a field of characteristic p.     

On Finite n-Acentralizer Groups

Let G be a group and Aut(G) be the group of automorphisms of G. Then the Acentralizer of an automorphism α ∈Aut(G) in G is defined as C _G (α) = {g ∈ G∣α(g) = g}. For a finite group G, let Acent(G) = {C _G (α)∣α ∈Aut(G)}. Then for any natural number n, we say that G is n-Acentralizer group if |Acent(G)| =n. We show that for any natural number n, there exists a finite n-Acentralizer group and determine the structure of finite n-Acentralizer groups for n ≤ 5.     

Commutators in residually finite groups

The following result is proved. Let n be a positive integer and G a residually finite group in which every product of at most 68 commutators has order dividing n. Then G′ is locally finite.