5:00 PM - 6:00 PM
We examine a class of algebras generalizing the game of Rock-Paper-Scissors. We give a numerical constraint on the arity and order of such algebras by using a result on binomial coefficients communicated by Erdos. This constraint is sharp in the sense that such algebras always exist when our condition is satisfied. For each valid arity and order we produce such an algebra by using a cyclic group action. Time permitting we will give some elementary algebraic and geometric properties of the class.
Event contact: george dot grell at rochester dot edu