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: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
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20240310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20241103T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20230905T121500
DTEND;TZID=America/Los_Angeles:20230905T130500
DTSTAMP:20260405T045021
CREATED:20230415T215315Z
LAST-MODIFIED:20230830T150027Z
UID:3129-1693916100-1693919100@colleges.claremont.edu
SUMMARY:Quantum money from Brandt operators (Shahed Sharif\, CSU San Marcos)
DESCRIPTION:Public key quantum money is a replacement for paper money which has cryptographic guarantees against counterfeiting. We propose a new idea for public key quantum money. In the abstract sense\, our bills are encoded as a joint eigenstate of a fixed system of commuting unitary operators. We show that the proposal is secure against black box attacks. In order to instantiate this protocol\, one needs to find a cryptographically complicated system of computable\, commuting\, unitary operators. To fill this need\, we propose using Brandt operators\, which have a beautiful tripartite formulation. No prior knowledge of quantum computers is necessary for this talk! This is joint work with Daniel Kane and Alice Silverberg.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-shahed-sharif-csu-san-marcos/
LOCATION:Roberts North 102\, CMC
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20230912T121500
DTEND;TZID=America/Los_Angeles:20230912T131000
DTSTAMP:20260405T045021
CREATED:20230824T161426Z
LAST-MODIFIED:20230824T161426Z
UID:3146-1694520900-1694524200@colleges.claremont.edu
SUMMARY:Numerical semigroups\, minimal presentations\, and posets (Chris O'Neill\, SDSU)
DESCRIPTION:A numerical semigroup is a subset S of the natural numbers that is closed under addition.  One of the primary attributes of interest in commutative algebra are the relations (or trades) between the generators of S; any particular choice of minimal trades is called a minimal presentation of S (this is equivalent to choosing a minimal binomial generating set for the defining toric ideal of S).  In this talk\, we present a method of constructing a minimal presentation of S from a portion of its divisibility poset.  Time permitting\, we will explore connections to polyhedral geometry.\n\nNo familiarity with numerical semigroups or toric ideals will be assumed for this talk.
URL:https://colleges.claremont.edu/ccms/event/numerical-semigroups-minimal-presentations-and-posets-chris-oneill-sdsu/
LOCATION:Roberts North 102\, CMC
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20230919T121500
DTEND;TZID=America/Los_Angeles:20230919T131000
DTSTAMP:20260405T045021
CREATED:20230830T200520Z
LAST-MODIFIED:20230830T203839Z
UID:3165-1695125700-1695129000@colleges.claremont.edu
SUMMARY:Biquandle power brackets (Sam Nelson\, CMC)
DESCRIPTION:Biquandle brackets are skein invariants of biquandle-colored knots\, with skein coefficients that are functions of the colors at a crossing. Biquandle power brackets take this idea a step further with state component values that also depend on biquandle colors. This is joint work with Neslihan Gügümcü (IYTE).
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-sam-nelson-cmc-2/
LOCATION:Roberts North 102\, CMC
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20230926T121500
DTEND;TZID=America/Los_Angeles:20230926T131000
DTSTAMP:20260405T045021
CREATED:20230828T163632Z
LAST-MODIFIED:20230828T211001Z
UID:3153-1695730500-1695733800@colleges.claremont.edu
SUMMARY:Chromatic numbers of abelian Cayley graphs (Michael Krebs\, Cal State LA)
DESCRIPTION:A classic problem in graph theory is to find the chromatic number of a given graph: that is\, to find the smallest number of colors needed to assign every vertex a color such that whenever two vertices are adjacent\, they receive different colors.  This problem has been studied for many families of graphs\, including cube-like graphs\, unit-distance graphs\, circulant graphs\, integer distance graphs\, Paley graphs\, unit-quadrance graphs\, etc.  All of those examples just listed can be regarded as “abelian Cayley graphs\,” that is\, Cayley graphs whose underlying group is abelian.  Our goal is to create a unified\, systematic approach for dealing with problems of this sort\, rather than attacking each individually with ad hoc methods.  Building upon the work of Heuberger\, we associate an integer matrix to each abelian Cayley graph.  In certain cases\, such as when the matrix is small enough\, we can more or less read the chromatic number directly from the entries of the matrix.  In this way we immediately recover both Payan’s theorem (that cubelike graphs cannot have chromatic number 4) as well as Zhu’s theorem (which determines the chromatic number of six-valent integer distance graphs).  The proofs utilize only elementary group theory\, elementary graph theory\, elementary number theory\, and elementary linear algebra.  This is joint work with J. Cervantes.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-michael-krebs-cal-state-la/
LOCATION:Roberts North 102\, CMC
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
END:VCALENDAR