Add to ORKGIn this paper, we will study the discreteness criterion for non-elementary subgroups in PU(1, n; C). Several discreteness criteria are obtained. As an application, the convergence theorem of discrete subgroups in P U (1, n; C) is discussed.http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000241563700006&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=8e1609b174ce4e31116a60747a720701MathematicsSCI(E)5ARTICLE349-528
We prove that the discreteness problem for two-generated nonelementary subgroups of SL(2, C) is unde...
We prove that the discreteness problem for two-generated nonelementary subgroups of SL(2, C) is unde...
In this paper we address the problem of understanding when a verbal subgroup of a finite group is p-...
In the study of discrete groups it is important to find conditions for a group to be discrete. Given...
The following result is the main result of the paper. Let $G\subset \boldsymbol{SL}(2,\boldsymbol C)...
Abstract. It’s known that one could use a fixed loxodromic or para-bolic element in M(R n) as a test...
I I n t roduct ion Let G be a subgroup of PSL(2, C). The discreteness problem for G is the problem o...
summary:One of the basic questions in the Kleinian group theory is to understand both algebraic and ...
AbstractIn [Y.-P. Jiang, S. Kamiya, J.R. Parker, Jøgensen’s inequality for complex hyperbolic space,...
Supported by the National Science Foundation during 1986–1988 at the Mathematical Sciences Research ...
summary:Given a discrete group $G$, we consider the set $\Cal L(G)$ of all subgroups of $G$ endowed ...
Abstract. Branching problems ask how an irreducible representation of a group decomposes when restri...
Abstract. We give an arithmetic criterion which is sufficient to imply the discreteness of various t...
We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a ra...
We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a ra...
We prove that the discreteness problem for two-generated nonelementary subgroups of SL(2, C) is unde...
We prove that the discreteness problem for two-generated nonelementary subgroups of SL(2, C) is unde...
In this paper we address the problem of understanding when a verbal subgroup of a finite group is p-...
In the study of discrete groups it is important to find conditions for a group to be discrete. Given...
The following result is the main result of the paper. Let $G\subset \boldsymbol{SL}(2,\boldsymbol C)...
Abstract. It’s known that one could use a fixed loxodromic or para-bolic element in M(R n) as a test...
I I n t roduct ion Let G be a subgroup of PSL(2, C). The discreteness problem for G is the problem o...
summary:One of the basic questions in the Kleinian group theory is to understand both algebraic and ...
AbstractIn [Y.-P. Jiang, S. Kamiya, J.R. Parker, Jøgensen’s inequality for complex hyperbolic space,...
Supported by the National Science Foundation during 1986–1988 at the Mathematical Sciences Research ...
summary:Given a discrete group $G$, we consider the set $\Cal L(G)$ of all subgroups of $G$ endowed ...
Abstract. Branching problems ask how an irreducible representation of a group decomposes when restri...
Abstract. We give an arithmetic criterion which is sufficient to imply the discreteness of various t...
We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a ra...
We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a ra...
We prove that the discreteness problem for two-generated nonelementary subgroups of SL(2, C) is unde...
We prove that the discreteness problem for two-generated nonelementary subgroups of SL(2, C) is unde...
In this paper we address the problem of understanding when a verbal subgroup of a finite group is p-...