Evolutionary algorithm in group theory

Li-Tien Wang; Peter J. Angeline

doi:10.1117/12.458719

11 March 2002 Evolutionary algorithm in group theory

Li-Tien Wang, Peter J. Angeline

Proceedings Volume 4739, Applications and Science of Computational Intelligence V; (2002) https://doi.org/10.1117/12.458719
Event: AeroSense 2002, 2002, Orlando, FL, United States

Abstract

In ths study of group theory, coset enumeration is a major technique for determining the order of finitely presented groups. ACE is an important computer implemented coset enumeration system. It provides a wide choice of parameter settings, which can derive different strategies for enumeration. In this paper, an evolutionary algorithm is used to optimize parameter settings for ACE to discover better enumerations for several classic groups. The results show that the evolutionary algorithm discovers ACE parameter settings that construct previously unknown enumerations that are more optimal than enumerations discovered by hand or using brute-force search techniques.

Citation Download Citation

Li-Tien Wang and Peter J. Angeline "Evolutionary algorithm in group theory", Proc. SPIE 4739, Applications and Science of Computational Intelligence V, (11 March 2002); https://doi.org/10.1117/12.458719

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available