Results 1  10
of
12
The MAPLE Package “Janet”: I. Polynomial Systems
 IN THE PROCCEDINGS OF COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING CASC 2003
, 2003
"... The MAPLE package “Janet”⋆ comes in two parts, the first dealing with polynomials and commutative algebra, the second with linear PDEs. Here the first part, called “Involutive”, is described. Amongst others it contains a MAPLE and a C++ implementation of the involutive technique for polynomial modu ..."
Abstract

Cited by 16 (10 self)
 Add to MetaCart
(Show Context)
The MAPLE package “Janet”⋆ comes in two parts, the first dealing with polynomials and commutative algebra, the second with linear PDEs. Here the first part, called “Involutive”, is described. Amongst others it contains a MAPLE and a C++ implementation of the involutive technique for polynomial modules as an alternative for conventional Gröbner basis techniques.
Algorithms for Groups
, 1994
"... Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide application. Because of its relative maturity, computational group theory may be used to gain insight into the general str ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide application. Because of its relative maturity, computational group theory may be used to gain insight into the general structure of algebraic algorithms. This paper examines the basic ideas behind some of the more important algorithms for finitely presented groups and permutation groups, and surveys recent developments in these fields.
An Invitation to Computational Group Theory
 Groups' 93  Galway/St. Andrews, volume 212 of London Math. Soc. Lecture Note Ser
, 1995
"... Algebra" in 1967 [Lee70]. Its proceedings contain a survey of what had been tried until then [Neu70] but also some papers that lead into the Decade of discoveries (19671977). At the Oxford conference some of those computational methods were presented for the first time that are now, in some ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
Algebra" in 1967 [Lee70]. Its proceedings contain a survey of what had been tried until then [Neu70] but also some papers that lead into the Decade of discoveries (19671977). At the Oxford conference some of those computational methods were presented for the first time that are now, in some cases varied and improved, work horses of CGT systems: Sims' methods for handling big permutation groups [Sim70], the KnuthBendix method for attempting to construct a rewrite system from a presentation [KB70], variations of the ToddCoxeter method for the determination of presentations of subgroups [Men70]. Others, like J. D. Dixon's method for the determination of the character table [Dix67], the pNilpotentQuotient method of I. D. Macdonald [Mac74] and the ReidemeisterSchreier method of G. Havas [Hav74] for subgroup presentations were published within a few years from that conference. However at least equally important for making group theorists aware of CGT were a number of applications of...
Some Computational Approaches To Groups Given By A Finite Presentation
, 1988
"... this paper. Our special interest is in groups which are presented to us as being generated by a small set of elements, be these permutations of vertices of a graph, matrices describing automorphisms of linear codes, or classes of homotopies of a knot described only by the relations that they satisfy ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
this paper. Our special interest is in groups which are presented to us as being generated by a small set of elements, be these permutations of vertices of a graph, matrices describing automorphisms of linear codes, or classes of homotopies of a knot described only by the relations that they satisfy (see [Hac 87]). Although the axioms that define the notion of a group are rather simple, and in spite of the abundance of knowledge about large classes of groups, one is frequently frustrated by the paucity of methods for dealing with groups described by a small set of generators and relations that hold between them. What is lacking in the standard texts of classical algebra and group theory is a counterpart of numerical methods in differential equations. Yet, such computational methods in group theory have been developed along the years under the influence of external problems as well as from within, especially by the needs of the classification of finite simple groups and the Burnside Groups problem. It should be emphasized that the present computational methods build on careful analysis of algorithmic aspects of known theories. Also, that the practical use of these algorithms became possible in a meaningful way only with the advent of computer technology. We will present in this article some of the known computational methods for investigating groups given by generators and relations, comment
Computing Subgroups by Exhibition in Finite Solvable Groups
 Journal of Symbolic Computation
"... We present practical algorithms to compute subgroups such as Hall systems, system normalizers, Fnormalizers and Fcovering subgroups in finite solvable groups. An application is an algorithm to calculate head complements in finite solvable groups; that is, complements which are closely related to m ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
We present practical algorithms to compute subgroups such as Hall systems, system normalizers, Fnormalizers and Fcovering subgroups in finite solvable groups. An application is an algorithm to calculate head complements in finite solvable groups; that is, complements which are closely related to maximal subgroups. Our algorithms use the technique of exhibiting subgroups. Subgroups such as Hall systems, system normalizers, Fnormalizers and Fcovering subgroups arise naturally in the study of finite solvable groups. Here we present practical algorithms to compute such subgroups. Besides being of interest in the theory of formations, the algorithms also yield fast methods for constructing head complements. These complements are closely related to the maximal subgroups of the underlying group and they also arise in the determination of special polycyclic generating sequences for solvable groups. Such sequences have proved to be of central importance for fast computations with finite solvable groups, and thus a practical method to obtain them has important applications. Our approach is to start with a special type of generating set for a given solvable
Construction of Combinatorial Objects
, 1995
"... Isomorphism problems often can be solved by determining orbits of a group acting on the set of all objects to be classified. The paper centers around algorithms for this topic and shows how to base them on the same idea, the homomorphism principle. Especially it is shown that forming Sims chains, u ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Isomorphism problems often can be solved by determining orbits of a group acting on the set of all objects to be classified. The paper centers around algorithms for this topic and shows how to base them on the same idea, the homomorphism principle. Especially it is shown that forming Sims chains, using an algorithmic version of Burnside's table of marks, computing double coset representatives, and computing Sylow subgroups of automorphism groups can be explained in this way. The exposition is based on graph theoretic concepts to give an easy explanation of data structures for group actions.
ALGORITHMIC USE OF THE MAL’CEV CORRESPONDENCE
"... Mal’cev showed in the 1950s that there is a correspondence between radicable torsionfree nilpotent groups and rational nilpotent Lie algebras. In this paper we show how to establish the connection between the radicable hull of a finitely generated torsionfree nilpotent group and its corresponding ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Mal’cev showed in the 1950s that there is a correspondence between radicable torsionfree nilpotent groups and rational nilpotent Lie algebras. In this paper we show how to establish the connection between the radicable hull of a finitely generated torsionfree nilpotent group and its corresponding Lie algebra algorithmically. We apply it to fast multiplication of elements of polycyclically presented groups. 1
Computing Subgroups Invariant Under a Set of
, 2000
"... This article describes an algorithm for computing up to conjugacy all subgroups of a finite solvable group that are invariant under a set of automorphisms. It constructs the subgroups stepping down along a normal chain with elementary abelian factors. 1. ..."
Abstract
 Add to MetaCart
(Show Context)
This article describes an algorithm for computing up to conjugacy all subgroups of a finite solvable group that are invariant under a set of automorphisms. It constructs the subgroups stepping down along a normal chain with elementary abelian factors. 1.
Computing Formation Theoretic Subgroups and Certain Complements in Finite Solvable Groups
"... this paper we introduce a new approach to this theory and theoretical results that yield practical methods to compute formation theoretic subgroups such as F ..."
Abstract
 Add to MetaCart
(Show Context)
this paper we introduce a new approach to this theory and theoretical results that yield practical methods to compute formation theoretic subgroups such as F