On Gel'fand-Graev characters of reductive groups with disconnected centre.
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 a sequence of discrete and faithful representations, then the geometric limit of is a discrete subgroup of . We generalize this result by...
The graph product is an operator mixing direct and free products. It is already known that free products and direct products of automatic monoids are automatic. The main aim of this paper is to prove that graph products of automatic monoids of finite geometric type are still automatic. A similar result for prefix-automatic monoids is established.
The graph product is an operator mixing direct and free products. It is already known that free products and direct products of automatic monoids are automatic. The main aim of this paper is to prove that graph products of automatic monoids of finite geometric type are still automatic. A similar result for prefix-automatic monoids is established.
In questo lavoro si studiano i gruppi , , degli automorfismi di un gruppo che fissano — come insiemi — tutti i sottogruppi di che risultano essere rispettivamente subnormali, subnormali di difetto al più , oppure che sono compresi tra un sottogruppo caratteristico ed il suo derivato. Si danno condizioni sufficienti affinché tali gruppi siano parasolubili di para-altezza al più 2 o 3. Si generalizzano così risultati da [4], [7], [8], [10].