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-WR-CALNAME:Claremont Center for the Mathematical Sciences
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:20240310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20241103T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250902T121500
DTEND;TZID=America/Los_Angeles:20250902T131000
DTSTAMP:20260503T072733
CREATED:20250814T025232Z
LAST-MODIFIED:20250819T024559Z
UID:3787-1756815300-1756818600@colleges.claremont.edu
SUMMARY:Categorification of biquandle arrow weight invariants via quivers (Migiwa Sakurai\, Shibaura Institute of Technology)
DESCRIPTION:Biquandle arrow weights invariants are enhancements of the biquandle counting invariant for oriented virtual and classical knots defined from biquandle-colored Gauss diagrams using a tensor over an abelian group satisfying certain properties. In this talk\, we categorify the biquandle arrow weight polynomial invariant using biquandle coloring quivers\, obtaining new infinite families of polynomial invariants of oriented virtual and classical knots.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-migiwa-sakurai-shibaura-institute-of-technology/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250916T121500
DTEND;TZID=America/Los_Angeles:20250916T131000
DTSTAMP:20260503T072733
CREATED:20250809T192948Z
LAST-MODIFIED:20250811T173854Z
UID:3780-1758024900-1758028200@colleges.claremont.edu
SUMMARY:A non-uniformly inner amenable group (Isaac Goldbring\, UC Irvine)
DESCRIPTION:An inner amenable group is one in which there is a finitely additive conjugation-invariant probability measure on the non-identity elements.  In this talk\, we show that inner amenability is not preserved under elementary equivalence.  As a result\, we give the first example of a group that is inner amenable but not uniformly inner amenable.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-isaac-goldbring-uc-irvine/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250923T121500
DTEND;TZID=America/Los_Angeles:20250923T131000
DTSTAMP:20260503T072733
CREATED:20250811T185820Z
LAST-MODIFIED:20250813T192625Z
UID:3783-1758629700-1758633000@colleges.claremont.edu
SUMMARY:Graphical designs: combinatorics and applications (Catherine Babecki\, Caltech)
DESCRIPTION:A graphical design is a quadrature rule for a graph inspired by classical numerical integration on the sphere. Broadly speaking\, that means a graphical design is a relatively small subset of graph vertices chosen to capture the global behavior of functions from the vertex set to the real numbers. We first motivate and define graphical designs for graphs with positive edge weights. Through Gale duality\, we exhibit a combinatorial bijection between graphical designs and the faces of certain polytopes associated to a graph\, called eigenpolytopes. This polytope connection implies a variety of beautiful consequences\, including a proof of existence\, an upper bound on the cardinality of a graphical design\, methods to compute\, optimize\, and organize graphical designs\, the existence of random walks with improved convergence rates\, and complexity results for associated computational problems.  We conclude with applications to the equitable facility location problem.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-catherine-babecki-caltech/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250930T121500
DTEND;TZID=America/Los_Angeles:20250930T131000
DTSTAMP:20260503T072733
CREATED:20250927T185625Z
LAST-MODIFIED:20250927T185625Z
UID:3874-1759234500-1759237800@colleges.claremont.edu
SUMMARY:Algebraic lattices and Pisot polynomials (Lenny Fukshansky\, CMC)
DESCRIPTION:A Z-module M in a number field K gives rise to a lattice in the corresponding Euclidean space via Minkowski embedding. Such lattices often carry inherited structure from the number field in question and can be attractive from both\, theoretical and applied perspectives. We consider this construction when M is spanned by the set of roots of an irreducible polynomial f(x) of prime degree n. In this case\, the resulting lattice has rank n or n-1 and includes the Galois group of f(x) as a subgroup of its automorphism group. Of particular interest is the case of Pisot polynomials\, i.e.\, polynomials with one positive real root and the rest of the roots in the unit circle. We construct infinite families of such polynomials of any prime degree for which the resulting lattices have bases of minimal vectors\, a property of interest in coding theory and cryptography applications. In case of the Galois group being cyclic\, A_n\, or S_n we derive formulas for the determinant of the lattice in terms of the symmetric functions of the roots of f(x). This is joint work with Evelyne Knight (Pomona College).
URL:https://colleges.claremont.edu/ccms/event/algebraic-lattices-and-pisot-polynomials-lenny-fukshansky-cmc/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
END:VCALENDAR