Geometry of Selberg's bisectors in the symmetric space SL(n,R)/SO(n,R)$SL(n,\mathbb {R})/SO(n,\mathbb {R})$

Abstract I study several problems about the symmetric space associated with the Lie group . These problems are connected to an algorithm based on Poincaré's Fundamental Polyhedron Theorem, designed to determine generalized geometric finiteness properties for subgroups of . The algorithm is analogous to the original one in hyperbolic spaces, while the Riemannian distance is replaced by an ‐invariant premetric. The main results of this paper are twofold. In the first part, I focus on questions that occurred in generalizing Poincaré's Algorithm to my symmetric space. I describe and implement an algorithm that computes the face‐poset structure of finitely sided polyhedra, and construct an angle‐like function between hyperplanes. In the second part, I study further questions related to hyperplanes and Dirichlet–Selberg domains in my symmetric space. I establish several criteria for the disjointness of hyperplanes and classify particular Abelian subgroups of based on whether their Dirichlet–Selberg domains are finitely sided or not.

Authors

Institutions

Publication Details

Journal
Journal of the London Mathematical Society
Published
2024-09-26
DOI
https://doi.org/10.1112/jlms.12992
Primary Topic
Finite Group Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Geometry of Selberg's bisectors in the symmetric space SL(n,R)/SO(n,R)$SL(n,\mathbb {R})/SO(n,\mathbb {R})$

Yukun Du
Journal of the London Mathematical Society
Finite Group Theory Research
article

Geometry of Selberg's bisectors in the symmetric space SL(n,R)/SO(n,R)$SL(n,\mathbb {R})/SO(n,\mathbb {R})$

Yukun Du
article en

Abstract

Abstract I study several problems about the symmetric space associated with the Lie group . These problems are connected to an algorithm based on Poincaré's Fundamental Polyhedron Theorem, designed to determine generalized geometric finiteness properties for subgroups of . The algorithm is analogous to the original one in hyperbolic spaces, while the Riemannian distance is replaced by an ‐invariant premetric. The main results of this paper are twofold. In the first part, I focus on questions that occurred in generalizing Poincaré's Algorithm to my symmetric space. I describe and implement an algorithm that computes the face‐poset structure of finitely sided polyhedra, and construct an angle‐like function between hyperplanes. In the second part, I study further questions related to hyperplanes and Dirichlet–Selberg domains in my symmetric space. I establish several criteria for the disjointness of hyperplanes and classify particular Abelian subgroups of based on whether their Dirichlet–Selberg domains are finitely sided or not.

Journal of the London Mathematical SocietyVol. 110(4)
University of Georgia (US)
Openalex Percentile: Top 70%
Finite Group Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.