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:20190202T100000
DTEND;TZID=America/Los_Angeles:20190202T120000
DTSTAMP:20260404T185650
CREATED:20190115T195645Z
LAST-MODIFIED:20190115T195645Z
UID:1104-1549101600-1549108800@colleges.claremont.edu
SUMMARY:GEMS Workshop: Graph Theory\, Part I with Professor Michael Orrison\, from Harvey Mudd College
DESCRIPTION:TOPIC: Graph Theory\, Part I \nOn the surface\, graphs seem to be some of the simplest objects you might encounter in mathematics. After all\, they are made up of just two kinds of parts\, vertices and edges\, and those parts fit together in simple ways. But appearances can be deceiving! In this series of two workshops\, we’ll explore several surprising facts about graphs. Along the way\, we’ll see how graphs arise in a variety of settings\, and how they give rise to many challenging but worthwhile problems. \nWHAT IS GEMS: \nThe Gateway to Exploring Mathematics program (GEMS) is a series of workshops that helps excite the interests and curiosity of young students in mathematics and science \nGEMS meets once a month on a Saturday morning from 10:00 AM to 12:00 PM \nGEMS is designed to reach 8th\, 9th and 10th grade students who have an interest in mathematics and science \nParticipants interact with excellent and award winning faculty\, staff\, students and alumni from each of the seven Claremont Colleges \nSPRING 2019 DATES: \nFebruary 2\, 2019 \nMarch 2\, 2019 \nApril 13\, 2019 \nREGISTRATION: \nTo register for our next event on February 2\, please click on the following link: \nhttps://tinyurl.com/GEMS2019Spring1 \nANY QUESTIONS: \nPlease contact our 2018-2019 GEMS coordinator\, Elsa Harris at Elsa.Harris@cgu.edu
URL:https://colleges.claremont.edu/ccms/event/gems-workshop-graph-theory-part-i-with-professor-michael-orrison-from-harvey-mudd-college/
LOCATION:Shanahan 1480\, Harvey Mudd College\, 301 Platt Blvd.\, Claremont\, CA\, 91711\, United States
CATEGORIES:GEMS
ORGANIZER;CN="Elsa Harris":MAILTO:elsa.harris@cgu.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190204T161500
DTEND;TZID=America/Los_Angeles:20190204T171500
DTSTAMP:20260404T185650
CREATED:20181008T181051Z
LAST-MODIFIED:20190117T015941Z
UID:895-1549296900-1549300500@colleges.claremont.edu
SUMMARY:Estimating the physical location of Twitter users with the von Mises-Fisher distribution (Mike Izbicki\, UC Riverside)
DESCRIPTION:Approximately 500 million tweets are sent everyday.  Scientists monitor these tweets to predict the spread of disease\, better allocate social welfare services\, help first responders during natural disasters\, and many other important tasks.  A key step in each of these tasks is estimating the location the tweet was sent from.  In\nthis talk\, I discuss how to combine machine learning and the von Mises-Fisher distribution to estimate this location.  The von Mises-Fisher distribution is the spherical analog of the Gaussian distribution\, and this distribution lets us exploit the earth’s non-Euclidean geometry to improve estimation accuracy.
URL:https://colleges.claremont.edu/ccms/event/tba-mike-izbicki-uc-riverside/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Applied Math Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190205T121500
DTEND;TZID=America/Los_Angeles:20190205T131000
DTSTAMP:20260404T185650
CREATED:20181205T171033Z
LAST-MODIFIED:20190123T223504Z
UID:963-1549368900-1549372200@colleges.claremont.edu
SUMMARY:Lattices from group frames and vertex transitive graphs (Lenny Fukshansky\, CMC)
DESCRIPTION:Tight frames in Euclidean spaces are widely used convenient generalizations of orthonormal bases. A particularly nice class of such frames is generated as orbits under irreducible actions of finite groups of orthogonal matrices: these are called irreducible group frames. Integer spans of rational irreducible group frames form Euclidean lattices with some very nice geometric properties\, called strongly eutactic lattices. We discuss this construction\, focusing on an especially interesting infinite family in arbitrarily large dimensions\, which comes from vertex transitive graphs. We demonstrate several examples of such lattices from graphs that exhibit some rather fascinating properties. This is joint work with D. Needell\, J. Park and J. Xin.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-lenny-fukshansky-cmc/
LOCATION:Millikan 2099\, Pomona College\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190206T161500
DTEND;TZID=America/Los_Angeles:20190206T171500
DTSTAMP:20260404T185650
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:20190211T041500
DTEND;TZID=America/Los_Angeles:20190211T171500
DTSTAMP:20260404T185650
CREATED:20190129T225920Z
LAST-MODIFIED:20190214T062202Z
UID:1184-1549858500-1549905300@colleges.claremont.edu
SUMMARY:Community structure in networks: the effect of communities on a preferential attachment model and epidemic spreading (Emily Fischer\, Cornell)
DESCRIPTION:Online social networks and other networks of interest are known to exhibit community structure\, where a community is defined to be a highly interconnected group of nodes with possibly shared traits or features. However\, classic network models\, such as the preferential attachment model\, do not account for community structure. In this talk\, I will present the Community-Aware Preferential Attachment Model (CAPAM)\, which allows the user to specify community structure via edge probabilities. I will show that CAPAM retains desirable properties of the preferential attachment model\, namely a power-law degree distribution\, and further that the multivariate degree distribution is dependent upon the edge probabilities in an interesting way. I will show that community structure also plays a role in epidemic spreading processes. Under the SIS model\, the lifetime of a spreading process is constrained by the structure of the individual communities\, and the epidemic threshold is bounded closely around the threshold associated with the strongest community.
URL:https://colleges.claremont.edu/ccms/event/applied-math-talk-given-by-emily-fisher/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Applied Math Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190212T121500
DTEND;TZID=America/Los_Angeles:20190212T131000
DTSTAMP:20260404T185650
CREATED:20181227T132155Z
LAST-MODIFIED:20190120T184543Z
UID:994-1549973700-1549977000@colleges.claremont.edu
SUMMARY:Subgraph statistics (Benny Sudakov\, ETH Zurich)
DESCRIPTION:Given integers $k\,l$  and a graph $G$\, how large can be the fraction of $k$-vertex subsets of $G$ which span exactly $l$ edges?  The systematic study of this very natural  question  was recently initiated by Alon\, Hefetz\, Krivelevich and Tyomkyn who also proposed several interesting conjectures on this topic. \n\nIn this talk we discuss a theorem which proves one of their conjectures and implies an asymptotic version of another.  We also make some first steps towards analogous question for hypergraphs. Our proofs involve some Ramsey-type arguments\, and a number of different probabilistic tools\, such as polynomial anticoncentration inequalities and  hypercontractivity. \nJoint work with M. Kwan and T. Tran.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-benny-sudakov-eth-zurich/
LOCATION:Millikan 2099\, Pomona College\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190213T161500
DTEND;TZID=America/Los_Angeles:20190213T171500
DTSTAMP:20260404T185650
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:20190218T160000
DTEND;TZID=America/Los_Angeles:20190218T170000
DTSTAMP:20260404T185650
CREATED:20190214T233621Z
LAST-MODIFIED:20190214T233621Z
UID:1213-1550505600-1550509200@colleges.claremont.edu
SUMMARY:Job Talk - Nicole Fider\, UC Irvine
DESCRIPTION:Candidate for Assistant Professor in Mathematics\, Scripps College \nA surprising application of mathematics:  How to name a color \nYour brain likes patterns and categories; by grouping related ideas together\, it can store and recall information quickly.  Real-life continuous domains (like time and taste) are inherently composed of infinitely many points of information\, which your brain segments into finitely many categories for convenience (such as morning/afternoon/evening/night\, or sweet/sour/salty/bitter).  This phenomenon is well-documented and is a topic of interest in the behavioral\, cognitive\, and social sciences. \nThe set of colors is another example of a continuous domain\, which in English is segmented into categories called “blue\,” “red\,” “green\,” etc.  In this talk\, I discuss how we apply mathematics —including calculus and linear algebra—to real-world data to study the occurrence of different categorizations schemes of the color space.  I then outline several related open projects. \n  \nMonday\, February 18 \n4:00-4:50pm \nBalch 218 \nScripps College \n  \nFMI contact: ctowse@scrippscollege.edu \n 
URL:https://colleges.claremont.edu/ccms/event/job-talk-nicole-fider-uc-irvine/
LOCATION:CA
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190219T121500
DTEND;TZID=America/Los_Angeles:20190219T131000
DTSTAMP:20260404T185650
CREATED:20190123T071222Z
LAST-MODIFIED:20190203T022044Z
UID:1141-1550578500-1550581800@colleges.claremont.edu
SUMMARY:Knowledge\, strategies\, and know-how (Pavel Naumov\, CMC)
DESCRIPTION:An agent comes to a fork in a road. There is a sign that says that one of the two roads leads to prosperity and another to death. The agent must take the fork\, but she does not know which road leads where. Does the agent have a strategy to get to prosperity? On one hand\, since one of the roads leads to prosperity\, such a strategy clearly exists. On the other\, the agent does not know what the strategy is. \nIf a coalition of agents has a strategy\, it knows that it has a strategy\, and it also knows what this strategy is\, then we say that the coalition has a know-how strategy. In this talk I will discuss several of my recent papers on modal logics that describe the interplay between coalition knowledge\, strategies\, and know-how strategies.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-pavel-naumov-cmc/
LOCATION:Millikan 2099\, Pomona College\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190220T161500
DTEND;TZID=America/Los_Angeles:20190220T171500
DTSTAMP:20260404T185650
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:20190221T120000
DTEND;TZID=America/Los_Angeles:20190221T133000
DTSTAMP:20260404T185650
CREATED:20190123T234443Z
LAST-MODIFIED:20190123T234443Z
UID:1163-1550750400-1550755800@colleges.claremont.edu
SUMMARY:A nonorientable version of the Milnor Conjecture (Cornelia A. Van Cott\, USF)
DESCRIPTION:In 1968\, Milnor famously conjectured that the smooth 4-genus of the torus knot T(p\,q) is given by (p-1)(q-1)/2. This conjecture was first verified by Kronheimer and Mrowka in 1993 and has received several other proofs since then. In this talk\, we discuss a nonorientable analogue of this conjecture\, first formulated by Josh Batson. We prove the conjecture for infinite families of of torus knots\, using tools from knot Floer homology. We also connect the problem to the world of continued fractions\, which gives an alternative perspective on the problem. This is joint work with Stanislav Jabuka.
URL:https://colleges.claremont.edu/ccms/event/a-nonorientable-version-of-the-milnor-conjecture-cornelia-a-van-cott-usf/
LOCATION:Roberts North 104\, CMC\, 320 E. 9th St.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Topology Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190222T160000
DTEND;TZID=America/Los_Angeles:20190222T173000
DTSTAMP:20260404T185650
CREATED:20190219T055204Z
LAST-MODIFIED:20190513T052208Z
UID:1221-1550851200-1550856600@colleges.claremont.edu
SUMMARY:Uniform Convergence: A One-Woman Play
DESCRIPTION:Uniform Convergence is a one-woman play\, written and performed by mathematics graduate student Corrine Yap. It juxtaposes the stories of two women trying to find their place in a white male-dominated academic world. The first is of historical Russian mathematician Sofia Kovalevskaya\, who was lauded as a pioneer for women in science but only after years of struggle for recognition. Her life’s journey is told through music and movement\, in both Russian and English. The second is of a fictional Asian-American woman\, known only as “Professor”\, trying to cope with the prejudice she faces in the present. As she teaches an introductory real analysis class\, she uses mathematical concepts to draw parallels to the race and gender conflicts she encounters in society today. \nSee https://www.corrineyap.com/uniformconvergence/ for more information about the play.
URL:https://colleges.claremont.edu/ccms/event/uniform-convergence-a-one-woman-play/
LOCATION:Millikan 1051\, Pomona College\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Special Event
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190225T041500
DTEND;TZID=America/Los_Angeles:20190225T171500
DTSTAMP:20260404T185650
CREATED:20190129T230104Z
LAST-MODIFIED:20190221T190447Z
UID:1186-1551068100-1551114900@colleges.claremont.edu
SUMMARY:Applied Math Seminar: Measurement Error Modeling using Empirical Phase Functions (Prof. Cornelis Potgieter\, Southern Methodist University)
DESCRIPTION:Measurement error\, formally defined as the difference between the measured value and the true value of a quantity of interest\, is ubiquitous. When a doctor takes your blood pressure\, the instrumentation may not be properly calibrated and the reading is subject to error. When completing an online Harry Potter Sorting Hat quiz\, you may accidentally click the wrong option for a specific question and find yourself in House Slytherin!. The effect of measurement error is sometimes insignificant\, but there are instances where ignored measurement error can be rather consequential. You definitely do not want your doctor to put you on a long-term medication for managing high BP due to an erroneous measurement! \nIn this talk\, I will discuss two problems frequently encountered when measurement error is present in sampled data. The first of these is known as density deconvolution\, which involves estimating the density function of the population of interest. When measurement error is present\, a density function estimated from the sample will have inflated variance\, and interesting population features may be obscured. The second problem relates to regression modeling when the predictor variable is subject to measurement error. Here\, when using the contaminated data to estimate the regression model\, parameter estimates will be biased unless measurement error is properly adjusted for. I will show how the empirical phase functions\, a transformation of the sample data to the complex plane\, can be used to find solutions to both of these problems. \nOh\, and don’t worry too much about your doctor unnecessarily prescribing blood pressure medication. She is well aware that measurement error exists\, and will re-take the measurement\, and also perform other tests before making a diagnosis. Being sorted into House Slytherin though\, there you are on your own…
URL:https://colleges.claremont.edu/ccms/event/applied-math-talk-given-by-prof-cornelis-potgieter/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Applied Math Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190225T160000
DTEND;TZID=America/Los_Angeles:20190225T170000
DTSTAMP:20260404T185650
CREATED:20190222T005542Z
LAST-MODIFIED:20190222T005542Z
UID:1233-1551110400-1551114000@colleges.claremont.edu
SUMMARY:Job Talk - Scripps Candidate for Assistant Professor in Mathematics
DESCRIPTION:Job Talk: \nChristina Edholm\, University of Tennessee \n“Epidemiological models examining two susceptible classes” \n  \nMonday\, February 25 \n4:00-4:50pm \nBalch 218\, Scripps College
URL:https://colleges.claremont.edu/ccms/event/job-talk-scripps-candidate-for-assistant-professor-in-mathematics/
LOCATION:CA
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190226T121500
DTEND;TZID=America/Los_Angeles:20190226T131000
DTSTAMP:20260404T185650
CREATED:20190112T015039Z
LAST-MODIFIED:20190218T190711Z
UID:1047-1551183300-1551186600@colleges.claremont.edu
SUMMARY:When is the product of Siegel eigenforms an eigenform? (Jim Brown\, Occidental College)
DESCRIPTION:Modular forms are ubiquitous in modern number theory.  For instance\, showing that elliptic curves are secretly modular forms was the key to the proof of Fermat’s Last Theorem.  In addition to number theory\, modular forms show up in diverse areas such as coding theory and particle physics.  Roughly speaking\, a modular form is a complex-valued function defined on the complex upper half-plane that satisfies a large number of symmetries.  A modular form has two invariants: weight and level.  If one fixes a weight and level\, the collection of modular forms of that weight and level form a finite-dimensional complex vector space.  One has a collection of operators on these spaces referred to as Hecke operators.  A natural question is if one takes two eigenforms of these operators and multiplies them\, when is the product still an eigenform?  It was shown in independent work by Duke and Ghate that there is a finite list of pairs of eigenforms whose product is again an eigenform.  In this talk we will report on the case when one replaces modular forms with the more general case of Siegel modular forms.  This is work that was partially conducted during an REU in summer 2018.  No prior familiarity with modular forms is assumed.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-jim-brown-occidental-college/
LOCATION:Millikan 2099\, Pomona College\, 610 N. College Ave.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190227T161500
DTEND;TZID=America/Los_Angeles:20190227T171500
DTSTAMP:20260404T185650
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
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190228T120000
DTEND;TZID=America/Los_Angeles:20190228T133000
DTSTAMP:20260404T185650
CREATED:20190127T185703Z
LAST-MODIFIED:20190220T150331Z
UID:1171-1551355200-1551360600@colleges.claremont.edu
SUMMARY:Applying Quantum Representations of Mapping Class Groups (Wade Bloomquist\, UCSB)
DESCRIPTION:One foundational pillar of low dimensional topology is the connection between link invariants and 3-manifold invariants.  One generalization of this has been given by Reshetikhin and Turaev to a surgery theory for colored ribbon graphs.  Then to complete the analogy rather than 3-manifold invariants we now have a 2+1 dimensional topology quantum field theory (TQFT).  For this talk we will only be focusing on one corner of a TQFT\, in particular the representations of mapping class groups which are afforded (called quantum representations).  We will first go through a brief construction of these representations\, focusing on how colored ribbon graphs give rise to a basis.  Then we will dive into some applications of these representations both in recovering classical topology and in a proposal for a topological quantum computing protocol.  A strong effort will be made to keep things relatively self contained with as many pictures as possible.
URL:https://colleges.claremont.edu/ccms/event/applying-quantum-representations-of-mapping-class-groups-wade-bloomquist-ucsb/
LOCATION:Roberts North 104\, CMC\, 320 E. 9th St.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Topology Seminar
ORGANIZER;CN="Helen Wong":MAILTO:hwong@cmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190228T160000
DTEND;TZID=America/Los_Angeles:20190228T170000
DTSTAMP:20260404T185650
CREATED:20190227T213241Z
LAST-MODIFIED:20190227T213241Z
UID:1242-1551369600-1551373200@colleges.claremont.edu
SUMMARY:Job Talk - Howard Levinson - Candidate for Assistant Professor in Mathematics
DESCRIPTION:Candidate for Assistant Professor in Mathematics \nHoward Levinson\, University of Michigan \nSeeing Clearly Through a Microscope \nThe goal of microscope imaging is to obtain high-resolution images of cells.  However\, due to the underlying physics involved\, the resulting images are often blurred.  In this talk\, I will develop the mathematical framework to describe this blurring\, which leads to a natural algorithm for removing it.  At the end of talk\, I will introduce some new mathematical ideas for modifying this algorithm to further increase the resolution. \nThursday\, February 28\, 4-4:50pm \nBalch 218\, Scripps College \nFMI\, ctowse@scrippscollege.edu \n  \n 
URL:https://colleges.claremont.edu/ccms/event/job-talk-howard-levinson-candidate-for-assistant-professor-in-mathematics/
LOCATION:CA
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190228T161500
DTEND;TZID=America/Los_Angeles:20190228T171500
DTSTAMP:20260404T185650
CREATED:20190121T190809Z
LAST-MODIFIED:20190126T004351Z
UID:1117-1551370500-1551374100@colleges.claremont.edu
SUMMARY:Applied Math Seminar: Eulerian Approaches based on the Level Set Method for Visualizing Continuous Dynamical Systems (Shingyu Leung\, Department of Mathematics\, HKUST)
DESCRIPTION:One very important concept in understanding a dynamical system is coherent structure. Such structure segments the domain into different regions with similar behavior according to a quantity. When we try to partition space-time into regions according to a Lagrangian quantity advected along with passive tracers\, such class of coherent structure is called the Lagrangian coherent structures (LCSs). Among many\, a simple definition of an LCS uses the finite-time Lyapunov exponent (FTLE). It measures the rate of separation between adjacent particles over a finite time interval with an infinitesimal perturbation in the initial location. In the talk\, we first present various Eulerian-based numerical methods which efficiently compute the flow maps of any continuous dynamical system and\, therefore\, the corresponding FTLE. Based on these techniques we developed\, we will also propose some other useful numerical tools for extracting important structures hidden in the system.
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-given-by-shingyu-leung-department-of-mathematics-hkust/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Applied Math Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
END:VCALENDAR