Large normal subgroup growth and large characteristic subgroup growth

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Congruence Subgroup Growth of Arithmetic Groups in Positive Characteristic

We prove a new uniform bound for subgroup growth of a Chevalley group G over the local ring F[[t]] and also over local pro-p rings of higher Krull dimension. This is applied to the determination of congruence subgroup growth of arithmetic groups over global fields of positive characteristic. In particular, we show that the subgroup growth of SLn(Fp[t]) (n ≥ 3) is of type nlog n . This was one o...

متن کامل

Normal subgroup growth in free class-2-nilpotent groups

Let F2,d denote the free class-2-nilpotent group on d generators. We compute the normal zeta functions ζ F2,d(s), prove that they satisfy local functional equations and determine their abscissae of convergence and pole orders.

متن کامل

Bertrand ’ s postulate and subgroup growth

In this article we investigate the L1–norm of certain functions on groups called divisibility functions. Using these functions, their connection to residual finiteness, and integration theory on profinite groups, we define the residual average of a finitely generated group. One of the main results in this article is the finiteness of residual averages on finitely generated linear groups. Whethe...

متن کامل

New Lower Bounds on Subgroup Growth and Homology Growth

Subgroup growth is an important new area of group theory. It attempts to quantify the number of finite index subgroups of a group, as a function of their index. In this paper, we will provide new, strong lower bounds on the subgroup growth of a variety of different groups. This will include the fundamental groups of all finite-volume hyperbolic 3-manifolds. By using the correspondence between s...

متن کامل

Non-redundant Subgroup Discovery in Large and Complex Data

Large and complex data is challenging for most existing discovery algorithms, for several reasons. First of all, such data leads to enormous hypothesis spaces, making exhaustive search infeasible. Second, many variants of essentially the same pattern exist, due to (numeric) attributes of high cardinality, correlated attributes, and so on. This causes top-k mining algorithms to return highly red...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Group Theory

سال: 2019

ISSN: 1435-4446,1433-5883

DOI: 10.1515/jgth-2019-2050