Super-Apollonian Generalizations
Arithmetic reflection groups and crystallographic packings · AIMPL workshop record
Editorial mapping of AIMPL source category: Number theory. http://aimpl.org/reflectiongpv/ Not an author-supplied MSC code.
Problem statement
For which parameter values...
-
does preserve a quadratic form ?
-
is discrete?
-
is a lattice?
-
is (quasi-)arithmetic?
-
does have extra relations not already present in the Apollonian/dual Apollonian subgroups?
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
Question context
In Source citation: MR2173929 the authors introduce the super-Apollonian group, which is generated by the Apollonian group and the corresponding dual group. By replacing the 's in the generators of each subgroup with parameters and (respectively), one obtains a -parameter generalization of the super-Apollonian group, which we denote (here the refers to the matrices having size ).
Progress & source assessment
Dated source record, inspected 2026-09-10. Current status has not been independently reassessed. Source-reported results have not been independently verified.
Status note in the source
Subproblem 1 is resolved. preserves a quadratic form iff . Moreover, this quadratic form is positive definite when , and it is Lorentzian when or .
- [1]Arithmetic reflection groups and crystallographic packings · Original question link
- [2]AIMPL source bibliography link
- [3]AIMPL text license · CC BY-SA 3.0 linkAIM Problem Lists (AIMPL), original contributors; CC BY-SA 3.0. Adaptation: structural TeX converted to Markdown, documented source macros expanded, and source bibliography links added. Mathematical wording retained. These adapted source texts remain under CC BY-SA 3.0.
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.