Abstract. By a result of Gersten and Short finite presentations satisfying the usual non-metric small cancellation conditions present biautomatic groups. We show that in the case in which all pieces have length one, a generalization of the C(3)-T(6) condition yields a larger collection of biautomatic groups. 1
ABSTRACT. We prove the Haagerup property ( = Gromov’s a-T-menability) for finitely generated groups ...
Abstract. We construct small cancellation labellings for some infinite sequences of finite graphs of...
International audienceWe show that the Wirtinger presentation of a prime alternating link group sati...
Abstract. We extend fundamental results of small cancellation theory to groups whose presentations s...
S. Gersten and H. Short have proved that if a group has a presen-tation which satisfies the algebrai...
ABSTRACT. Our method in this paper gives a procedure to convert any finite group presentation to be ...
We present a metric condition which describes the geometry of classical small cancellation groups an...
We present four generalized small cancellation conditions for nite presentations and solve the word-...
Abstract. We construct small cancellation labellings for some infinite sequences of finite graphs of...
In this article a generalized version of small cancellation theory is de-veloped which is applicable...
Abstract. An automatic presentation of a relational structure is, informally, a representation of th...
Abstract. We prove that infinitely presented graphical C(7) and Gr(7) small cancellation groups are ...
ABSTRACT. We prove the Haagerup property ( = Gromov’s a-T-menability) for finitely generated groups ...
ABSTRACT. We prove the Haagerup property ( = Gromov’s a-T-menability) for finitely generated groups ...
AbstractIn this paper we develop new techniques to work with small cancellation theory diagrams for ...
ABSTRACT. We prove the Haagerup property ( = Gromov’s a-T-menability) for finitely generated groups ...
Abstract. We construct small cancellation labellings for some infinite sequences of finite graphs of...
International audienceWe show that the Wirtinger presentation of a prime alternating link group sati...
Abstract. We extend fundamental results of small cancellation theory to groups whose presentations s...
S. Gersten and H. Short have proved that if a group has a presen-tation which satisfies the algebrai...
ABSTRACT. Our method in this paper gives a procedure to convert any finite group presentation to be ...
We present a metric condition which describes the geometry of classical small cancellation groups an...
We present four generalized small cancellation conditions for nite presentations and solve the word-...
Abstract. We construct small cancellation labellings for some infinite sequences of finite graphs of...
In this article a generalized version of small cancellation theory is de-veloped which is applicable...
Abstract. An automatic presentation of a relational structure is, informally, a representation of th...
Abstract. We prove that infinitely presented graphical C(7) and Gr(7) small cancellation groups are ...
ABSTRACT. We prove the Haagerup property ( = Gromov’s a-T-menability) for finitely generated groups ...
ABSTRACT. We prove the Haagerup property ( = Gromov’s a-T-menability) for finitely generated groups ...
AbstractIn this paper we develop new techniques to work with small cancellation theory diagrams for ...
ABSTRACT. We prove the Haagerup property ( = Gromov’s a-T-menability) for finitely generated groups ...
Abstract. We construct small cancellation labellings for some infinite sequences of finite graphs of...
International audienceWe show that the Wirtinger presentation of a prime alternating link group sati...