On April 23, 2013, I gave two talks at the University of Nebraska at Omaha. The first talk was part of the Cool Math Talk Series and was titled “Impartial games for generating groups.” Here is the abstract.

Loosely speaking, a group is a set together with an associative binary operation that satisfies a few modest conditions: the “product” of any two elements from the set is an element of the set (closure), there exists a “do nothing” element (identity), and for every element in the set, there exists another element in the set that “undoes” the original (inverses). Let $G$ be a finite group. Given a single element from $G$, we can create new elements of the group by raising the element to various powers. Given two elements, we have even more options for creating new elements by combining powers of the two elements. Since $G$ is finite, some finite number of elements will “generate” all of $G$. In the game DO GENERATE, two players alternately select elements from $G$. At each stage, a group is generated by the previously selected elements. The winner is the player that generates all of $G$. There is an alternate version of the game called DO NOT GENERATE in which the loser is the player that generates all of $G$. In this talk, we will explore both games and discuss winning strategies. Time permitting, we may also relay some current research related to both games.

The content of the talk falls into the category of combinatorial game theory, which is a topic that is fairly new to me. The idea of the talk is inspired by a research project that I recently started working on with Nandor Sieben who is a colleague of mine at NAU. In particular, Nandor are working on computing the nimbers for GENERATE and DO NOT GENERATE for various families of groups. If all goes according to plan, we’ll have all the details sorted out and a paper written by the end of the summer.

After a brief introduction to combinatorial game theory and impartial games, I discussed both normal and misère play for three impartial games: Nim, X-Only Tic-Tac-Toe, and GENERATE. You might think that X-Only Tic-Tac-Toe is rather boring, but the misère version, called Notakto (clever name, right?) is really interesting. In fact, there is a free iPad game that you can download if you want to try it out. Also, if you want to know more about the mathematics behind Notakto, check out The Secrets of Notakto: Winning at X-only Tic-Tac-Toe by Thane Plambeck and Greg Whitehead.

Here are the slides for my talk.

Immediately after giving the Cool Math Talk, I facilitated a 2-hour Math Teachers’ Circle as part of the Omaha Area MTC. The audience for the MTC mostly consisted of middle and high school mathematics teachers. The theme for the circle was the same as the Cool Math Talk, but instead of me talking the whole time, the teachers played the games and attempted to develop winning strategies.

This was my second time running a MTC at UNO. In February of 2012, I ran a circle whose general topic was permutation puzzles. You can find the slides from last year’s circle here.

Both talks were a lot of fun (especially the MTC). Thanks to Angie Hodge for inviting me out to give the talks.


Dana C. Ernst

Mathematics & Teaching

  Northern Arizona University
  Flagstaff, AZ
  Website
  928.523.6852
  Twitter
  Instagram
  GitHub
  arXiv
  ResearchGate
  Academia.edu
  Mendeley
  Google Scholar
  Impact Story
  ORCID

Current Courses

  MAT 220: Math Reasoning
  MAT 411: Abstract Algebra

About This Site

  This website was created using GitHub Pages and Jekyll together with Twitter Bootstrap.

  Unless stated otherwise, content on this site is licensed under a Creative Commons Attribution-Share Alike 4.0 International License.

  The views expressed on this site are my own and are not necessarily shared by my employer Northern Arizona University.

  The source code is on GitHub.