A graph is Helly if every family of pairwise intersecting combinatorial balls has a nonempty intersection. We show that weak Garside groups of finite type and FC-type Artin groups are Helly, that is, they act geometrically on Helly graphs. In particular, such groups act geometrically on spaces with convex geodesic bicombing, equipping them with a nonpositive-curvature-like structure. That structure has many properties of a CAT(0) structure and, additionally, it has a combinatorial flavor implying biautomaticity. As immediate consequences we obtain new results for FC-type Artin groups (in particular braid groups and spherical Artin groups) and weak Garside groups, including e.g.\ fundamental groups of the complements of complexified finite s...
We prove that, for any irreducible Artin-Tits group of spherical type G, the quotient of G by its ce...
In this paper we introduce and study some geometric objects associated to Artin monoids. The Deligne...
The efficient resolution of various problems in computational geometry, for instance visibility comp...
Helly graphs are graphs in which every family of pairwise intersecting balls has a non-empty interse...
AbstractA (strongly) Helly graph* is a connected graph for which any finite (resp. finite or infinit...
AbstractWe describe a connection between the combinatorics of generators for certain groups and the ...
In this paper we present a variety of problems in the interface between combinatorics and geometry a...
In this paper, we investigate the graphs in which all balls are convex and the groups acting on them...
A graph is clique-Helly if any family of mutually intersecting cliques has non-empty intersection. D...
Since their popularization by Gromov in the eighties, CAT(0) metric spaces of bounded curvature as d...
AbstractThe diamond is the graph obtained from K4 by deleting an edge. Circle graphs are the interse...
AbstractThe definition of the Helly property for hypergraphs was motivated by the Helly theorem for ...
AbstractA family C of sets has the Helly property if any subfamily C′ whose elements are pairwise in...
Abstract. It is known that a number of algebraic properties of the braid groups extend to arbitrary ...
Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-05-12T14:03:31Z No. of bitstreams:...
We prove that, for any irreducible Artin-Tits group of spherical type G, the quotient of G by its ce...
In this paper we introduce and study some geometric objects associated to Artin monoids. The Deligne...
The efficient resolution of various problems in computational geometry, for instance visibility comp...
Helly graphs are graphs in which every family of pairwise intersecting balls has a non-empty interse...
AbstractA (strongly) Helly graph* is a connected graph for which any finite (resp. finite or infinit...
AbstractWe describe a connection between the combinatorics of generators for certain groups and the ...
In this paper we present a variety of problems in the interface between combinatorics and geometry a...
In this paper, we investigate the graphs in which all balls are convex and the groups acting on them...
A graph is clique-Helly if any family of mutually intersecting cliques has non-empty intersection. D...
Since their popularization by Gromov in the eighties, CAT(0) metric spaces of bounded curvature as d...
AbstractThe diamond is the graph obtained from K4 by deleting an edge. Circle graphs are the interse...
AbstractThe definition of the Helly property for hypergraphs was motivated by the Helly theorem for ...
AbstractA family C of sets has the Helly property if any subfamily C′ whose elements are pairwise in...
Abstract. It is known that a number of algebraic properties of the braid groups extend to arbitrary ...
Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-05-12T14:03:31Z No. of bitstreams:...
We prove that, for any irreducible Artin-Tits group of spherical type G, the quotient of G by its ce...
In this paper we introduce and study some geometric objects associated to Artin monoids. The Deligne...
The efficient resolution of various problems in computational geometry, for instance visibility comp...