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: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
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20240402T121500
DTEND;TZID=America/Los_Angeles:20240402T131000
DTSTAMP:20260405T164513
CREATED:20231024T210058Z
LAST-MODIFIED:20240326T205224Z
UID:3301-1712060100-1712063400@colleges.claremont.edu
SUMMARY:Well-rounded lattices and security: what we (don't) know (Camilla Hollanti\, Aalto University\, Finland)
DESCRIPTION:I will give a brief introduction to well-rounded lattices and to their utility in wireless communications and post-quantum security. We will see how the lattice theta series naturally arises in these contexts and discuss its connections to well-rounded lattices. The talk is based on joint work with Laia Amoros\, Amaro Barreal\, Taoufiq Damir\, Oliver Gnilke\, David Karpuk\, Alex Karrila\, Niklas Miller\, and Ha Tran.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-camilla-hollanti-aalto-university-finland/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20240409T121500
DTEND;TZID=America/Los_Angeles:20240409T131000
DTSTAMP:20260405T164513
CREATED:20240328T182316Z
LAST-MODIFIED:20240330T202911Z
UID:3421-1712664900-1712668200@colleges.claremont.edu
SUMMARY:Building TOWARD Geometry: Truncated Octahedra work as Rhombic Dodecahedra (Peter Kagey\, HMC)
DESCRIPTION:In late March\, students\, staff\, and faculty were invited to help collaboratively build a large-scale geometric sculpture on the campus of Harvey Mudd College\, demonstrating a relationship between truncated octahedra and rhombic dodecahedra\, which are two examples of space-filling polyhedra. I’ll talk about the process of designing and building the sculpture\, some geometry and combinatorics underlying the construction\, and some discoveries we made along the way.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-peter-kagey-hmc-2/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20240416T121500
DTEND;TZID=America/Los_Angeles:20240416T131000
DTSTAMP:20260405T164513
CREATED:20240324T220030Z
LAST-MODIFIED:20240326T015954Z
UID:3416-1713269700-1713273000@colleges.claremont.edu
SUMMARY:Primitive elements in number fields and Diophantine avoidance (Lenny Fukshansky\, CMC)
DESCRIPTION:The famous primitive element theorem states that every number field K is of the form Q(a) for some element a in K\, called a primitive element. In fact\, it is clear from the proof of this theorem that not only there are infinitely many such primitive elements in K\, but in fact most elements in K are primitive. This observation raises the question about finding a primitive element of small “size”\, where the standard way of measuring size is with the use of a height function. We discuss some conjectures and known results in this direction\, as well as some of our recent work on a variation of this problem which includes some additional avoidance conditions. Joint work with Sehun Jeong (CGU).
URL:https://colleges.claremont.edu/ccms/event/primitive-elements-in-number-fields-and-diophantine-avoidance-lenny-fukshansky-cmc/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20240423T121500
DTEND;TZID=America/Los_Angeles:20240423T131000
DTSTAMP:20260405T164513
CREATED:20240326T205445Z
LAST-MODIFIED:20240326T205445Z
UID:3419-1713874500-1713877800@colleges.claremont.edu
SUMMARY:Clocks\, parking garages\, and the solvability of the quintic: a friendly introduction to monodromy (Edray Goins\, Pomona College)
DESCRIPTION:Imagine the hands on a clock.  For every complete the minute hand makes\, the seconds hand makes 60\, while the hour hand only goes one twelfth of the way.   We may think of the hour hand as generating a group such that when we “move” twelve times then we get back to where we started.  This is the elementary concept of a monodromy group. In this talk\, we give a gentle introduction to a historical mathematical concept which relates calculus\, linear algebra\, differential equations\, and group theory into one neat theory called “monodromy”.  We explore lots of real world applications\, including why it’s so easy to get lost in parking garages\, and present some open problems in the field.  We end the talk with a discussion of how this is all related to solving polynomial equations\, such as Abel’s famous theorem on the insolubility of the quintic by radicals.
URL:https://colleges.claremont.edu/ccms/event/clocks-parking-garages-and-the-solvability-of-the-quintic-a-friendly-introduction-to-monodromy-edray-goins-pomona-college/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20240430T121500
DTEND;TZID=America/Los_Angeles:20240430T131000
DTSTAMP:20260405T164513
CREATED:20240212T222657Z
LAST-MODIFIED:20240424T225203Z
UID:3383-1714479300-1714482600@colleges.claremont.edu
SUMMARY:Negligible cohomology (Matthew Gherman\, Caltech)
DESCRIPTION:For a finite group G\, a G-module M\, and a field F\, an element u in H^d(G\,M) is negligible over F if for each field extension L/F and every continuous group homomorphism from Gal(L^{sep}/L) to G\, u is in the kernel of the induced homomorphism H^d(G\,M) to H^d(L\,M). Negligible cohomology was first introduced by Serre and has deep connections with the embedding problem\, cohomological invariants\, and the profinite inverse Galois problem. Professor Alexander Merkurjev (UCLA) and I were able to compute negligible cohomology in degree 2\, compute the mod p negligible cohomology of elementary abelian p-groups\, and determine the Krull dimension of the quotient of mod p cohomology by the ideal of negligible elements.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-matthew-gherman-cal-tech/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
END:VCALENDAR