Skip to search formSkip to main contentSkip to account menu

Computational group theory

In mathematics, computational group theory is the study ofgroups by means of computers. It is concernedwith designing and analysing algorithms… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
5 Copyright Statement 7 
2015
2015
This paper studies algorithms similar to the Gaussian elimination algorithm in symplectic and split orthogonal groups. We discuss… 
2010
2010
In this thesis, we study the first three cohomology groups of the quotients of the descending central series of a free pro-p… 
2008
2008
In the first section of this senior thesis the author provides some new efficient algorithms for calculating with finite… 
2007
2007
This paper consider the problem of generating symmetry-breaking formulas for permutation groups acting on n points, where the… 
2005
2005
Let G be a finite permutation group acting on a set Γ. A base for G is a finite sequence of elements of Γ whose pointwise… 
2002
2002
Uniform growth, actions on trees and $GL_2$ by R. C. Alperin and G. A. Noskov Centralisers of involutions in black box groups by… 
2001
2001
Computational Group Theory is applied to indexed objects (tensors, spinors, and so on) with dummy indices. There are two groups… 
1995
1995
The goal of this work is to overcome the learning barriers faced when first using parallelism. Currently, in order to parallelize… 
1993
1993
An important way for describing groups is by flnite presentations. Large presentations arise in practice which are poorly suited…