首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 329 毫秒
1.
A subgroup \(H\) of an Abelian group \(G\) is called fully inert if \((\phi H + H)/H\) is finite for every \(\phi \in \mathrm{End}(G)\) . Fully inert subgroups of free Abelian groups are characterized. It is proved that \(H\) is fully inert in the free group \(G\) if and only if it is commensurable with \(n G\) for some \(n \ge 0\) , that is, \((H + nG)/H\) and \((H + nG)/nG\) are both finite. From this fact we derive a more structural characterization of fully inert subgroups \(H\) of free groups \(G\) , in terms of the Ulm–Kaplansky invariants of \(G/H\) and the Hill–Megibben invariants of the exact sequence \(0 \rightarrow H \rightarrow G \rightarrow G/H \rightarrow 0\) .  相似文献   

2.
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 the order of \(H\) , a Sylow \(p\) -subgroup of \(H\) is also a Sylow \(p\) -subgroup of some \(s\) -quasinormal subgroup of \(G\) . We fix in every non-cyclic Sylow subgroup \(P\) of \(G\) some subgroup \(D\) satisfying \(1<|D|<|P|\) and study the \(p\) -nilpotency of \(G\) under the assumption that every subgroup \(H\) of \(P\) with \(|H|=|D|\) is \(s\) -quasinormally embedded in \(G\) . Some recent results and the Frobenius \(^{\prime }\) theorem are generalized.  相似文献   

3.
Let \(Z\) be a homogeneous space \(Z=G/H\) of a real reductive Lie group \(G\) with a reductive subgroup \(H\) . The investigation concerns the quantitative decay of matrix coefficients on \(Z\) under the assumption that \(Z\) is of spherical type, that is, minimal parabolic subgroups have open orbits on \(Z\) .  相似文献   

