首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
We use the theory of zeta functions of groups to establish a lower limit for the degree of polynomial normal subgroup growth in class two nilpotent groups.  相似文献   

2.
Summary Let be a finitely generated group anda n ()=the number of its subgroups of indexn. We prove that, assuming is residually nilpotent (e.g., linear), thena n () grows polynomially if and only if is solvable of finite rank. This answers a question of Segal. The proof uses a new characterization ofp-adic analytic groups, the theory of algebraic groups and the Prime Number Theorem. The method can be applied also to groups of polynomial word growth.Oblatum 1-VII-1989 & 7-VI-1990  相似文献   

3.
We determine the structure of finitely generated residually finite groups in which the number of subgroups of each finite indexn is bounded by a fixed power ofn. To John Thompson, an inspiration to group theory, on his being awarded the Wolf Prize Partially supported by BSF and GIF grants. Partially supported by a BSF grant.  相似文献   

4.
A PSG group is one in which the number of subgroups of given index is bounded by a fixed power of this index. The finitely generated PSG groups are known. Here we prove some properties of such groups which need not be finitely generated. We derive, e.g., restrictions on the chief factors (Theorem 1) and on the number of generators of subgroups (Theorem 5). To Wolf Prize laureate John Thompson Partially supported by a BSF grant.  相似文献   

5.
6.
A groupG hasweak polynomial subgroup growth (wPSG) of degree ≤α if each finite quotient Ḡ ofG contains at most │Ḡ│ a subgroups. The main result is that wPSG of degree α implies polynomial subgroup growth (PSG) of degree at mostf(α). It follows that wPSG is equivalent to PSG. A corollary is that if, in a profinite groupG, thek-generator subgroups have positive “density” δ, thenG is finitely generated (the number of generators being bounded by a function ofk and δ).  相似文献   

7.
8.
9.
It is known that the subgroup growth of finitely generated linear groups is either polynomial or at least $n^{\frac{{\log n}}{{\log \log n}}} $ . In this paper we prove the existence of a finitely generated group whose subgroup growth is of type $n^{\frac{{\log n}}{{(\log \log n)^2 }}} $ . This is the slowest non-polynomial subgroup growth obtained so far for finitely generated groups. The subgroup growth typen logn is also realized. The proofs involve analysis of the subgroup structure of finite alternating groups and finite simple groups in general. For example, we show there is an absolute constantc such that, ifT is any finite simple group, thenT has at mostn c logn subgroups of indexn.  相似文献   

10.
11.
12.
The polynomials determined in the Bernstein (Bézier) basis enjoy considerable popularity in computer-aided design (CAD) applications. The common situation in these applications is, that polynomials given in the basis of degree n have to be represented in the basis of higher degree. The corresponding transformation algorithms are called algorithms for degree elevation of Bernstein polynomial representations. These algorithms are only then of practical importance if they do not require the ill-conditioned conversion between the Bernstein and the power basis. We discuss all the algorithms of this kind known in the literature and compare them to the new ones we establish. Some among the latter are better conditioned and not more expensive than the currently used ones. All these algorithms can be applied componentwise to vector-valued polynomial Bézier representations of curves or surfaces.  相似文献   

13.
Bentzen  Steffen  Madsen  Ib 《Mathematische Annalen》1983,262(4):447-459
Ohne Zusammenfassung  相似文献   

14.
For a finitely generated group Γ denote by μ(Γ) the growth coefficient of Γ, that is, the infimum over all real numbers d such that s n (Γ) < n! d . We show that the growth coefficient of a virtually free group is always rational, and that every rational number occurs as growth coefficient of some virtually free group.  相似文献   

15.
We address the subgroup index problem in a given finite subgroup lattice L = (G) which is P-indecomposable and determine out of the structure of L the existence in G of a subgroup [(D)tilde]tilde D invariant for all automorphisms of L, with a cyclic complement R in G and where for any pair XY of subgroups of [(D)tilde]tilde D the index |Y: X| can be computed using only structural properties of L. As a consequence, we show that in such an L all the terms of the Fitting series of G can be determined, as well as an upper bound of the order of G can be computed out of L as long as G has no cyclic Hall direct factor.  相似文献   

16.
We prove here an energy estimate for the Cauchy problem for hyperbolic equations with double characteristic, which contains both effectively and non-effectively points (see L. Hörmander [3] and R. Melrose [8]) in a unique framework.  相似文献   

17.
The principal aim of this paper is to study the regular and transitive subgroup functors in the universe of all finite soluble groups. We prove that they form a complemented and non-modular lattice containing two relevant sublattices. This is the answer to a question (Question 1.2.12) proposed by Skiba (1997) in the finite soluble universe.  相似文献   

18.
19.
20.
Let G be a compactly generated group of polynomial growth and a weight function on G. For a large class of weights we characterize symmetry of the weighted group algebra L 1 (G,). In particular, if the weight is sub-exponential, then the algebra L 1 (G,) is symmetric. For these weights we develop a functional calculus on a total part of L 1 (G,) and use it to prove the Wiener property. Mathematics Subject Classification (2000):43A20, 22D15, 22D12.Supported by the Austrian Science Foundation project FWF P-14485.Supported by the research grants MEN/CUL/98/007 and CUL/01/014.  相似文献   

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

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