Papers
Topics
Authors
Recent
Search
2000 character limit reached

Thin hyperbolic reflection groups

Published 29 Dec 2021 in math.GR, math.GT, and math.NT | (2112.14642v4)

Abstract: We study a family of Zariski dense finitely generated discrete subgroups of $\mathrm{Isom}(\mathbb{H}d)$, $d \geqslant 2$, defined by the following property: any group in this family contains at least one reflection in a hyperplane. As an application we obtain a general description of all thin hyperbolic reflection groups. In particular, we show that the Vinberg algorithm applied to a non-reflective Lorentzian lattice gives rise to an infinite sequence of thin reflection subgroups in $\mathrm{Isom}(\mathbb{H}d)$, for any $d \geqslant 2$. Moreover, every such group is a subgroup of a group produced by the Vinberg algorithm applied to a Lorentzian lattice independently on the latter being reflective. As a consequence, all thin hyperbolic reflection groups are enumerable.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.