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:20180311T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20181104T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20190310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20191103T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20200308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20201101T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190206T161500
DTEND;TZID=America/Los_Angeles:20190206T171500
DTSTAMP:20260408T025354
CREATED:20190110T154612Z
LAST-MODIFIED:20190214T061816Z
UID:1002-1549469700-1549473300@colleges.claremont.edu
SUMMARY:Algebraic and Polyhedral Perspectives on Combinatorial Neural Codes (Robert Davis\, Harvey Mudd)
DESCRIPTION:In the 1970s\, James O’Keefe and his team observed that certain neurons in the brain\, called place cells\, spike in their firing rates when the animal is in a particular physical location within its arena. If a place cell is thought of as either “active” or “silent\,” then one may represent the co-firing patterns of place cells by a combinatorial neural code: a set of 0/1 vectors whose coordinates represent that status of distinct place cells. From the code\, we can try to reconstruct a geometric picture of the neural activity by sketching a disjoint union of simple closed curves in the plane. Ideally\, each curve corresponds to a unique place cell and the interiors of the curves are convex. However\, this is not always possible\, and identifying criteria which makes this possible is a difficult problem. \nIn this talk\, we will discuss approaches to the problem of representing combinatorial neural codes using convex sets. We will see how turning the codewords into polynomials can reveal hidden information about the code\, and how this naturally leads to examining properties of related polyhedra. In particular\, we will present progress on using polyhedra to identify representability of a code with circles in the plane.
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-robert-davis-harvey-mudd/
LOCATION:Shanahan B460\, Harvey Mudd College\, 301 Platt Blvd.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Ali Nadim":MAILTO:ali.nadim@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190213T161500
DTEND;TZID=America/Los_Angeles:20190213T171500
DTSTAMP:20260408T025354
CREATED:20190110T154812Z
LAST-MODIFIED:20190213T234043Z
UID:1004-1550074500-1550078100@colleges.claremont.edu
SUMMARY:Cracking the Code: Predicting Properties of Material Fracture Networks using Machine Learning (Allon Percus\, CGU)
DESCRIPTION:Understanding how fluid flows through heterogeneous materials\, and how it can make these materials fail\, are among the hardest challenges in materials science.  Experiments and simulations show that flow through subsurface rock is mostly limited to a small subnetwork\, or backbone\, of fractures.  Identifying this backbone would allow for a large speedup in flow and transport simulations\, but the process of identifying it can itself be computationally intensive.  I will discuss a machine learning approach\, developed in a CGU Math Clinic project with Los Alamos National Laboratory\, that rapidly finds relevant subnetworks based on graph structure and training data from simulations.  Time permitting\, I will also describe a method that uses graph convolutional neural networks to predict\, with high accuracy\, how fractures grow in brittle materials.  This provides an automated approach for learning how the fractures can radiate through the material\, and ultimately cause it to fail.
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-allon-percus-cgu/
LOCATION:Shanahan B460\, Harvey Mudd College\, 301 Platt Blvd.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Ali Nadim":MAILTO:ali.nadim@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190220T161500
DTEND;TZID=America/Los_Angeles:20190220T171500
DTSTAMP:20260408T025354
CREATED:20190110T154953Z
LAST-MODIFIED:20190214T061909Z
UID:1006-1550679300-1550682900@colleges.claremont.edu
SUMMARY:Personal Perspectives on m-ary Partitions (James Sellers\, Penn State)
DESCRIPTION:Abstract:  A great deal of my research journey has involved the study of m-ary partitions.  These are integer partitions wherein each part must be a power of a fixed integer m > 1.  Beginning in the late 1960s\, numerous mathematicians (including Churchhouse\, Andrews\, Gupta\, and Rodseth) studied divisibility properties of m-ary partitions.  In this talk\, I will discuss work I completed with Rodseth which generalizes the results of Andrews and Gupta from the 1970s.  Time permitting\, I will then discuss several problems related to m-ary partitions\, including my work with Neil Sloane on non-squashing stacks of boxes\, an application of m-ary partitions to objects known as “unique path partitions” (which are motivated from representation theory of the symmetric group)\, as well as very recent work with George Andrews and Aviezri Fraenkel on the characterization of the number of m-ary partitions of n modulo m.  Throughout the talk\, I will attempt to highlight various aspects of the research related to symbolic computation.  The talk will be self-contained and geared for a general mathematical audience.
URL:https://colleges.claremont.edu/ccms/event/personal-perspectives-on-m-ary-partitions-james-sellers-penn-state/
LOCATION:Shanahan B460\, Harvey Mudd College\, 301 Platt Blvd.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Ali Nadim":MAILTO:ali.nadim@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190227T161500
DTEND;TZID=America/Los_Angeles:20190227T171500
DTSTAMP:20260408T025354
CREATED:20190204T170256Z
LAST-MODIFIED:20190204T170256Z
UID:1192-1551284100-1551287700@colleges.claremont.edu
SUMMARY:Pull Out All The Stops: Textual Analysis via Punctuation Sequences (Mason Porter\, UCLA)
DESCRIPTION:Abstract: Whether enjoying the lucid prose of a favorite author or\nslogging through some other writer’s cumbersome\, heavy-set prattle (full\nof parentheses\, em-dashes\, compound adjectives\, and Oxford commas)\,\nreaders will notice stylistic signatures not only in word choice and\ngrammar\, but also in punctuation itself. Indeed\, visual sequences of\npunctuation from different authors produce marvelously different (and\nvisually striking) sequences. Punctuation is a largely overlooked\nstylistic feature in “stylometry”\, the quantitative analysis of written\ntext. In this paper\, we examine punctuation sequences in a corpus of\nliterary documents and ask the following questions: Are the properties of\nsuch sequences a distinctive feature of different authors? Is it possible\nto distinguish literary genres based on their punctuation sequences? Do\nthe punctuation styles of authors evolve over time? Are we on to something\ninteresting in trying to do stylometry without words\, or are we full of\nsound and fury (signifying nothing)? \nFor more information\, see our recent preprint (joint work with Alexandra\nDarmon\, Marya Bazzi\, and Sam Howison):\nhttps://osf.io/preprints/socarxiv/2rzsg
URL:https://colleges.claremont.edu/ccms/event/pull-out-all-the-stops-textual-analysis-via-punctuation-sequences-mason-porter-ucla/
LOCATION:Shanahan B460\, Harvey Mudd College\, 301 Platt Blvd.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Ali Nadim":MAILTO:ali.nadim@cgu.edu
END:VEVENT
END:VCALENDAR