BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Claremont Center for the Mathematical Sciences - ECPv6.15.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://colleges.claremont.edu/ccms
X-WR-CALDESC:Events for Claremont Center for the Mathematical Sciences
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20210314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20211107T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20220313T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20221106T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20230312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20231105T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220214T161500
DTEND;TZID=America/Los_Angeles:20220214T171500
DTSTAMP:20260416T040547
CREATED:20220125T182526Z
LAST-MODIFIED:20220125T182526Z
UID:2560-1644855300-1644858900@colleges.claremont.edu
SUMMARY:Applied Math Seminar -- Project Pitch Day
DESCRIPTION:
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-project-pitch-day/
LOCATION:Emmy Noether Room\, Estella 1021\, Pomona College\,\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Applied Math Seminar
ORGANIZER;CN="Heather Zinn Brooks":MAILTO:hzinnbrooks@g.hmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220215T123000
DTEND;TZID=America/Los_Angeles:20220215T132000
DTSTAMP:20260416T040547
CREATED:20220119T153839Z
LAST-MODIFIED:20220210T023821Z
UID:2540-1644928200-1644931200@colleges.claremont.edu
SUMMARY:Recent trends in using representations in voting theory - committees and cyclic orders (Karl-Dieter Crisman\, Gordon College)
DESCRIPTION:One of the most important axioms in analyzing voting systems is that of “neutrality”\, which stipulates that the system should treat all candidates symmetrically. Even though this doesn’t always directly apply (such as in primary systems or those with intentional incumbent protection)\, it is extremely important both in theory and practice.If the voting systems in question additionally are tabulated using some sort of points\, we can translate the notion of neutrality into invariance under an action of the symmetric group on a vector space. This means we can exploit representation theory to analyze them\, and this has been successfully done in a number of social choice contexts from cooperative games to voting on full rankings.In this talk\, we describe recent progress in extending this technique to two interesting situations. First we consider work of Barcelo et al. on voting for committees of representatives (such as for departments in a college)\, where the wreath product of two symmetric groups comes into play. Then we look at work by Crisman et al. regarding voting on “cyclic orders”\, or ways to seat people around a table\, which implicitly has both left and right actions of the symmetric group to consider.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-karl-dieter-crisman-gordon-college/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220215T150000
DTEND;TZID=America/Los_Angeles:20220215T160000
DTSTAMP:20260416T040547
CREATED:20230913T075335Z
LAST-MODIFIED:20230913T075335Z
UID:3225-1644937200-1644940800@colleges.claremont.edu
SUMMARY:On Invariants for Surface-Links in Entropic Magmas via Marked Graph Diagrams (Seonmi Choi\, Kyungpook Natl U\, Korea)
DESCRIPTION:M. Niebrzydowski and J. H. Przytycki defined a Kauffman bracket magma and constructed the invariant P of framed links in 3-space. The invariant is closely related to the Kauffman bracket polynomial. The normalized bracket polynomial is obtained from the Kauffman bracket polynomial by the multiplication of indeterminate and it is an ambient isotopy invariant for links. In this talk\, we reformulate the multiplication by using a map from the set of framed links to a Kauffman bracket magma in order that P is invariant for links in 3-space. We define a generalization of a Kauffman bracket magma\, which is called a marked Kauffman bracket magma. We find the conditions to be invariant under Yoshikawa moves except the first one and use a map from the set of admissible marked graph diagrams to a marked Kauffman bracket magma to obtain the invariant for surface-links in 4-space.
URL:https://colleges.claremont.edu/ccms/event/on-invariants-for-surface-links-in-entropic-magmas-via-marked-graph-diagrams-seonmi-choi-kyungpook-natl-u-korea/
LOCATION:Zoom
CATEGORIES:Topology Seminar
ORGANIZER;CN="Sam Nelson":MAILTO:snelson@cmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220216T161500
DTEND;TZID=America/Los_Angeles:20220216T173000
DTSTAMP:20260416T040547
CREATED:20220128T164956Z
LAST-MODIFIED:20220214T180454Z
UID:2577-1645028100-1645032600@colleges.claremont.edu
SUMMARY:Solving the Race in Backgammon (Prof. Arthur Benjamin)
DESCRIPTION:Title: Solving the Race in Backgammon\n \nSpeaker: Prof. Arthur Benjamin\nSmallwood Family Professor of Mathematics\nHarvey Mudd College\n \nAbstract: Backgammon is perhaps the oldest game that is still played today. It is a game that combines luck with skill\, where two players take turns rolling dice and decide how to move their checkers in the best possible way. It is the ultimate math game\, where players who possess a little bit of mathematical knowledge can have a big advantage over their opponents.  Players also have the opportunity to double the stakes of a game using something called the doubling cube\, which—when used optimally—leads to players winning more in the long run. Optimal use of the doubling cube relies on a player’s ability to estimate their winning chances at any stage of the game.\n\nWhen played to completion\, every game of backgammon eventually becomes a race\, where each player attempts to remove all of their checkers before their opponent does. The goal of our research is to be able to determine the optimal doubling cube action for any racing position\, and approximate the game winning chances for both sides. By calculating the Effective Pip Count for both players and identifying the positions’ Variance Types\, we arrive at a reasonably simple method for achieving this which is demonstrably superior to other popular methods.\n\n\n\n\nArthur Benjamin\, PhD\, Smallwood Family Professor of Mathematics\, is recognized nationally for his ability to perform rapid mental calculations. In 2020 he won the inaugural American Backgammon Tour Online (ABTO) with the best overall performance in a series of 17 national tournaments.  He has published several books on how to make math both fun and easy.  He is also a professional mathemagician and frequently performs at the Magic Castle in Hollywood and nationwide.
URL:https://colleges.claremont.edu/ccms/event/solving-the-race-in-backgammon-prof-arthur-benjamin/
LOCATION:Zoom meeting\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Andrew Bernoff":MAILTO:ajb@hmc.edu
END:VEVENT
END:VCALENDAR