Karl-Dieter Crisman, Gordon College

Abstract

In social choice theory there has been recent interest in voting on various combinatorial objects. One such object is cyclic orders, which may be thought of (informally) as ways of seating people around a table.

In this talk we will introduce a bit of algebraic voting theory, which profitably uses representation theory to classify (linear) voting systems. However, linear algebra can't solve every problem by itself, so we also discuss some of the patterns computer exploration discovered in investigating all possible complete ties under a particular system.

Joint work with Abraham Holleran, Micah Martin, and Josephine Noonan.

Link to video: https://vimeo.com/705910022

Presented Via Zoom: https://rutgers.zoom.us/j/94346444480

Password: 6564120420

For further information see: https://sites.math.rutgers.edu/~zeilberg/expmath/