首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Let ? be a class of groups. Given a group G, assign to G some set of its subgroups Σ = Σ(G). We say that Σ is a G-covering system of subgroups for ? (or, in other words, an ?-covering system of subgroups in G) if G ∈ ? wherever either Σ = ? or Σ ≠ ? and every subgroup in Σ belongs to ?. In this paper, we provide some nontrivial sets of subgroups of a finite group G which are G-covering subgroup systems for the class of supersoluble groups. These are the generalizations of some recent results, such as in [1–3].  相似文献   

2.
Let G be a finite group and H a subgroup of G. We say that H is s-permutable in G if HPPH for all Sylow subgroups P of G; H is s-semipermutable in G if HPPH for all Sylow subgroups P of G with (|P|, |H|) = 1. Let H s G be the subgroup of H generated by all those subgroups of G which are s-permutable in G and H sG the intersection of all such s-permutable subgroups of G contain H. We say that H is nearly s-embedded in G if G has an s-permutable subgroup T such that H sG HT and \({H \cap T \leqq H_{ssG}}\) , where H ssG is an s-semipermutable subgroup of G contained in H. In this paper, we study the structure of a finite group G under the assumption that some subgroups of prime power order are nearly s-embedded in G. A series of known results are improved and extended.  相似文献   

3.
Let G be a finite group,and H a subgroup of G.H is called s-permutably embedded in G if each Sylow subgroup of H is a Sylow subgroup of some s-permutable subgroup of G.In this paper,we use s-permutably embedding property of subgroups to characterize the p-supersolvability of finite groups,and obtain some interesting results which improve some recent results.  相似文献   

4.
We consider the subgroups H in a linear or a unitary group G over a finite field such that O r (H) ? Z(G) for some odd prime r. We obtain a refinement of the well-known Aschbacher theorem on subgroups of classical groups for this case.  相似文献   

5.
We propose the following conjecture to generalize results of Pósa and of Corrádi and Hajnal. Let r,s be nonnegative integers and let G be a graph with |V(G)|≥3r+4s and minimal degree δ(G)≥2r+3s. Then G contains a collection of r+s vertex disjoint cycles, s of them with a chord. We prove the conjecture for r=0,s=2 and for s=1. The corresponding extremal problem, to find the minimum number of edges in a graph on n vertices ensuring the existence of two vertex disjoint chorded cycles, is also settled.  相似文献   

6.
Let G be a finite group. A subgroup H of G is s-permutable in G if H permutes with every Sylow subgroup of G. A subgroup H of G is called an \(\mathcal {SSH}\)-subgroup in G if G has an s-permutable subgroup K such that \(H^{sG} = HK\) and \(H^g \cap N_K (H) \leqslant H\), for all \(g \in G\), where \(H^{sG}\) is the intersection of all s-permutable subgroups of G containing H. We study the structure of finite groups under the assumption that the maximal or the minimal subgroups of Sylow subgroups of some normal subgroups of G are \(\mathcal {SSH}\)-subgroups in G. Several recent results from the literature are improved and generalized.  相似文献   

7.
Suppose that G is a finite group and H is a subgroup of G. H is said to be s-quasinormally embedded in G if for each prime p dividing |H|, a Sylow p-subgroup of H is also a Sylow p-subgroup of some s-quasinormal subgroup of G; H is called c*-quasinormally embedded in G if there is a subgroup T of G such that G = HT and H??T is s-quasinormally embedded in G. We investigate the influence of c*-quasinormally embedded subgroups on the structure of finite groups. Some recent results are generalized.  相似文献   

8.
One of the basic questions in the Kleinian group theory is to understand both algebraic and geometric limiting behavior of sequences of discrete subgroups. In this paper we consider the geometric convergence in the setting of the isometric group of the real or complex hyperbolic space. It is known that if Γ is a non-elementary finitely generated group and ? i : Γ → SO(n, 1) a sequence of discrete and faithful representations, then the geometric limit of ? i (Γ) is a discrete subgroup of SO(n, 1). We generalize this result by showing that for a sequence of discrete and non-elementary subgroups {G j } of SO(n, 1) or PU(n, 1), if {G j } has uniformly bounded torsion, then its geometric limit is either elementary, or discrete and non-elementary.  相似文献   

9.
Let G be a connected combinatorial graph of valency p + 1 where p is an odd prime. Assume that there exists a group of automorphisms A of G whose induced action on the s-arcs of G is regular (sharply transitive). If s ≥ 2 we prove that p must be a Mersenne prime, i.e., of the form p = 2n ? 1. In general we know that s ≤ 5 or s = 7. We obtain some partial results when s = 7.  相似文献   

10.
For a non-zero real number α, let s α (G) denote the sum of the αth power of the non-zero Laplacian eigenvalues of a graph G. In this paper, we establish a connection between s α (G) and the first Zagreb index in which the Hölder’s inequality plays a key role. By using this result, we present a lot of bounds of s α (G) for a connected (molecular) graph G in terms of its number of vertices (atoms) and edges (bonds). We also present other two bounds for s α (G) in terms of connectivity and chromatic number respectively, which generalize those results of Zhou and Trinajsti? for the Kirchhoff index [B Zhou, N Trinajsti?. A note on Kirchhoff index, Chem. Phys. Lett., 2008, 455: 120–123].  相似文献   