4.
In Kadison J Pure Appl Alg 218:367–380, (2014) it was shown that subgroup depth may be computed from the permutation module of the left or right cosets: this holds more generally for a Hopf subalgebra, from which we note in this paper that finite depth of a Hopf subalgebra \(R \subseteq H\) is equivalent to the \(H\) -module coalgebra \(Q = H/R^+H\) representing an algebraic element in the Green ring of \(H\) or \(R\) . This approach shows that subgroup depth and the subgroup depth of the corefree quotient lie in the same closed interval of length one. We also establish a previous claim that the problem of determining if \(R\) has finite depth in \(H\) is equivalent to determining if \(H\) has finite depth in its smash product \(Q^* \# H\) . A necessary condition is obtained for finite depth from stabilization of a descending chain of annihilator ideals of tensor powers of \(Q\) . As an application of these topics to a centerless finite group \(G\) , we prove that the minimum depth of its group \(\mathbb {C}\,\) -algebra in the Drinfeld double \(D(G)\) is an odd integer, which determines the least tensor power of the adjoint representation \(Q\) that is a faithful \(\mathbb {C}\,G\) -module.  相似文献   

5.
A subgroup \(H\) of a group \(G\) is said to be normal sensitive in \(G\) if for every normal subgroup \(N\) of \(H, N=H\cap N^{G}\) . In this paper we study locally finite groups whose \(p\) -subgroups are normal sensitive. We show the connection between these groups and groups in which Sylow permutability is transitive.  相似文献   

6.
Let \(K\subset \mathbb R ^N\) be a convex body containing the origin. A measurable set \(G\subset \mathbb R ^N\) with positive Lebesgue measure is said to be uniformly \(K\) -dense if, for any fixed \(r>0\) , the measure of \(G\cap (x+r K)\) is constant when \(x\) varies on the boundary of \(G\) (here, \(x+r K\) denotes a translation of a dilation of \(K\) ). We first prove that \(G\) must always be strictly convex and at least \(C^{1,1}\) -regular; also, if \(K\) is centrally symmetric, \(K\) must be strictly convex, \(C^{1,1}\) -regular and such that \(K=G-G\) up to homotheties; this implies in turn that \(G\) must be \(C^{2,1}\) -regular. Then for \(N=2\) , we prove that \(G\) is uniformly \(K\) -dense if and only if \(K\) and \(G\) are homothetic to the same ellipse. This result was already proven by Amar et al. in 2008 . However, our proof removes their regularity assumptions on \(K\) and \(G\) , and more importantly, it is susceptible to be generalized to higher dimension since, by the use of Minkowski’s inequality and an affine inequality, avoids the delicate computations of the higher-order terms in the Taylor expansion near \(r=0\) for the measure of \(G\cap (x+r\,K)\) (needed in 2008).  相似文献   

7.
Two subgroups \(A\) and \(B\) of a group \(G\) are said to be totally completely conditionally permutable (tcc-permutable) if \(X\) permutes with \(Y^g\) for some \(g\in \langle X,Y\rangle \) , for all \(X \le A\) and all \(Y\le B\) . In this paper, we study finite products of tcc-permutable subgroups, focussing mainly on structural properties of such products. As an application, new achievements in the context of formation theory are obtained.  相似文献   

8.
Given a finite group \(G\) which possesses a non-abelian simple normal subgroup \(N\) having exactly four \(G\) -class sizes, we prove that \(N\) is isomorphic to PSL \((2, 2^a)\) with \(a\ge 2\) . Thus, we obtain an extension for normal subgroups of the classic N. Itô’s theorem which characterizes those finite simple groups with exactly four class sizes.  相似文献   

9.
Let \(K\) be a global field and \(G\) a finite solvable \(K\) -group. Under certain hypotheses concerning the extension splitting \(G\) , we show that the homogeneous space \(V=G'/G\) with \(G'\) a semi-simple simply connected \(K\) -group has the weak approximation property. We use a more precise version of this result to prove the Hasse principle for homogeneous spaces \(X\) under a semi-simple simply connected \(K\) -group \(G'\) with finite solvable geometric stabilizer \({\bar{G}}\) , under certain hypotheses concerning the \(K\) -kernel (or \(K\) -lien) \(({\bar{G}},\kappa )\) defined by \(X\) .  相似文献   

10.
We deal with the following conjecture. If \(w\) is a group word and \(G\) is a finite group in which any nilpotent subgroup generated by \(w\) -values has exponent dividing \(e\) , then the exponent of the verbal subgroup \(w(G)\) is bounded in terms of \(e\) and \(w\) only. We show that this is true in the case where \(w\) is either the \(n\text{ th }\) Engel word or the word \([x^n,y_1,y_2,\ldots ,y_k]\) (Theorem A). Further, we show that for any positive integer \(e\) there exists a number \(k=k(e)\) such that if \(w\) is a word and \(G\) is a finite group in which any nilpotent subgroup generated by products of \(k\) values of the word \(w\) has exponent dividing \(e\) , then the exponent of the verbal subgroup \(w(G)\) is bounded in terms of \(e\) and \(w\) only (Theorem B).  相似文献   

11.
For a finite group \(G\) , let \(d(G)\) denote the probability that a randomly chosen pair of elements of \(G\) commute. We prove that if \(d(G)>1/s\) for some integer \(s>1\) and \(G\) splits over an abelian normal nontrivial subgroup \(N\) , then \(G\) has a nontrivial conjugacy class inside \(N\) of size at most \(s-1\) . We also extend two results of Barry, MacHale, and Ní Shé on the commuting probability in connection with supersolvability of finite groups. In particular, we prove that if \(d(G)>5/16\) then either \(G\) is supersolvable, or \(G\) isoclinic to \(A_4\) , or \(G/\mathbf{Z}(G)\) is isoclinic to \(A_4\) .  相似文献   

12.
An example of an extension of a completely simple semigroup \(U\) by a group \(H\) is given which cannot be embedded into the wreath product of \(U\) by \(H\) . On the other hand, every central extension of \(U\) by \(H\) is shown to be embeddable in the wreath product of \(U\) by \(H\) , and any extension of \(U\) by \(H\) is proved to be embeddable in a semidirect product of a completely simple semigroup \(V\) by \(H\) where the maximal subgroups of \(V\) are direct powers of those of \(U\) .  相似文献   

13.
Yi Li 《Geometriae Dedicata》2014,172(1):147-154
In this paper we prove that the \(H^{k}\) ( \(k\) is odd and larger than \(2\) ) mean curvature flow of a closed convex hypersurface can be extended over the maximal time provided that the total \(L^{p}\) integral of the mean curvature is finite for some \(p\) .  相似文献   

14.
15.
The Johnson graph \(J(v,k)\) has, as vertices, the \(k\) -subsets of a \(v\) -set \(\mathcal {V}\) and as edges the pairs of \(k\) -subsets with intersection of size \(k-1\) . We introduce the notion of a neighbour-transitive code in \(J(v,k)\) . This is a proper vertex subset \(\Gamma \) such that the subgroup \(G\) of graph automorphisms leaving \(\Gamma \) invariant is transitive on both the set \(\Gamma \) of ‘codewords’ and also the set of ‘neighbours’ of \(\Gamma \) , which are the non-codewords joined by an edge to some codeword. We classify all examples where the group \(G\) is a subgroup of the symmetric group \(\mathrm{Sym}\,(\mathcal {V})\) and is intransitive or imprimitive on the underlying \(v\) -set \(\mathcal {V}\) . In the remaining case where \(G\le \mathrm{Sym}\,(\mathcal {V})\) and \(G\) is primitive on \(\mathcal {V}\) , we prove that, provided distinct codewords are at distance at least \(3\) , then \(G\) is \(2\) -transitive on \(\mathcal {V}\) . We examine many of the infinite families of finite \(2\) -transitive permutation groups and construct surprisingly rich families of examples of neighbour-transitive codes. A major unresolved case remains.  相似文献   

16.
We obtain a new square function characterization of the weak Hardy space \(H^{p,\infty }\) for all \(p\in (0,\infty )\) . This space consists of all tempered distributions whose smooth maximal function lies in weak \(L^p\) . Our proof is based on interpolation between \(H^p\) spaces. The main difficulty we overcome is the lack of a good dense subspace of \(H^{p,\infty }\) which forces us to work with general \(H^{p,\infty }\) distributions.  相似文献   

17.
Let \(V\) be a complex prehomogeneous vector space under the action of a linear algebraic group \(G\) . Assume the poset of orbit closures in the Zariski topology \(\{\overline{Gx}:x\in V\}\) coincides with a (partial) flag \(V_0=0<V_1<\dots <V_k=V\) in \(V\) . Then for any Borel subgroup \(B\) of \(G\) , the poset \(\{\overline{B x}:x\in V\}\) coincides with a full flag in \(V\) .  相似文献   

18.
In this paper, we compute \(K\) -groups \(\{K_{n}(C^{*}(x))\}_{n=0}^{\infty }\) of the \(C^{*}\) -subalgebra \(C^{*}(x)\) of \(B(H),\) generated by a single operator \(x,\) where \(H\) is a separable infinite dimensional Hilbert space, and \(B(H)\) is the operator algebra consisting of all (bounded linear) operators on \(H.\) These computations not only provide nice examples in \(K\) -theory, but also characterize-and-classify projections in a \(C^{*}\) -algebra generated by a single operator. The main result of this paper shows that: the \(K\) -groups of \(C^{*}(x)\) are completely characterized by those of \(C^{*}(q),\) where \(q\) is the positive-operator part of \(x\) in the polar decomposition of \(x.\)   相似文献   

19.
Let \(G\) be a directed graph with \(n\) vertices embedded on an orientable surface of genus \(g\) with two designated vertices \(s\) and \(t\) . We show that computing the number of minimum \((s,t)\) -cuts in \(G\) is fixed-parameter tractable in \(g\) . Specifically, we give a \(2^{O(g)} n^2\) time algorithm for this problem. Our algorithm requires counting sets of cycles in a particular integer homology class. That we can count these cycles is an interesting result in itself as there are no prior results that are fixed-parameter tractable and deal directly with integer homology. We also describe an algorithm which, after running our algorithm to count minimum cuts once, can sample an \((s,t)\) -minimum cut uniformly at random in \(O(n \log n)\) time per sample.  相似文献   

20.
A k-matching cover of a graph \(G\) is a union of \(k\) matchings of \(G\) which covers \(V(G)\) . The matching cover number of \(G\) , denoted by \(mc(G)\) , is the minimum number \(k\) such that \(G\) has a \(k\) -matching cover. A matching cover of \(G\) is optimal if it consists of \(mc(G)\) matchings of \(G\) . In this paper, we present an algorithm for finding an optimal matching cover of a graph on \(n\) vertices in \(O(n^3)\) time (if use a faster maximum matching algorithm, the time complexity can be reduced to \(O(nm)\) , where \(m=|E(G)|\) ), and give an upper bound on matching cover number of graphs. In particular, for trees, a linear-time algorithm is given, and as a by-product, the matching cover number of trees is determined.  相似文献   

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

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