A PROBABILISTIC ZETA FUNCTION FOR ARITHMETIC GROUPS

2005 ◽  
Vol 15 (05n06) ◽  
pp. 1053-1059 ◽  
Author(s):  
AVINOAM MANN

A profinite group G is positively finitely generated (PFG) if for some k, the probability P(G,k) that k random elements generate G is positive. It was conjectured that if G is PFG, then the function P(G,k) can be interpolated to an analytic function defined in some right half-plane. Here that conjecture is formulated more precisely, and verified for (the profinite completion of) arithmetic groups satisfying the congruence subgroup property.

2020 ◽  
Vol 8 ◽  
Author(s):  
Holger Kammeyer ◽  
Steffen Kionke ◽  
Jean Raimbault ◽  
Roman Sauer

Abstract We prove that the sign of the Euler characteristic of arithmetic groups with the congruence subgroup property is determined by the profinite completion. In contrast, we construct examples showing that this is not true for the Euler characteristic itself and that the sign of the Euler characteristic is not profinite among general residually finite groups of type F. Our methods imply similar results for $\ell^2$ -torsion as well as a strong profiniteness statement for Novikov–Shubin invariants.


2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Anitha Thillaisundaram ◽  
Jone Uria-Albizuri

AbstractThe class of multi-EGS groups is a generalisation of the well-known Grigorchuk–Gupta–Sidki (GGS-)groups. Here we classify branch multi-EGS groups with the congruence subgroup property and determine the profinite completion of all branch multi-EGS groups. Additionally, our results show that branch multi-EGS groups are just infinite.


2015 ◽  
Vol 421 ◽  
pp. 234-259 ◽  
Author(s):  
A.S. Detinko ◽  
D.L. Flannery ◽  
A. Hulpke

2014 ◽  
Vol 24 (06) ◽  
pp. 837-877 ◽  
Author(s):  
R. Grigorchuk ◽  
R. Kravchenko

The techniques of modules and actions of groups on rooted trees are applied to study the subgroup structure and the lattice subgroup of lamplighter type groups of the form ℒn,p = (ℤ/pℤ)n ≀ ℤ for n ≥ 1 and p prime. We completely characterize scale invariant structures on ℒ1,2. We determine all points on the boundary of binary tree (on which ℒ1,p naturally acts in a self-similar manner) with trivial stabilizer. We prove the congruence subgroup property (CSP) and as a consequence show that the profinite completion [Formula: see text] of ℒ1,p is a self-similar group generated by finite automaton. We also describe the structure of portraits of elements of ℒ1,p and [Formula: see text] and show that ℒ1,p is not a sofic tree shift group in the terminology of [T. Ceccherini-Silberstein, M. Coornaert, F. Fiorenza and Z. Sunic, Cellular automata between sofic tree shifts, Theor. Comput. Sci.506 (2013) 79–101; A. Penland and Z. Sunic, Sofic tree shifts and self-similar groups, preprint].


Author(s):  
Eloisa Detomi ◽  
Andrea Lucchini

To a finitely generated profinite group [Formula: see text], a formal Dirichlet series [Formula: see text] is associated, where [Formula: see text] and [Formula: see text] denotes the Möbius function of the lattice of open subgroups of [Formula: see text] Its formal inverse [Formula: see text] is the probabilistic zeta function of [Formula: see text]. When [Formula: see text] is prosoluble, every coefficient of [Formula: see text] is nonnegative. In this paper we discuss the general case and we produce a non-prosoluble finitely generated group with the same property.


2003 ◽  
Vol 117 (2) ◽  
pp. 367-383 ◽  
Author(s):  
Bal�zs Szegedy ◽  
Nikolay Nikolov ◽  
Mikl�s Ab�rt

Sign in / Sign up

Export Citation Format

Share Document