https://github.com/oantolin/ternary-afcom

Computational exploration of the ternary relation AC(x,y,z) <=> [x^-1 y, x^-1 z]=1 on groups
https://github.com/oantolin/ternary-afcom

Last synced: 12 days ago
JSON representation

Computational exploration of the ternary relation AC(x,y,z) <=> [x^-1 y, x^-1 z]=1 on groups

• Host: GitHub
• URL: https://github.com/oantolin/ternary-afcom
• Owner: oantolin
• Created: 2021-12-09T01:58:24.000Z (about 3 years ago)
• Default Branch: master
• Last Pushed: 2024-04-07T06:15:38.000Z (9 months ago)
• Last Synced: 2024-05-01T14:14:01.551Z (8 months ago)
• Language: Common Lisp
• Size: 13.7 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.org

Awesome Lists containing this project

README

        
Library for computational exploration of the ternary relation on a

group /G/ given by (x,y,z) ∈ AC(/G/) ⇔ [x⁻¹y, x⁻¹z] = 1.

To deal with groups we use the [[https://github.com/stylewarning/cl-permutation][cl-permutation]] library, so all groups

must be given via a permutation representation.

Currently there are functions to explore which ternary relations are

induced by AC(/G/) on subsets of /G/ of a given size /k/. To determine

whether two relation are isomorphic we canonicalize them by taking the

lexicographically minimal representation among its orbit under the

action of the symmetric group. This seems fast enough for small /k/.