One d reps of groups , per Turing almost exactly


This is the second paper with modern presentation of two of the argumentation devices Turing used in on permutations. First we finally understand the why of wanting to establish that the math power of d generator is always positive 1. And second, we see why his lemma a is concerned with a power of four.

See paper for other examples of both argumentation devices.

About home_pw

Computer Programmer who often does network administration with focus on security servers. Sometimes plays at slot machine programming.
This entry was posted in coding theory. Bookmark the permalink.