Integrality and arithmeticity of solvable linear groups

05/10/2019
by   W. A. de Graaf, et al.
0

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group G is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of G. We also provide a simple new algorithm for integrality testing of finitely generated solvable-by-finite linear groups over the rational field. The algorithms have been implemented in Magma.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/22/2020

Equation satisfiability in solvable groups

The study of the complexity of the equation satisfiability problem in fi...
research
05/09/2018

Multicast Networks Solvable over Every Finite Field

In this work, it is revealed that an acyclic multicast network that is s...
research
05/07/2019

The strong approximation theorem and computing with linear groups

We obtain a computational realization of the strong approximation theore...
research
02/08/2022

Streaming word problems

We study deterministic and randomized streaming algorithms for word prob...
research
11/02/2020

Rounding Error Analysis of Linear Recurrences Using Generating Series

We develop a toolbox for the error analysis of linear recurrences with c...
research
02/24/2020

Hardness of equations over finite solvable groups under the exponential time hypothesis

Goldmann and Russell (2002) initiated the study of the complexity of the...
research
09/30/2021

Efficient computations with counting functions on free groups and free monoids

We present efficient algorithms to decide whether two given counting fun...

Please sign up or login with your details

Forgot password? Click here to reset