Linear groups and computation
From MaRDI portal
Abstract: We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in this class of groups are surveyed. We illustrate the solution of hard mathematical problems by computer experimentation. Possible avenues for further progress are discussed. This article is aimed at a broad mathematical audience, and more particularly at users of group-theoretical methods and computer algebra systems.
Recommendations
Cites work
- scientific article; zbMATH DE number 5976624 (Why is no real title available?)
- scientific article; zbMATH DE number 5982274 (Why is no real title available?)
- scientific article; zbMATH DE number 3138253 (Why is no real title available?)
- scientific article; zbMATH DE number 3971056 (Why is no real title available?)
- scientific article; zbMATH DE number 67424 (Why is no real title available?)
- scientific article; zbMATH DE number 3496414 (Why is no real title available?)
- scientific article; zbMATH DE number 3536314 (Why is no real title available?)
- scientific article; zbMATH DE number 1243197 (Why is no real title available?)
- scientific article; zbMATH DE number 1256646 (Why is no real title available?)
- scientific article; zbMATH DE number 1263310 (Why is no real title available?)
- scientific article; zbMATH DE number 1302485 (Why is no real title available?)
- scientific article; zbMATH DE number 475366 (Why is no real title available?)
- scientific article; zbMATH DE number 534859 (Why is no real title available?)
- scientific article; zbMATH DE number 556507 (Why is no real title available?)
- scientific article; zbMATH DE number 2070152 (Why is no real title available?)
- scientific article; zbMATH DE number 2133330 (Why is no real title available?)
- scientific article; zbMATH DE number 742945 (Why is no real title available?)
- scientific article; zbMATH DE number 2107935 (Why is no real title available?)
- scientific article; zbMATH DE number 1406263 (Why is no real title available?)
- scientific article; zbMATH DE number 1418992 (Why is no real title available?)
- scientific article; zbMATH DE number 3893421 (Why is no real title available?)
- scientific article; zbMATH DE number 3367188 (Why is no real title available?)
- scientific article; zbMATH DE number 3375759 (Why is no real title available?)
- scientific article; zbMATH DE number 3397780 (Why is no real title available?)
- scientific article; zbMATH DE number 3401090 (Why is no real title available?)
- scientific article; zbMATH DE number 3411305 (Why is no real title available?)
- A data structure for a uniform approach to computations with finite groups
- A practical algorithm for finding matrix representations for polycyclic groups
- A practical model for computation with matrix groups.
- A probabilistic Tits alternative and probabilistic identities
- A topological Tits alternative.
- Algorithmic use of the Mal'cev correspondence.
- Algorithms for arithmetic groups with the congruence subgroup property.
- Algorithms for computing with nilpotent matrix groups over infinite domains.
- Algorithms for linear groups of finite rank.
- Algorithms for matrix groups and the Tits alternative
- Algorithms for the Tits alternative and related problems.
- Almost all subgroups of a Lie group are free
- Arithmetic groups
- Arithmeticity of certain symplectic hypergeometric groups
- Block Systems of a Galois Group
- Codes on Euclidean spheres
- Computation with linear algebraic groups
- Computing generators of the unit group of an integral Abelian group ring.
- Computing in Nilpotent Matrix Groups
- Computing in arithmetic groups with Voronoï's algorithm.
- Computing in unipotent and reductive algebraic groups.
- Computing polycyclic presentations for polycyclic rational matrix groups.
- Computing with matrix groups over infinite fields.
- Conditions for linear groups to have unipotent derived subgroups.
- Constructing algebraic groups from their Lie algebras.
- Constructing arithmetic subgroups of unipotent groups.
- Deciding finiteness for matrix groups over function fields
- Deciding finiteness for matrix semigroups over function fields over finite fields. A note on a paper by Rockmore, Tan, and Beals
- Deciding finiteness of matrix groups in positive characteristic.
- Decision problems concerning S-arithmetic groups
- Finite factor groups of the unimodular group
- Finite rational matrix groups
- Free subgroups in linear groups
- Free subgroups of \(SL(n,Z),\) \(n>2\), generated by transvections
- Generating pairs for finite index subgroups of \(\mathrm{SL}(n,\mathbb{Z})\)
- Generators For All Principal Congruence Subgroups of SL(n, Z) with n ≥3
- How to pick a random integer matrix? (and other questions)
- Improved algorithms for the Tits alternative
- Integrality and arithmeticity of solvable linear groups.
- Linear groups
- Matrix representations for torsion-free nilpotent groups by Deep Thought.
- Monodromy of Picard-Fuchs differential equations for Calabi-Yau threefolds
- Notes on thin matrix groups
- On Deciding Finiteness for Matrix Groups over Fields of Positive Characteristic
- On computing a separating transcendence basis
- On deciding finiteness of matrix groups.
- On the maximal subgroups of the finite classical groups
- Pell's Equation and Two Generator Free Möbius Groups
- Polynomial-time theory of matrix groups
- Practical algorithms for polycyclic matrix groups
- Quantum automata and algebraic groups
- Random subgroups of linear groups are free.
- Recognizing finite matrix groups over infinite fields.
- Small subgroups of SL\((3,\mathbb Z)\)
- Solution of the congruence subgroup problem for \(\text{SL}_ n\) \((n\geq 3)\) and \(\text{Sp}_{2n}\) \((n\geq 2)\)
- Some general algorithms. I: Arithmetic groups
- Some general algorithms. II: Nilpotent groups
- Strong approximation for algebraic groups.
- Strongly dense free subgroups of semisimple algebraic groups.
- Subgroup growth.
- Testing polycyclicity of finitely generated rational matrix groups
- The Magma algebra system. I: The user language
- The Orbit-Stabilizer Problem for Linear Groups
- The algorithmic theory of polycyclic-by-finite groups
- The congruence subgroup problem.
- The ubiquity of thin groups
- Thin monodromy in Sp(4)
- Zariski Dense Surface Subgroups in SL(4, )
- Zariski dense surface subgroups in \(\mathrm{SL}(3,\mathbb Z)\).
- Zariski density and computing in arithmetic groups
- Zariski density and genericity.
Cited in
(14)- Algorithms for linear groups of finite rank.
- Improved algorithms for the Tits alternative
- On the parallel complexity of linear groups
- Algorithmic methods for finitely generated Abelian groups
- Practical Computation with Linear Groups Over Infinite Domains
- Algorithms for the Tits alternative and related problems.
- Linear processing with pregroups
- Computational group theory in St. Petersburg
- scientific article; zbMATH DE number 194159 (Why is no real title available?)
- Algorithms in linear algebraic groups
- List of problems on discrete subgroups of Lie groups and their computational aspects
- Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)
- The strong approximation theorem and computing with linear groups
- Towards effective algorithms for linear groups.
Describes a project that uses
Uses Software
This page was built for publication: Linear groups and computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292421)
