Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-12T19:44:00.478Z Has data issue: false hasContentIssue false

The Orbit-Stabilizer Problem for Linear Groups

Published online by Cambridge University Press:  20 November 2018

John D. Dixon*
Affiliation:
Carleton University, Ottawa, Ontario
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let G be a subgroup of the general linear group GL(n, Q) over the rational field Q, and consider its action by right multiplication on the vector space Q n of n-tuples over Q. The present paper investigates the question of how we may constructively determine the orbits and stabilizers of this action for suitable classes of groups. We suppose that G is specified by a finite set {x 1, …, xr ) of generators, and investigate whether there exist algorithms to solve the two problems:

(Orbit Problem) Given u, v ∊ Q n , does there exist x ∊ G such that ux = v; if so, find such an element x as a word in x 1, …, xr and their inverses.

(Stabilizer Problem) Given u, v ∊ Q n , describe all words in x 1, …, xr and their inverses which lie in the stabilizer

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1985