Efficient Enumeration of Higher Order Algebraic Structures

Algebraic structures are widely studied mathematical structures in abstract algebra. Enumerating higher order algebraic structures is a computationally intensive task due to large number of possible permutations and the presence of many symmetrically equivalent redundant structures. This paper describes a comprehensive methodology and a novel algorithm to efficiently enumerate higher order algebraic structures. Enumeration of these structures is performed in two steps, namely: generation of complete set of algebraic structures with given constraints, and then computationally demanding task of performing isomorphism checking to identify isomorphism classes. In this paper we choose to study inverse property loops (IP loops), a particular class of algebraic structures, but the methodology can be applied to enumerate any algebraic structure with given constraints. IP loop constraints are modeled in Google’s or-tools constraint solver to generate the complete set of IP loops of given order. The paper then discusses and evaluates several techniques to efficiently identify isomorphism classes within these algebraic structures. A novel algorithm is proposed that utilizes valid mappings and a tree data structure for efficient isomorphism checking. The algebraic structures are also modeled as color graphs and isomorphism classes are determined using state of the art graph isomorphism checking tool (nauty). The performance of these proposed isomorphism checking approaches is then evaluated using a diverse set of algebraic structure problems. It also presents an efficient use of multi-core systems to further enhance the efficiency of isomorphism checking. The proposed approach was then used to solve the previously computationally unsolved problem of determining isomorphism classes of exponent 3 IP loops of order 15.

[1]  Warwick Harvey,et al.  Groups and Constraints: Symmetry Breaking during Search , 2002, CP.

[2]  Rory A. Fisher,et al.  The 6 × 6 Latin squares , 1934, Mathematical Proceedings of the Cambridge Philosophical Society.

[3]  John Wesley Brown,et al.  Enumeration of latin squares with application to order 8 , 1968 .

[4]  John Slaney,et al.  Counting loops with the inverse property , 2008 .

[5]  B. Bagchi,et al.  Latin squares , 2012 .

[6]  Brendan D. McKay,et al.  Latin Squares of Order 10 , 1995, Electron. J. Comb..

[7]  Lars Hedrich,et al.  Fast isomorphism testing for a graph-based analog circuit synthesis framework , 2012, 2012 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[8]  Keith Hermiston.  The Largest Critical Sets of Latin Squares , 2019, 2019 53rd Annual Conference on Information Sciences and Systems (CISS).

[9]  Majid Ali Khan,et al.  A mining-based approach for efficient enumeration of algebraic structures , 2016, 2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA).

[10]  Peng Wang,et al.  Majority Logic Synthesis Based on Nauty Algorithm , 2014, Field-Coupled Nanocomputing.

[11]  Tim Boykett,et al.  Efficient exhaustive listings of reversible one dimensional cellular automata , 2004, Theor. Comput. Sci..

[12]  Stanley E. Bammel,et al.  The number of 9 × 9 latin squares , 1975, Discrete Mathematics.

[13]  S. M. Jacob.  The Enumeration of the Latin Rectangle of Depth Three by Means of a Formula of Reduction, with other Theorems Relating to Non‐Clashing Substitutions and Latin Squares , 2022 .

[14]  Brendan D. McKay,et al.  Practical graph isomorphism, II , 2013, J. Symb. Comput..

[15]  Abhishek Parakh,et al.  An Efficient Quasigroup Block Cipher , 2012, Wireless Personal Communications.

[16]  Yun Wei Li,et al.  Isomorphic Relationships Between Voltage-Source and Current-Source Converters , 2019, IEEE Transactions on Power Electronics.

[17]  Matthias Rarey,et al.  Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review , 2011 .

[18]  V. Rosenfeld.  Looking into the future of molecules with novel topological symmetries , 2019, Journal of Mathematical Chemistry.

[19]  Ian P. Gent,et al.  Symmetry breaking during search in constraint programming , 1999 .

[20]  Mark B. Wells,et al.  The number of latin squares of order eight , 1967 .

[21]  B. McKay,et al.  Small latin squares, quasigroups, and loops , 2007 .

[22]  J. Dénes,et al.  Latin squares and their applications , 1974 .

[23]  H. W. Norton.  THE 7 × 7 SQUARES , 1939 .