Finding groups of a given order - or at least trying. Optimally before the universe ends.

Sebastian Kreisel f3b7e2e394 Remove emacs save-file 9 months ago
src f3b7e2e394 Remove emacs save-file 9 months ago
test 27c1d48d04 Remove cpp and haskell implementation 9 months ago
.gitignore f3b7e2e394 Remove emacs save-file 9 months ago
LICENSE fac149c34e yep 2 years ago
Makefile 27c1d48d04 Remove cpp and haskell implementation 9 months ago
README.md db45862938 Add implementation of Sn and lots of utility; small fixes 1 year ago
TODO.org 27c1d48d04 Remove cpp and haskell implementation 9 months ago

README.md

Asocgen

I want to re-discover groups of finite order. For that I need to find associative structures. So here I am searching for them in not haskell (well turns out C is better for this job).

Questions

  • Are there configurations of incomplete tables which are incomplete associative but will never lead to a complete associative table?
  • Schemes where we try to keep to number of allowed symbols to a minimum, ie. not just increasing with UP but picking from a minimal list of symbols to help associativity detection.