On soluble groups of module automorphisms of finite rank

Let R be a commutative ring, M an R-module and G a group of R-automorphisms of M, usually with some sort of rank restriction on G. We study the transfer of hypotheses between M/C _M (G) and [M,G] such as Noetherian or having finite composition length. In this we extend recent work of Dixon, Kurdachenko and Otal and of Kurdachenko, Subbotin and Chupordia. For example, suppose [M,G] is R-Noetherian. If G has finite rank, then M/C _M (G) also is R-Noetherian. Further, if [M,G] is R-Noetherian and if only certain abelian sections of G have finite rank, then G has finite rank and is soluble-by-finite. If M/C _M (G) is R-Noetherian and G has finite rank, then [M,G] need not be R-Noetherian.     

Finite <Emphasis Type="Italic">p</Emphasis>-groups with a class of complemented normal subgroups

Assume G is a finite group and H a subgroup of G. If there exists a subgroup K of G such that G = HK and H ∩ K = 1, then K is said to be a complement to H in G. A finite p-group G is called an NC-group if all its proper normal subgroups not contained in Φ(G) have complements. In this paper, some properties of NC-groups are investigated and some classes of NC-groups are classified.     

Cycles in dense digraphs

Let G be a digraph (without parallel edges) such that every directed cycle has length at least four; let β(G) denote the size of the smallest subset X ? E(G) such that G?X has no directed cycles, and let γ(G) be the number of unordered pairs {u, v} of vertices such that u, v are nonadjacent in G. It is easy to see that if γ(G) = 0 then β(G) = 0; what can we say about β(G) if γ(G) is bounded?

We prove that in general β(G) ≤ γ(G). We conjecture that in fact β(G) ≤ ½γ(G) (this would be best possible if true), and prove this conjecture in two special cases:

• when V(G) is the union of two cliques
• when the vertices of G can be arranged in a circle such that if distinct u, v, w are in clockwise order and uw is a (directed) edge, then so are both uv, vw.

     

Finite Groups with Given Weakly <Emphasis Type="Italic">σ</Emphasis>-Permutable Subgroups

Let G be a finite group and let σ = {σ _i | i ∈ I} be a partition of the set of all primes P. A set ? of subgroups of G is said to be a complete Hall σ-set of G if each nonidentity member of ? is a Hall σ _i -subgroup of G and ? has exactly one Hall σ _i -subgroup of G for every σ _i ∈ σ(G). A subgroup H of G is said to be σ-permutable in G if G possesses a complete Hall σ-set ? such that HA ^x = A ^x H for all A ∈ ? and all x ∈ G. A subgroup H of G is said to be weakly σ-permutable in G if there exists a σ-subnormal subgroup T of G such that G = HT and H ∩ T ≤ H _σG , where H _σG is the subgroup of H generated by all those subgroups of H which are σ-permutable in G. We study the structure of G under the condition that some given subgroups of G are weakly σ-permutable in G. In particular, we give the conditions under which a normal subgroup of G is hypercyclically embedded. Some available results are generalized.     

On an open problem of Guo-Skiba

Let G be a finite group, and let A be a proper subgroup of G. Then any chief factor H/A _G of G is called a G-boundary factor of A. For any Gboundary factor H/A _G of A, the subgroup (A ∩ H)/A _G of G/ A _G is called a G-trace of A. In this paper, we prove that G is p-soluble if and only if every maximal chain of G of length 2 contains a proper subgroup M of G such that either some G-trace of M is subnormal or every G-boundary factor of M is a p′-group. This result give a positive answer to a recent open problem of Guo and Skiba. We also give some new characterizations of p-hypercyclically embedded subgroups.     

Finite groups with some non-Abelian subgroups of non-prime-power order

Let G be a finite group and NA(G) denote the number of conjugacy classes of all nonabelian subgroups of non-prime-power order of G. The Symbol π(G) denote the set of the prime divisors of |G|. In this paper we establish lower bounds on NA(G). In fact, we show that if G is a finite solvable group, then NA(G) = 0 or NA(G) ≥ 2^|π(G)|?2, and if G is non-solvable, then NA(G) ≥ |π(G)| + 1. Both lower bounds are best possible.     

Polycyclic groups admitting a regular automorphism of order four

