We survey recent progress in computing with finitely generated linear groups over infinite fields, describing the mathematical background of a methodology applied to design practical algorithms for these groups. Implementations of the algorithms have been used to perform extensive computer experiments
AbstractWe call a group G algorithmically finite if no algorithm can produce an infinite set of pair...
This is a survey on the infinite group problem, an infinite-dimensional relaxation of integ...
This is a survey on the infinite group problem, an infinite-dimensional relaxation of integ...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
AbstractWe develop methods for computing with matrix groups defined over a range of infinite domains...
We present recent developments in a novel domain of computational group theory: computing with infin...
AbstractWe develop methods for computing with matrix groups defined over a range of infinite domains...
International audienceWe present here algorithms for efficient computation of linear algebra problem...
AbstractWe present an algorithm to decide whether a finitely generated linear group over an infinite...
This book describes the basic algorithmic ideas behind accepted methods for computing with finitely ...
In this thesis, we develop practical algorithms for irreducibility and primitivity testing of finite...
This series of lectures concentrates on deterministic algorithms for finite fields. The emphasis is ...
International audienceThis series of lectures concentrates on deterministic algorithms for finite fi...
AbstractWe call a group G algorithmically finite if no algorithm can produce an infinite set of pair...
This is a survey on the infinite group problem, an infinite-dimensional relaxation of integ...
This is a survey on the infinite group problem, an infinite-dimensional relaxation of integ...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
We present an exposition of our ongoing project in a new area of applicable mathematics: practical c...
AbstractWe develop methods for computing with matrix groups defined over a range of infinite domains...
We present recent developments in a novel domain of computational group theory: computing with infin...
AbstractWe develop methods for computing with matrix groups defined over a range of infinite domains...
International audienceWe present here algorithms for efficient computation of linear algebra problem...
AbstractWe present an algorithm to decide whether a finitely generated linear group over an infinite...
This book describes the basic algorithmic ideas behind accepted methods for computing with finitely ...
In this thesis, we develop practical algorithms for irreducibility and primitivity testing of finite...
This series of lectures concentrates on deterministic algorithms for finite fields. The emphasis is ...
International audienceThis series of lectures concentrates on deterministic algorithms for finite fi...
AbstractWe call a group G algorithmically finite if no algorithm can produce an infinite set of pair...
This is a survey on the infinite group problem, an infinite-dimensional relaxation of integ...
This is a survey on the infinite group problem, an infinite-dimensional relaxation of integ...