Free groups in a normal subgroup of the field of fractions of a skew polynomial ring

Let k(t) be the field of rational functions over the field k, let σ be a k-automorphism of K = k(t), let D = K(X;σ) be the ring of fractions of the skew polynomial ring K[X;σ], and let D^? be the multiplicative group of D. We show that if N is a noncentral normal subgroup of D^?, then N contains a free subgroup. We also prove that when k is algebraically closed and σ has infinite order, there exists a specialization from D to a quaternion algebra. This allows us to explicitly present free subgroups in D^?.     

Nearly m-embedded subgroups and solvability of finite groups

A subgroup A of a finite group G is called {1≤G}-embedded in G if for each two subgroups K≤H of G, where K is a maximal subgroup of H, A either covers the pair (K,H) or avoids it. Moreover, a subgroup H of G is called nearly m-embedded in G if G has a subgroup T and a {1≤G}-embedded subgroup C such that G?=?HT and H∩T≤C≤H. In this paper, we mainly prove that G is solvable if and only if its Sylow 3-subgroups, Sylow 5-subgroups and Sylow 7-subgroups are nearly m-embedded in G.     

Local commensurability graphs of solvable groups

The commensurability index between two subgroups A,B of a group G is [A:A∩B][B:A∩B]. This gives a notion of distance among finite index subgroups of G, which is encoded in the p-local commensurability graphs of G. We show that for any metabelian group, any component of the p-local commensurabilty graph of G has diameter bounded above by 4. However, no universal upper bound on diameters of components exists for the class of finite solvable groups. In the appendix we give a complete classification of components for upper triangular matrix groups in GL(2,𝔽_q).     

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.     

Lower Bounds on the Number of Cyclic Subgroups in Finite Non-Cyclic Nilpotent Groups

Let $G$ be a finite group and $\mathfrak{c}(G)$ denote the number of cyclic subgroups of $G$. It is known that the minimal value of $\mathfrak{c}$ on the set of groups of order $n$, where $n$ is a positive integer, will occur at the cyclic group $Z_n$. In this paper, for non-cyclic nilpotent groups $G$ of order $n$, the lower bounds of $\mathfrak{c}(G)$ are established.     

Fully Invariant Subgroups of Abelian p-Groups with Finite Ulm–Kaplansky Invariants

We study primary groups containing proper fully invariant subgroups isomorphie to the group. The admissable sequence of Ulm–Kaplansky invariants for primary groups is introduced. Using these sequences, If-groups are described in the classes of seperable and periodically complete groups.     

On clique relaxation models in network analysis

Increasing interest in studying community structures, or clusters in complex networks arising in various applications has led to a large and diverse body of literature introducing numerous graph-theoretic models relaxing certain characteristics of the classical clique concept. This paper analyzes the elementary clique-defining properties implicitly exploited in the available clique relaxation models and proposes a taxonomic framework that not only allows to classify the existing models in a systematic fashion, but also yields new clique relaxations of potential practical interest. Some basic structural properties of several of the considered models are identified that may facilitate the choice of methods for solving the corresponding optimization problems. In addition, bounds describing the cohesiveness properties of different clique relaxation structures are established, and practical implications of choosing one model over another are discussed.     

On the cut‐off phenomenon for the transitivity of randomly generated subgroups

Consider K ≥ 2 independent copies of the random walk on the symmetric group S_N starting from the identity and generated by the products of either independent uniform transpositions or independent uniform neighbor transpositions. At any time $n\in \mathbb{N}$, let G_n be the subgroup of S_N generated by the K positions of the chains. In the uniform transposition model, we prove that there is a cut‐off phenomenon at time N ln(N)/(2K) for the non‐existence of fixed point of G_n and for the transitivity of G_n, thus showing that these properties occur before the chains have reached equilibrium. In the uniform neighbor transposition model, a transition for the non‐existence of a fixed point of G_n appears at time of order $N^{1+\frac{2}{K}}$ (at least for K ≥ 3), but there is no cut‐off phenomenon. In the latter model, we recover a cut‐off phenomenon for the non‐existence of a fixed point at a time proportional to N by allowing the number K to be proportional to ln(N). The main tools of the proofs are spectral analysis and coupling techniques. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2012     

半正规、共轭置换与有限群的超可解性

研究了有限群的超可解性问题,结合共轭置换子群与半正规子群的概念,在群G的极大子群(2-极大子群)或共轭置换或半正规的条件下给出了群G超可解的若干充分条件.