Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Automorphisms and subdivisions of Helly graphs

View through CrossRef
In this paper, we study Helly graphs of finite combinatorial dimension, i.e. whose injective hull is finite-dimensional. We describe very simple fine simplicial subdivisions of the injective hull of a Helly graph, following work of Lang. We also give a very explicit simplicial model of the injective hull of a Helly graph, in terms of cliques which are intersections of balls. We use these subdivisions to prove that any automorphism of a Helly graph with finite combinatorial dimension is either elliptic or hyperbolic. Moreover, every such hyperbolic automorphism has an axis in an appropriate Helly subdivision, and its translation length is rational with uniformly bounded denominator.
World Scientific Pub Co Pte Ltd
Title: Automorphisms and subdivisions of Helly graphs
Description:
In this paper, we study Helly graphs of finite combinatorial dimension, i.
e.
whose injective hull is finite-dimensional.
We describe very simple fine simplicial subdivisions of the injective hull of a Helly graph, following work of Lang.
We also give a very explicit simplicial model of the injective hull of a Helly graph, in terms of cliques which are intersections of balls.
We use these subdivisions to prove that any automorphism of a Helly graph with finite combinatorial dimension is either elliptic or hyperbolic.
Moreover, every such hyperbolic automorphism has an axis in an appropriate Helly subdivision, and its translation length is rational with uniformly bounded denominator.

Related Results

Helly groups, coarsely Helly groups, and relative hyperbolicity
Helly groups, coarsely Helly groups, and relative hyperbolicity
A simplicial graph is said to be ( coarsely ) Helly if any collection of pairwise intersecting balls...
Weakly Modular Graphs and Nonpositive Curvature
Weakly Modular Graphs and Nonpositive Curvature
This article investigates structural, geometrical, and topological characterizations and properties of weakly modular graphs and of cell complexes derived from them. The unifying t...
Sobre grafos clique críticos
Sobre grafos clique críticos
Se llama completo de un grafo a un conjunto de vértices adyacentes entre si; si un completo es maximal con respecto a la inclusión, se dice que es un clique del grafo. Los cliques ...
Helly meets Garside and Artin
Helly meets Garside and Artin
AbstractA 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...
There are 174 subdivisions of the hexahedron into tetrahedra
There are 174 subdivisions of the hexahedron into tetrahedra
This article answers an important theoretical question: How many different subdivisions of the hexahedron into tetrahedra are there? It is well known that the cube has five subdivi...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...

Back to Top