Decision problems concerning S-arithmetic groups
DOI10.2307/2274327zbMath0581.20045OpenAlexW2059620797MaRDI QIDQ3704085
Daniel Segal, Fritz J. Grunewald
Publication date: 1985
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274327
algorithmsgeneratorslocalizationsreductive algebraic groupfundamental setsS-arithmetic groupseffective constructiontorsion-free finitely generated nilpotent groupsBruhat- Tits buildingfinitely generated \({\mathbb{Z}}(S)\)-moduleshomogeneous n-ary forms
Decidability and field theory (12L05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Classical groups (11E57) Linear algebraic groups over adèles and other rings and schemes (20G35)
Related Items (7)
Cites Work
- Unnamed Item
- Some general algorithms. I: Arithmetic groups
- A problem of equality for Galois cohomology
- Cohomologie d'immeubles et de groupes S-arithmétiques
- Théoremes de finitude en cohomologie galoisienne
- Solving diophantine problems modulo every prime
- Arithmetic of algebraic tori
- A Proof by Classical Methods of a Result of Axon Polynomial Congruences Modulo a Prime
- How to solve a quadratic equation in integers
- GALOIS COHOMOLOGY AND SOME QUESTIONS OF THE THEORY OF ALGORITHMS
- Diophantine Problems Over Local Fields I
- THE PROBLEM OF STRONG APPROXIMATION AND THE KNESER-TITS CONJECTURE FOR ALGEBRAIC GROUPS
This page was built for publication: Decision problems concerning S-arithmetic groups