Yannick Saouter
Abstract
This article is devoted to describing heuristics to improve the efficiency of Cannon's algorithm. As an application, the method is used to derive a new presentation for the Lyons sporadic group.
- J. Cannon. Construction of defining relators for finite groups. Discr. Math., (5):105--129, 1973.Google Scholar
- V. Gebhardt. Two short presentations for the Lyons sporadic simple group. Exp. Math., 9(3):333--338, 2000.Google ScholarCross Ref
- R. Lyons. Evidence for a new finite simple group. J. Algebra, (20):540--569, 1972.Google ScholarCross Ref
- C. Parker. Generators and relations for the Lyons sporadic simple group. Arch. der Math., (78):97--103, 2002.Google Scholar
Index Terms
- Heuristics for cannon's algorithm with an application to lyons sporadic group
Recommendations
A generalized constructive algorithm using insertion-based heuristics
In this paper, a generalized constructive algorithm referred to as GCA is presented which makes it possible to select a wide variety of heuristics just by the selection of its arguments values. A general framework for generating permutations of integers ...
Randomized heuristics for the Capacitated Clustering Problem
In this paper, we investigate the adaptation of the Greedy Randomized Adaptive Search Procedure (GRASP) and Iterated Greedy methodologies to the Capacitated Clustering Problem (CCP). In particular, we focus on the effect of the balance between ...
Hybridising heuristics within an estimation distribution algorithm for examination timetabling
This paper presents a hybrid hyper-heuristic approach based on estimation distribution algorithms. The main motivation is to raise the level of generality for search methodologies. The objective of the hyper-heuristic is to produce solutions of ...
Comments