### Abstract

We give a general structure theory for reconstructing non-trivial group actions on sets without any further assumptions on the group, the action, or the set on which the group acts. Using certain "local data" D from the action we build a group G(D) of the data and a space X(D) with an action of G(D) on X(D) that arise naturally from the data D. We use these to obtain an approximation to the original group G, the original space X and the original action G × X → X. The data D is distinguished by the property that it may be chosen from the action locally. For a large enough set of local data D, our definition of G(D) in terms of generators and relations allows us to obtain a presentation for the group G. We demonstrate this on several examples. When the local data D is chosen from a graph of groups, the group G(D) is the fundamental group of the graph of groups and the space X(D) is the universal covering tree of groups. For general non-properly discontinuous group actions our local data allows us to imitate a fundamental domain, quotient space and universal covering for the quotient. We exhibit this on a non-properly discontinuous free action on . For a certain class of non-properly discontinuous group actions on the upper half-plane, we use our local data to build a space on which the group acts discretely and cocompactly. Our combinatorial approach to reconstructing abstract group actions on sets is a generalization of the Bass-Serre theory for reconstructing group actions on trees. Our results also provide a generalization of the notion of developable complexes of groups by Haefliger.

Original language | English (US) |
---|---|

Pages (from-to) | 255-323 |

Number of pages | 69 |

Journal | International Journal of Algebra and Computation |

Volume | 23 |

Issue number | 2 |

DOIs | |

State | Published - Mar 1 2013 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Mathematics(all)

### Keywords

- Group actions
- trees

### Cite this

*International Journal of Algebra and Computation*,

*23*(2), 255-323. https://doi.org/10.1142/S021819671340002X

}

*International Journal of Algebra and Computation*, vol. 23, no. 2, pp. 255-323. https://doi.org/10.1142/S021819671340002X

**Reconstructing group actions.** / Carbone, Lisa; Rips, Eliyahu.

Research output: Contribution to journal › Article

TY - JOUR

T1 - Reconstructing group actions

AU - Carbone, Lisa

AU - Rips, Eliyahu

PY - 2013/3/1

Y1 - 2013/3/1

N2 - We give a general structure theory for reconstructing non-trivial group actions on sets without any further assumptions on the group, the action, or the set on which the group acts. Using certain "local data" D from the action we build a group G(D) of the data and a space X(D) with an action of G(D) on X(D) that arise naturally from the data D. We use these to obtain an approximation to the original group G, the original space X and the original action G × X → X. The data D is distinguished by the property that it may be chosen from the action locally. For a large enough set of local data D, our definition of G(D) in terms of generators and relations allows us to obtain a presentation for the group G. We demonstrate this on several examples. When the local data D is chosen from a graph of groups, the group G(D) is the fundamental group of the graph of groups and the space X(D) is the universal covering tree of groups. For general non-properly discontinuous group actions our local data allows us to imitate a fundamental domain, quotient space and universal covering for the quotient. We exhibit this on a non-properly discontinuous free action on . For a certain class of non-properly discontinuous group actions on the upper half-plane, we use our local data to build a space on which the group acts discretely and cocompactly. Our combinatorial approach to reconstructing abstract group actions on sets is a generalization of the Bass-Serre theory for reconstructing group actions on trees. Our results also provide a generalization of the notion of developable complexes of groups by Haefliger.

AB - We give a general structure theory for reconstructing non-trivial group actions on sets without any further assumptions on the group, the action, or the set on which the group acts. Using certain "local data" D from the action we build a group G(D) of the data and a space X(D) with an action of G(D) on X(D) that arise naturally from the data D. We use these to obtain an approximation to the original group G, the original space X and the original action G × X → X. The data D is distinguished by the property that it may be chosen from the action locally. For a large enough set of local data D, our definition of G(D) in terms of generators and relations allows us to obtain a presentation for the group G. We demonstrate this on several examples. When the local data D is chosen from a graph of groups, the group G(D) is the fundamental group of the graph of groups and the space X(D) is the universal covering tree of groups. For general non-properly discontinuous group actions our local data allows us to imitate a fundamental domain, quotient space and universal covering for the quotient. We exhibit this on a non-properly discontinuous free action on . For a certain class of non-properly discontinuous group actions on the upper half-plane, we use our local data to build a space on which the group acts discretely and cocompactly. Our combinatorial approach to reconstructing abstract group actions on sets is a generalization of the Bass-Serre theory for reconstructing group actions on trees. Our results also provide a generalization of the notion of developable complexes of groups by Haefliger.

KW - Group actions

KW - trees

UR - http://www.scopus.com/inward/record.url?scp=84875662410&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84875662410&partnerID=8YFLogxK

U2 - 10.1142/S021819671340002X

DO - 10.1142/S021819671340002X

M3 - Article

AN - SCOPUS:84875662410

VL - 23

SP - 255

EP - 323

JO - International Journal of Algebra and Computation

JF - International Journal of Algebra and Computation

SN - 0218-1967

IS - 2

ER -