* [[Start|Home]] * [[Possible Outlines]] * [[playground:Playground]] * [[Needs Review]] * [[sidebar|Edit The Sidebar]]
User Tools
Sidebar
ben_s_outline
This is an old revision of the document!
I plan to have multiple threads running simultaneously through the semester. However, for development purposes, it will probably be easiest to organize them into sections. I'm hoping to grab a lot of ideas about combinatorial games from Dana. I'm not sure what you are planning Josh, but I hope to see it soon.
Miscellaneous
Cryptography
We'll start with a simple cryptosystem that involves shifting. Then advance to matrix encryption, then matrix modular encryption. This gets to GL(n,m) really fast, and introduces homomorphisms via the determinant map, and isomorphisms between U(p-1) and Z(p) for prime p. I want to get to homomorphisms quickly, as I want to introduce the concepts of factor groups, normal groups, cosets, and more, from the context of homomorphisms.
- Simple Shift on 26 letters - Introduces Modular arithmetic
- The Order of a Simple Shift - Introduces the fact that the order of an element divides the order of a group. This comes from
Cayley Graphs
Combinatorial Games
Fundamental Theorems
Definitions
ben_s_outline.1376020549.txt.gz ยท Last modified: 2013/08/08 23:55 by bmwoodruff
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
