Cayley

An introduction to the Group Theory Language, Cayley. CAYLEY is a high level programming language which has been developed by the author to allow easy access to a collectionn of algorithms for doing calculations in groups and related structures. This paper gives a useful introduction to the language. There is a description of some of the features of the language and there are lists of some of the algorithms it incorporates. Four sample CAYLEY programs are given: a test for nonregularity of groups of prime-power order; a test for simplicity of finite groups; calculation of transfer; calculation of a presentation of a knot group. CAYLEY is easy and comfortable to use. As the sample programs show, novel approaches may be needed to use it efficiently.

This software is also peer reviewed by journal TOMS.


References in zbMATH (referenced in 131 articles , 2 standard articles )

Showing results 1 to 20 of 131.
Sorted by year (citations)

1 2 3 ... 5 6 7 next

  1. Abdollahi, Alireza; Rahmani, Nafiseh: Automorphism groups of 2-groups of coclass at most 3 (2020)
  2. Prins, Abraham Love; Monaledi, Ramotjaki Lucky: Fischer-Clifford matrices and character table of the maximal subgroup ((2^9 :(L_3(4)) : 2) of (U_6(2) : 2) (2019)
  3. Fray, R. L.; Monaledi, R. L.; Prins, A. L.: Fischer-Clifford matrices of (2^8:(U_4(2):2)) as a subgroup of (O_10^+(2)) (2016)
  4. Shabani-Attar, M.: On equality of order of a finite (p)-group and order of its automorphism group. (2015)
  5. Prins, A. L.; Fray, R. L.: The Fischer-Clifford matrices of an extension group of the form (2^7:(2^5:S_6)). (2014)
  6. De Vos, Alexis: Reversible computing. Fundamentals, quantum computing, and applications. (2010)
  7. Kilford, L. J. P.: Modular forms. A classical and computational introduction (2008)
  8. Helleloid, Geir T.; Martin, Ursula: The automorphism group of a finite (p)-group is almost always a (p)-group. (2007)
  9. Roney-Dougal, Colva M.: The primitive permutation groups of degree less than 2500. (2005)
  10. Everitt, Brent: 3-manifolds from Platonic solids. (2004)
  11. Cannon, John J.; Holt, Derek F.: Automorphism group computation and isomorphism testing in finite groups (2003)
  12. Gottschalk, Harald; Leemans, Dimitri: Geometries for the group PSL((3,4)) (2003)
  13. Özkan, Engin; Aydın, Hüseyin; Dikici, Ramazan: Applications of Fibonacci sequences in a finite nilpotent group. (2003)
  14. Roney-Dougal, Colva M.; Unger, William R.: The affine primitive permutation groups of degree less than 1000. (2003)
  15. Lomonaco jun., Samuel J.; Kauffman, Louis H.: Quantum hidden subgroup algorithms: a mathematical perspective (2002)
  16. Gollan, Holger W.: A new existence proof for (Ly), the sporadic simple group of R. Lyons (2001)
  17. Breuer, Thomas: Characters and automorphism groups of compact Riemann surfaces (2000)
  18. May, Coy L.; Zimmerman, Jay: Groups of small strong symmetric genus (2000)
  19. Otto, Friedrich: A survey on the computational power of some classes of finite monoid presentations (2000)
  20. Rossmanith, Richard: Lie centre-by-metabelian group algebras in even characteristic. II (2000)

1 2 3 ... 5 6 7 next