Algorithms for computing with nilpotent matrix groups over infinite domains

A. S. Detinko; Dane Flannery

doi:10.1016/j.jsc.2007.08.001

ScienceGate Book Chapters

JOURNAL ARTICLE

Algorithms for computing with nilpotent matrix groups over infinite domains

A. S. Detinko Dane Flannery

Year: 2007 Journal: Journal of Symbolic Computation Vol: 43 (1)Pages: 8-26 Publisher: Elsevier BV

DOI: 10.1016/j.jsc.2007.08.001

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Nilpotent Matrix (chemical analysis) Nilpotent matrix Algebra over a field Pure mathematics Combinatorics Discrete mathematics Matrix function Symmetric matrix Eigenvalues and eigenvectors

Metrics

Cited By

1.63

FWCI (Field Weighted Citation Impact)

Refs

0.78

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Finite Group Theory Research

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Coding theory and cryptography

Physical Sciences → Computer Science → Artificial Intelligence

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Algorithms for computing with nilpotent matrix groups over infinite domains

Metrics

Citation History

Topics

Related Documents

Computing with matrix groups over infinite fields

On Finite Nilpotent Matrix Groups over Integral Domains

Modules over infinite nilpotent groups

Computing in Nilpotent Matrix Groups

Practical Computation with Linear Groups Over Infinite Domains