Let G be a polycyclic group and α a regular automorphism of order four of G. If the map φ: G→ G defined by g~φ= [g, α] is surjective, then the second derived group of G is contained in the centre of G. Abandoning the condition on surjectivity, we prove that C_G(α~2) and G/[G, α~2] are both abelian-by-finite.     

New characterization of <Emphasis Type="Italic">S</Emphasis><Subscript>4</Subscript>(<Emphasis Type="Italic">q</Emphasis>) by its noncommuting graph

Let G be a nonabelian group, and associate the noncommuting 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. Let S ₄(q) be the projective symplectic simple group, where q is a prime power. We prove that if G is a group with ?(G) ? ?(S ₄(q)) then G ? S ₄(q).     

Products of F*(<Emphasis Type="Italic">G</Emphasis>)-subnormal subgroups of finite groups

A subgroup H of a finite group G is called F*(G)-subnormal if H is subnormal in HF*(G). We show that if a group Gis a product of two F*(G)-subnormal quasinilpotent subgroups, then G is quasinilpotent. We also study groups G = AB, where A is a nilpotent F*(G)-subnormal subgroup and B is a F*(G)-subnormal supersoluble subgroup. Particularly, we show that such groups G are soluble.     

On trees with total domination number equal to edge-vertex domination number plus one

An edge e∈E(G) dominates a vertex v∈V(G) if e is incident with v or e is incident with a vertex adjacent to v. An edge-vertex dominating set of a graph G is a set D of edges of G such that every vertex of G is edge-vertex dominated by an edge of D. The edge-vertex domination number of a graph G is the minimum cardinality of an edge-vertex dominating set of G. A subset D?V(G) is a total dominating set of G if every vertex of G has a neighbor in D. The total domination number of G is the minimum cardinality of a total dominating set of G. We characterize all trees with total domination number equal to edge-vertex domination number plus one.     

An implicit degree condition for relative length of long paths and cycles in graphs

For a graph G, we denote by p(G) and c(G) the number of vertices of a longest path and a longest cycle in G, respectively. For a vertex v in G, id(v) denotes the implicit degree of v. In this paper, we obtain that if G is a 2-connected graph on n vertices such that the implicit degree sum of any three independent vertices is at least n + 1, then either G contains a hamiltonian path, or c(G) ≥ p(G) ? 1.     

Finite groups with <Emphasis Type="Italic">C</Emphasis>-quasinormal subgroups

Consider some finite group G and a finite subgroup H of G. Say that H is c-quasinormal in G if G has a quasinormal subgroup T such that HT = G and T ∩ H is quasinormal in G. Given a noncyclic Sylow subgroup P of G, we fix some subgroup D such that 1 < |D| < | P| and study the structure of G under the assumption that all subgroups H of P of the same order as D, having no supersolvable supplement in G, are c-quasinormal in G.     

A new characterization of symmetric group by NSE

Let G be a group and ω(G) be the set of element orders of G. Let k ∈ ω(G) and m _k (G) be the number of elements of order k in G. Let nse(G) = {m _k (G): k ∈ ω(G)}. Assume r is a prime number and let G be a group such that nse(G) = nse(S _r ), where S _r is the symmetric group of degree r. In this paper we prove that G ? S _r , if r divides the order of G and r ² does not divide it. To get the conclusion we make use of some well-known results on the prime graphs of finite simple groups and their components.     

The absolute continuity of convolution products of orbital measures in exceptional symmetric spaces

Let G be a non-compact group, K the compact subgroup fixed by a Cartan involution and assume G / K is an exceptional, symmetric space, one of Cartan type E, F or G. We find the minimal integer, L(G),  such that any convolution product of L(G) continuous, K-bi-invariant measures on G is absolutely continuous with respect to Haar measure. Further, any product of L(G) double cosets has non-empty interior. The number L(G) is either 2 or 3, depending on the Cartan type, and in most cases is strictly less than the rank of G.     

On the length of a finite group and of its 2-generator subgroups

The nonsoluble length λ(G) of a finite group G is defined as the minimum number of nonsoluble factors in a normal series of G each of whose quotients either is soluble or is a direct product of nonabelian simple groups. The generalized Fitting height of a finite group G is the least number h = h* (G) such that F* _h (G) = G, where F* ₁ (G) = F* (G) is the generalized Fitting subgroup, and F* _i+1(G) is the inverse image of F* (G/F*_i (G)). In the present paper we prove that if λ(J) ≤ k for every 2-generator subgroup J of G, then λ(G) ≤ k. It is conjectured that if h* (J) ≤ k for every 2-generator subgroup J, then h* (G) ≤ k. We prove that if h* (〈x, x^g 〉) ≤ k for allx, g ∈ G such that 〈x, x^g 〉 is soluble, then h* (G) is k-bounded.     

Finite groups with given σ-embedded and σ-n-embedded subgroups

Let G be a finite group and σ = {σ _i |i∈I} be a partition of the set of all primes P. A set H of subgroups of G is said to be a complete Hall σ-set of G if every non-identity member of H is a Hall σ _i -subgroup of G and H contains exactly one Hall σ _i -subgroup of G for every σ _i ∈ σ(G). A subgroup H is said to be σ-permutable if G possesses a complete Hall σ-set H such that HA ^x = A ^x H for all A ∈ H and all x ∈ G. Let H be a subgroup of G. Then we say that: (1) H is σ-embedded in G if there exists a σ-permutable subgroup T of G such that HT = H ^σG and H ∩ T ≤ H _σG , where H _σG is the subgroup of H generated by all those subgroups of H which are σ-permutable in G, and H ^σG is the σ-permutable closure of H, that is, the intersection of all σ-permutable subgroups of G containing H. (2) H is σ-n-embedded in G if there exists a normal subgroup T of G such that HT = H ^G and H ∩ T ≤ H _σG . In this paper, we study the properties of the new embedding subgroups and use them to determine the structure of finite groups.     

Acyclic edge coloring of planar graphs without adjacent cycles

A proper edge coloring of a graph G is said to be acyclic if there is no bicolored cycle in G.The acyclic edge chromatic number of G,denoted byχ′a(G),is the smallest number of colors in an acyclic edge coloring of G.Let G be a planar graph with maximum degree.In this paper,we show thatχ′a(G)+2,if G has no adjacent i-and j-cycles for any i,j∈{3,4,5},which implies a result of Hou,Liu and Wu(2012);andχ′a(G)+3,if G has no adjacent i-and j-cycles for any i,j∈{3,4,6}.     

Neighbor sum distinguishing total chromatic number of <Emphasis Type="Italic">K</Emphasis><Subscript>4</Subscript>-minor free graph

A k-total coloring of a graph G is a mapping ?: V (G) ? E(G) → {1; 2,..., k} such that no two adjacent or incident elements in V (G) ? E(G) receive the same color. Let f(v) denote the sum of the color on the vertex v and the colors on all edges incident with v: We say that ? is a k-neighbor sum distinguishing total coloring of G if f(u) 6 ≠ f(v) for each edge uv ∈ E(G): Denote χ _Σ ^″ (G) the smallest value k in such a coloring of G: Pil?niak and Wo?niak conjectured that for any simple graph with maximum degree Δ(G), χ _Σ ^″ ≤ Δ(G)+3. In this paper, by using the famous Combinatorial Nullstellensatz, we prove that for K ₄-minor free graph G with Δ(G) > 5; χ _Σ ^″ = Δ(G) + 1 if G contains no two adjacent Δ-vertices, otherwise, χ _Σ ^″ (G) = Δ(G) + 2.     

Universal rigidity of bar frameworks via the geometry of spectrahedra

A bar framework (G, p) in dimension r is a graph G whose nodes are points \(p^1,\ldots ,p^n\) in \(\mathbb {R}^r\) and whose edges are line segments between pairs of these points. Two frameworks (G, p) and (G, q) are equivalent if each edge of (G, p) has the same (Euclidean) length as the corresponding edge of (G, q). A pair of non-adjacent vertices i and j of (G, p) is universally linked if \(||p^i-p^j||\) = \(||q^i-q^j||\) in every framework (G, q) that is equivalent to (G, p). Framework (G, p) is universally rigid iff every pair of non-adjacent vertices of (G, p) is universally linked. In this paper, we present a unified treatment of the universal rigidity problem based on the geometry of spectrahedra. A spectrahedron is the intersection of the positive semidefinite cone with an affine space. This treatment makes it possible to tie together some known, yet scattered, results and to derive new ones. Among the new results presented in this paper are: (1) The first sufficient condition for a given pair of non-adjacent vertices of (G, p) to be universally linked. (2) A new, weaker, sufficient condition for a framework (G, p) to be universally rigid thus strengthening the existing known condition. An interpretation of this new condition in terms of the Strong Arnold Property is also presented.