Poincaré’s Algorithm for the Lie Group SL(n, R)

Oct 19, 2025 · 1 min read
Image credit: Saint Louis University
Abstract
In this talk, I will present a geometric algorithm for determining whether the subgroup of SL(n,R) generated by a finite set of elements is discrete, and to identify relators for an explicit group presentation. The algorithm works by constructing suitable polytopes in the symmetric space associated to SL(n,R), analogous to established methods from real hyperbolic geometry. I will also describe a computer implementation of the algorithm.
Date
Oct 19, 2025 2:30 PM — 3:00 PM
Event
Location

Saint Louis University

220 N. Grand Blvd, St. Louis, MO 63103

Note

Click on the Slides button above to view the built-in slides feature.

Slides can be added in a few ways:

  • Create slides using Hugo Blox Builder’s Slides feature and link using the slides parameter in the front matter of the talk file
  • Upload an existing slide deck to this page bundle and link it using links: [{ type: slides, url: path/to/file } ] in front matter
  • Embed your slides (e.g. Google Slides) or presentation video on this page using shortcodes.

Further event details, including page elements such as image galleries, can be added to the body of this page.

Yukun (Bennie) Du
Authors
Yukun (Bennie) Du (he/they)
Postdoctoral Teaching & Researching Fellow