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: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:20221128T161500
DTEND;TZID=America/Los_Angeles:20221128T171500
DTSTAMP:20260510T125933
CREATED:20220920T153253Z
LAST-MODIFIED:20221122T174526Z
UID:2939-1669652100-1669655700@colleges.claremont.edu
SUMMARY:Applied Math Seminar: Juergen Kritschgau (Carnegie Mellon)
DESCRIPTION:Title: Using Mutual Information of Hypergraph Compressions for Clustering\n\nAbstract: Hypergraphs are often used to represent higher order observed relationships between subjects of study. In particular\, the vertices of a hypergraph could represent the basic elements of study\, and edges represent observed relationships between the vertices. Implicitly\, the assumption is that observed edges are more (or less) likely to appear between vertices that are “similar”. Therefore\, an important question in data science is whether the edges of a hypergraph can be used to recover ground truth vertex labels where two vertices receive the same label if they are similar. This is known as the clustering problem. In this talk\, we will discuss how mutual information of hypergraph compressions can be used to cluster hypergraphs\, and apply this clustering strategy to synthetic and real world data sets.
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-juergen-kritschgau-carnegie-mellon/
LOCATION:Shanahan 2407 at Harvey Mudd College\, 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:20221129T122500
DTEND;TZID=America/Los_Angeles:20221129T131500
DTSTAMP:20260510T125933
CREATED:20221110T030247Z
LAST-MODIFIED:20221124T032038Z
UID:2989-1669724700-1669727700@colleges.claremont.edu
SUMMARY:Partial orders on standard Young tableaux( Gizem Karaali\, Pomona)
DESCRIPTION:Young diagrams are all possible arrangements of n boxes into rows and columns\, with the number of boxes in each subsequent row weakly decreasing. For a partition λ of n\, a standard Young tableau S of shape λ is built from the Young diagram of shape λ by filling it with the numbers 1 to n\, each occurring exactly once in such a way that the numbers are strictly increasing across rows (left to right) and down columns. Young diagrams with n cells are in one-to-one correspondence with the irreducible representations of the symmetric group Sn\,; the standard Young tableaux count the dimensions of these irreps and thus are some of the most essential objects of combinatorial representation theory and algebraic combinatorics. In this talk\, based on joint work with Isabella Senturia (PO’20) and Müge Taskin\, I will describe a handful of partial orders already defined on SYTn\, the set of all standard Young tableaux with n cells\, and propose a new one.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-gizem-karaali-pomona-2/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20221130T161500
DTEND;TZID=America/Los_Angeles:20221130T173000
DTSTAMP:20260510T125933
CREATED:20220912T190237Z
LAST-MODIFIED:20220912T190237Z
UID:2914-1669824900-1669829400@colleges.claremont.edu
SUMMARY:Prof. Jack Wesley
DESCRIPTION:Speaker: Jack Wesley\, Department of Mathematics\, UC Davis
URL:https://colleges.claremont.edu/ccms/event/prof-jack-wesley/
LOCATION:Humanities Auditorium\, Scripps College\, and Zoom\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
GEO:34.1035221214;-117.709766675
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20221201T160000
DTEND;TZID=America/Los_Angeles:20221201T170000
DTSTAMP:20260510T125933
CREATED:20221128T163157Z
LAST-MODIFIED:20221128T163157Z
UID:3003-1669910400-1669914000@colleges.claremont.edu
SUMMARY:On discrete subgroups of Euclidean spaces (Lenny Fukshansky\, CMC)
DESCRIPTION:Let x_1\,…\,x_n be an overdetermined spanning set for the Euclidean space R^k\, where n > k. Let L be the integer span of these vectors. Then L is an additive subgroup of R^n. When is it discrete in R^n? Naturally\, this depends on the choice of the spanning set\, but in which way? We will review some classical results leading up to this question and then will discuss some more recent developments.
URL:https://colleges.claremont.edu/ccms/event/on-discrete-subgroups-of-euclidean-spaces-lenny-fukshansky-cmc/
LOCATION:Roberts North 105\, CMC\, 320 E. 9th St.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Analysis Seminar
ORGANIZER;CN="Asuman Aksoy":MAILTO:asuman.aksoy@claremontmckenna.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20221203T100000
DTEND;TZID=America/Los_Angeles:20221203T120000
DTSTAMP:20260510T125933
CREATED:20221027T165128Z
LAST-MODIFIED:20221027T165216Z
UID:2974-1670061600-1670068800@colleges.claremont.edu
SUMMARY:GEMS December 3rd Session
DESCRIPTION:
URL:https://colleges.claremont.edu/ccms/event/gems-december-3rd-session/
LOCATION:Shanahan 1480\, Harvey Mudd College\, 301 Platt Blvd.\, Claremont\, CA\, 91711\, United States
CATEGORIES:GEMS
END:VEVENT
END:VCALENDAR