11.
For a family of group words w we show that if G is a profinite group in which all w-values are contained in a union of finitely many subgroups with a prescribed property, then the verbal subgroup w(G) has the same property as well. In particular, we show this in the case where the subgroups are periodic or of finite rank. If G contains finitely many subgroups G 1, G 2, . . . , G s of finite exponent e whose union contains all γ k -values in G, it is shown that γ k (G) has finite (e, k, s)-bounded exponent. If G contains finitely many subgroups G 1, G 2, . . . , G s of finite rank r whose union contains all γ k -values, it is shown that γ k (G) has finite (k, r, s)-bounded rank.  相似文献   

12.
In [7] Passi proved that for a finite p-group, p ≠ 2, one has G4 = D4. We generalize this to say that Gn = Dn as long as n?p + 1. We also generalize a theorem of Quillen [8], using entirely different methods from his, and give his result as a corollary. In order to do this, we construct natural algorithms (spectral sequences) which compute the graded Lie algebra ?iGi/Gi+1 and the graded algebra ? Ii(G)/Ii+1(G) respectively, for any group G, in terms of a presentation. A natural transformation between these spectral sequences exists, and analysing its properties by some new combinatorial methods yields the results.  相似文献   

13.
Let M = ? s n /Γ be a complete flat pseudo-Riemannian homogeneous manifold, Γ ? Iso(? s n ) its fundamental group and G the Zariski closure of Γ in Iso(? s n ). We show that the G-orbits in ? s n are affine subspaces and affinely diffeomorphic to G endowed with the (0)-connection. If the restriction of the pseudo-scalar product on ? s n to the G-orbits is nondegenerate, then M has abelian linear holonomy. If additionally G is not abelian, then G contains a certain subgroup of dimension 6. In particular, for non-abelian G, orbits with non-degenerate metric can appear only if dim G ≥ 6. Moreover, we show that ? s n is a trivial algebraic principal bundle GM → ? n?k . As a consquence, M is a trivial smooth bundle G/Γ → M → ? n?k with compact fiber G/Γ.  相似文献   

14.
By a graph we mean a finite undirected connected graph of order p, p ? 2, with no loops or multiple edges. A finite non-decreasing sequence S: s1, s2, …, sp, p ? 2, of positive integers is an eccentric sequence if there exists a graph G with vertex set V(G) = {v1, v2, …, vp} such that for each i, 1 ? i ? p, s, is the eccentricity of v1. A set S is an eccentric set if there exists a graph G such that the eccentricity ρ(v1) is in S for every v1 ? V(G), and every element of S is the eccentricity of some vertex in G. In this note we characterize eccentric sets, and we find the minimum order among all graphs whose eccentric set is a given set, to obtain a new necessary condition for a sequence to be eccentric. We also present some properties of graphs having preassigned eccentric sequences.  相似文献   

15.
A subgroup H of a group G is said to be K-?-subnormal in G if H can be joined to the group by a chain of subgroups each of which is either normal in the next subgroup or of prime index in it. Properties of K-?-subnormal subgroups are obtained. A class of finite groups whose Sylow p-subgroups are K-?-subnormal in G for every p in a given set of primes is studied. Some products of K-?-subnormal subgroups are investigated.  相似文献   

16.
In this paper, we introduce the concept of weakly s-semipermutable subgroups. Let G be a finite group. Using the condition that the minimal subgroups or subgroups of order p 2 of a given Sylow p-subgroup of G are weakly s-semipermutable in G, we give a criterion for p-nilpotency of G and get some results about formation.  相似文献   

17.
We associate a graph G ?(P) to a partially ordered set (poset, briefly) with the least element?0, as an undirected graph with vertex set P ?=P?{0} and, for two distinct vertices x and y, x is adjacent to?y in?G ?(P) if and only if {x,y} ? ={0}, where, for a subset?S of?P, S ? is the set of all elements xP with xs for all sS. We study some basic properties of?G ?(P). Also, we completely investigate the planarity of?G ?(P).  相似文献   

18.
An independent set of a graph G is a set of pairwise non-adjacent vertices. Let α(G) denote the cardinality of a maximum independent set and fs(G) for 0≤sα(G) denote the number of independent sets of s vertices. The independence polynomial defined first by Gutman and Harary has been the focus of considerable research recently. Wingard bounded the coefficients fs(T) for trees T with n vertices: for s≥2. We generalize this result to bounds for a very large class of graphs, maximal k-degenerate graphs, a class which includes all k-trees. Additionally, we characterize all instances where our bounds are achieved, and determine exactly the independence polynomials of several classes of k-tree related graphs. Our main theorems generalize several related results known before.  相似文献   

19.
We generalize Tollmien’s solutions of the Rayleigh problem of hydrodynamic stability to the case of arbitrary channel cross sections, known as the extended Rayleigh problem. We prove the existence of a neutrally stable eigensolution with wave number k s ?>?0; it is also shown that instability is possible only for 0?<?k?<?k s and not for k?>?k s . Then we generalize the Tollmien–Lin perturbation formula for the behavior of c i, the imaginary part of the phase velocity as the wave number kk s ? to the extended Rayleigh problem and subsequently, we use this formula to demonstrate the instability of a particular shear flow.  相似文献   

20.
We generalize a formula of Leopoldt which relates the p-adic regulator modulo p of a real abelian extension of ? with the value of the relative Dedekind zeta function at s = 2 ? p. We use this generalization to give an alternative proof of the non-vanishing modulo p of this relative zeta function at the point s = 1 under a mild condition.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号