Integrality and arithmeticity of solvable linear groups. (Q480648): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Testing polycyclicity of finitely generated rational matrix groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Magma algebra system. I: The user language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing algebraic groups from their Lie algebras. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing arithmetic subgroups of unipotent groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Tits alternative and related problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing finite matrix groups over infinite fields. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for linear groups of finite rank. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Orbit-Stabilizer Problem for Linear Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing generators of the unit group of an integral Abelian group ring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3663506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936151 / rank
 
Normal rank

Latest revision as of 10:58, 9 July 2024

scientific article
Language Label Description Also known as
English
Integrality and arithmeticity of solvable linear groups.
scientific article

    Statements

    Integrality and arithmeticity of solvable linear groups. (English)
    0 references
    9 December 2014
    0 references
    The authors 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\). They 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 \textsc{Magma}.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    arithmetic groups
    0 references
    algorithms
    0 references
    finitely generated subgroups
    0 references
    solvable algebraic groups
    0 references
    lattices
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references