Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where A.S. Detinko is active.

Publication


Featured researches published by A.S. Detinko.


Journal of Symbolic Computation | 2008

Algorithms for computing with nilpotent matrix groups over infinite domains

A.S. Detinko; Dane Flannery

We develop methods for computing with matrix groups defined over a range of infinite domains, and apply those methods to the design of algorithms for nilpotent groups. In particular, we provide a practical nilpotency testing algorithm for matrix groups over an infinite field. We also provide algorithms to answer a number of structural questions for a nilpotent matrix group.The main algorithms have been implemented in GAP, for groups over the rational number field.


Lms Journal of Computation and Mathematics | 2006

Computing in Nilpotent Matrix Groups

A.S. Detinko; Dane Flannery

We present algorithms for testing nilpotency of matrix groups over finite fields, and for deciding irreducibility and primitivity of nilpotent matrix groups. The algorithms also construct modules and imprimitivity systems for nilpotent groups. In order to justify our algorithms, we prove several structural results for nilpotent linear groups, and computational and theoretical results for abstract nil-potent groups, which are of independent interest.


Journal of Symbolic Computation | 2009

On deciding finiteness of matrix groups

A.S. Detinko; Dane Flannery

We provide a new, practical algorithm for deciding finiteness of matrix groups over function fields of zero characteristic. The algorithm has been implemented in GAP. Experimental results and extensions of the algorithm to any field of zero characteristic are discussed.


Lms Journal of Computation and Mathematics | 2001

ON DECIDING FINITENESS FOR MATRIX GROUPS OVER FIELDS OF POSITIVE CHARACTERISTIC

A.S. Detinko

The author considers the development of algorithms for deciding whether a finitely generated matrix group over a field of positive characteristic is finite. A deterministic algorithm for deciding the finiteness is presented for the case of a field of transcendence degree one over a finite field.


Mathematics of Computation | 2017

Zariski density and computing in arithmetic groups

A.S. Detinko; Dane Flannery; Alexander Hulpke

For


Communications in Algebra | 2005

NILPOTENT PRIMITIVE LINEAR GROUPS OVER FINITE FIELDS

A.S. Detinko; Dane Flannery

n > 2


Glasgow Mathematical Journal | 2004

CLASSIFICATION OF NILPOTENT PRIMITIVE LINEAR GROUPS OVER FINITE FIELDS

A.S. Detinko; Dane Flannery

, let


Experimental Mathematics | 2018

Algorithms for Experimenting with Zariski Dense Subgroups

A.S. Detinko; Dane Flannery; Alexander Hulpke

\Gamma


Journal of Symbolic Computation | 2015

Integrality and arithmeticity of solvable linear groups

A.S. Detinko; Dane Flannery; W.A. de Graaf

denote either


Expositiones Mathematicae | 2018

Linear groups and computation

A.S. Detinko; Dane Flannery

SL(n, Z)

Collaboration


Dive into the A.S. Detinko's collaboration.

Top Co-Authors

Avatar

Dane Flannery

National University of Ireland

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge