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: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
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
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20270314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20271107T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260130T110000
DTEND;TZID=America/Los_Angeles:20260130T121500
DTSTAMP:20260519T205204
CREATED:20260110T204139Z
LAST-MODIFIED:20260127T020408Z
UID:3944-1769770800-1769775300@colleges.claremont.edu
SUMMARY:CCMS Colloquium: John Baez (UCR)
DESCRIPTION:CCMS Colloquium invites you to a talk by John Baez (UCR)\n\n \nTitle: The mathematics of tuning systems\n \nAbstract: Leibniz said “Music is the pleasure the human mind experiences from counting without being aware that it is counting.”  The first step is choosing a tuning system — the frequency ratios between pitches in a scale.  Different kinds of music sound best in different tuning systems!  In music from the Middle Ages until today\, new musical styles have gone hand in hand with mathematical innovations in tuning systems.  Here I will focus on a few of the most important and beautiful Western systems\, from Pythagorean tuning to today’s reigning champion: equal temperament. Can you hear the difference?  What will come next?\n \n  \nBio:   \nJohn Baez is a mathematical physicist\, formerly at U. C. Riverside and currently the Maxwell Fellow at the University of Edinburgh.   He is known for the Cobordism Hypothesis connecting manifolds to higher categories.  In 1993 he began writing This Week’s Finds in Mathematical Physics\, which has been called the world’s first blog.   Since then he has helped start two well-known blogs: The n-Category Caf e\, a group blog on math and physics\, and Azimuth\, on mathematics and ecological issues.   He also writes a regular column in Notices of the American Mathematical Society.
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-john-baez-ucr/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Sam Nelson":MAILTO:snelson@cmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251205T110000
DTEND;TZID=America/Los_Angeles:20251205T121500
DTSTAMP:20260519T205204
CREATED:20250923T142446Z
LAST-MODIFIED:20251205T155429Z
UID:3868-1764932400-1764936900@colleges.claremont.edu
SUMMARY:CCMS Colloquium: Konstantin Zuev (Caltech)
DESCRIPTION:CCMS Colloquium invites you to a talk by Konstantin Zuev (Caltech)\n\n \nTitle: Course-Prerequisite Networks\n \nAbstract: An academic curriculum is a complex system of courses and their interactions that lies at the heart of an academic institution and underlies its educational mission. Understanding these systems is essential for providing high-quality education. Course-prerequisite networks (CPNs) are directed acyclic graphs that model academic curricula by representing courses as nodes and prerequisite relationships between them as directed links. In this talk\, we will show how CPNs can be used to visualize\, analyze\, and optimize curricula; identify key courses; allocate teaching resources; quantify the strength of knowledge flow between departments; and uncover the most influential and interdisciplinary areas of study. The proposed methodology applies to any CPN and is illustrated using a network of courses taught at the California Institute of Technology. If time permits\, we will also discuss three new global CPN measures\, breadth\, depth\, and flux\, which enable macro-scale comparisons of different curricula. We illustrate these measures numerically using three real and synthetic CPNs from the Cyprus University of Technology\, the California Institute of Technology\, and Johns Hopkins University.\n \nBio: Dr. Konstantin Zuev is a Teaching Professor of Computing and Mathematical Sciences at the California Institute of Technology\, where he teaches a variety of courses in mathematics and statistics and conducts research on network science with undergraduate students. He is the author of about 30 papers and a forthcoming book\, Fundamentals of Statistical Inference: Foundations of Data Analysis. His teaching and research have been recognized with several awards: the ASCIT Teaching Award (2018 & 2023)\, the Carver Mead Seed Fund Grant (2023)\, the Graduate Student Council Teaching Award (2023)\, the Humboldt Research Fellowship for Experienced Researchers (2021)\, and the Northrop Grumman Prize for Excellence in Teaching (2019). For more information about his background\, please visit http://www.its.caltech.edu/~zuev/index.html
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-konstantin-zuev-caltech/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Bahar Acu":MAILTO:Bahar_Acu@pitzer.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251128T110000
DTEND;TZID=America/Los_Angeles:20251128T121500
DTSTAMP:20260519T205204
CREATED:20250923T142737Z
LAST-MODIFIED:20250923T142753Z
UID:3869-1764327600-1764332100@colleges.claremont.edu
SUMMARY:NO CCMS Colloquium this Friday!
DESCRIPTION:We’ll be back next week! \nHappy Thanksgiving!
URL:https://colleges.claremont.edu/ccms/event/no-ccms-colloquium-this-friday/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Bahar Acu":MAILTO:Bahar_Acu@pitzer.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251121T110000
DTEND;TZID=America/Los_Angeles:20251121T121500
DTSTAMP:20260519T205204
CREATED:20250923T141914Z
LAST-MODIFIED:20251119T170700Z
UID:3866-1763722800-1763727300@colleges.claremont.edu
SUMMARY:CCMS Colloquium: Shriya Nagpal (Pitzer)
DESCRIPTION:CCMS Colloquium invites you to a talk by Shriya Nagpal (Pitzer)\n\n \nTitle: Synchronization in Erdős–Rényi Graphs with Kuramoto Dynamics: A Graphon Approach\n \nAbstract: Networks of coupled Kuramoto oscillators have been used to model a wide array of phenomena\, including circadian rhythms\, flashing fireflies\, and high-voltage electric grids. In many such applications\, synchronization is an emergent behavior of interest. Recent work has focused on understanding synchronization in random networks of Kuramoto oscillators. We contribute to this literature\, by considering interaction networks generated by a graphon model known as a $W$-random network\, and examine the dynamics of an infinite number of identical ​ Kuramoto oscillators. We show that with sufficient regularity on $W$\, the solution to the dynamical system over a $W$-random network of size $n$ converges to the solution of the infinite graphon system\, with high probability as $n\rightarrow\infty$. We leverage this convergence result to study synchronization for identical Kuramoto oscillators on Erd\H{o}s-R\’enyi random graphs.\n \nBio: Shriya V. Nagpal is an Assistant Professor of Mathematics at Pitzer College. In 2024\, she completed her Ph.D. in Applied Mathematics at Cornell University\, where she was co-advised by Francesca Parise and Lindsay Anderson. Prior to joining Cornell in 2018\, she received her bachelor’s degree in Mathematics from Trinity College. Her research leverages tools from network theory and dynamical systems to study emergent behavior in interconnected systems.
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-shriya-nagpal-pitzer/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Bahar Acu":MAILTO:Bahar_Acu@pitzer.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251114T110000
DTEND;TZID=America/Los_Angeles:20251114T121500
DTSTAMP:20260519T205204
CREATED:20250923T141739Z
LAST-MODIFIED:20251112T013211Z
UID:3865-1763118000-1763122500@colleges.claremont.edu
SUMMARY:CCMS Colloquium: Robert Sanchez (HMC)
DESCRIPTION:CCMS Colloquium invites you to a talk by Robert Sanchez (HMC)\n\n \nTitle: Tides: Under the Sea and Under the Ice\n \nAbstract: Physical oceanography is the study of ocean fluid dynamics (e.g.\, waves\, currents\, plumes\, turbulence). This talk will introduce physical oceanography and the methods used to analyze ocean data such as time-series analysis and numerical solutions to differential equations. We will use these methods to investigate the tidally driven waves in a glacial fjord. Data analysis and numerical modeling of the system suggest a surprising origin for the waves with potential consequences for the melting of glaciers.\n \nBio: Robert Sanchez is a new Assistant Professor at Harvey Mudd College with a joint appointment between the Mathematics Department and the Hixon Center for the Climate and Environment. Prior to Harvey Mudd\, he was an NSF Postdoc Scholar at the University of Florida and he received his PhD in Physical Oceanography from the Scripps Institution of Oceanography. \n 
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-robert-sanchez-hmc/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Bahar Acu":MAILTO:Bahar_Acu@pitzer.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251107T110000
DTEND;TZID=America/Los_Angeles:20251107T121500
DTSTAMP:20260519T205204
CREATED:20250923T141522Z
LAST-MODIFIED:20251103T173924Z
UID:3864-1762513200-1762517700@colleges.claremont.edu
SUMMARY:CCMS Colloquium: Jemma Lorenat (Pitzer)
DESCRIPTION:CCMS Colloquium invites you to a talk by Jemma Lorenat (Pitzer)\n\n \nTitle: Recognizing data: statistical literacies around 1900\n \nAbstract: This talk centers on the first (and perhaps only) doctorate in the theory of correlations\, granted by University College London in 1899 to Alice Lee. The production and reception of Lee’s research sheds light on the varieties of statistical literacies around 1900.\n \nBio: Jemma Lorenat is a historian of mathematics at Pitzer College. She spends a great deal of time thinking about the history and future of statistical literacies. She also loves conic sections and (some) other algebraic curves.
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-jemma-lorenat-pitzer/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Bahar Acu":MAILTO:Bahar_Acu@pitzer.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251031T110000
DTEND;TZID=America/Los_Angeles:20251031T121500
DTSTAMP:20260519T205204
CREATED:20250923T141345Z
LAST-MODIFIED:20251030T024823Z
UID:3862-1761908400-1761912900@colleges.claremont.edu
SUMMARY:CCMS Colloquium: Anna Ma (UCI)
DESCRIPTION:CCMS Colloquium invites you to a talk by Anna Ma (UCI)\n\n \nTitle: Stochastic iterative methods for solving tensor linear systems\n \nAbstract: Solving linear systems is a crucial subroutine and challenge in data science and scientific computing. Classical approaches for solving linear systems assume that data is readily available and small enough to be stored in memory. However\, in the large-scale data setting\, data may be so large that only partitions (e.g.\, single rows/columns of the matrix/tensor) can be utilized at a time. In this presentation\, we discuss the advantages and role of randomization in iterative methods for approximating the solution to large-scale linear systems. Time permitting\, we will also discuss our recent work on applications to solving systems involving higher-dimensional arrays\, or tensors. Unlike previously proposed randomized iterative strategies\, such as the tensor randomized Kaczmarz method (row slice method) or the tensor Gauss-Seidel method (column slice method)\, which are natural extensions of their matrix counterparts\, our approach delves into a distinct scenario utilizing frontal slice sketching.\n \nBio: Dr. Anna Ma is an Assistant Professor at UC Irvine in the Department of Mathematics. Prior to her position at UCI\, she was a Visiting Assistant Professor at UCI and a UC Chancellor’s Postdoctoral Fellow at UC San Diego in the Department of Mathematics. Her research interests are in randomized algorithms\, numerical linear algebra\, and the mathematics of data science. She is also interested in data visualization and unsupervised machine learning. Anna earned her BS in Mathematics at UC Los Angeles. She received her PhD in Computational Science from Claremont Graduate University and the Computational Science Research Center at San Diego State University\, where she studied the design and analysis of algorithms that solve problems involving large-scale data. \n 
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-anna-ma-uci/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Bahar Acu":MAILTO:Bahar_Acu@pitzer.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251024T110000
DTEND;TZID=America/Los_Angeles:20251024T121500
DTSTAMP:20260519T205204
CREATED:20250923T141134Z
LAST-MODIFIED:20251023T215848Z
UID:3861-1761303600-1761308100@colleges.claremont.edu
SUMMARY:CCMS Colloquium: Braxton Osting (University of Utah)
DESCRIPTION:CCMS Colloquium invites you to a talk by Braxton Osting (University of Utah)\n\n \nTitle: Blood pressure monitoring with biophysics-informed machine learning models\n\n \nAbstract: Measurement of blood pressure (BP) is essential for early diagnosis and management of hypertension\, a condition that 45% of US adults have and a risk factor for development of heart failure\, the leading cause of death in the US. Wearable technologies have the potential to transform BP monitoring by providing continuous assessments of cardiovascular health metrics and guiding clinical management. However\, existing cuffless wearable devices for BP monitoring often rely on methods lacking theoretical foundations\, such as pulse wave analysis or pulse arrival time\, making them vulnerable to physiological and experimental confounders that undermine their accuracy and clinical utility. We developed a smartwatch device with real-time electrical bioimpedance (BioZ) sensing for cuffless hemodynamic monitoring. We elucidate the biophysical relationship between BioZ and BP via a multiscale analytical and computational modeling framework\, and identify physiological\, anatomical\, and experimental parameters that influence the pulsatile BioZ signal at the wrist. A signal-tagged physics-informed neural network incorporating fluid dynamics principles enables calibration-free estimation of BP and radial and axial blood velocity. We successfully tested our approach with healthy individuals at rest and after physical activity including physical and autonomic challenges\, and with patients with hypertension and cardiovascular disease in outpatient and intensive care settings. Our findings demonstrate the feasibility of BioZ technology for cuffless BP and blood velocity monitoring\, addressing critical limitations of existing cuffless technologies.\n \nBio:  Braxton Osting is a Professor in the Department of Mathematics at the University of Utah where he works on mathematical challenges in the natural and applied sciences. He has broad interests in analytical and computational methods for problems in applied mathematics\, especially in optimization\, partial differential equations\, computational geometry\, and machine learning. \nAfter attending the University of Washington for his undergraduate studies\, Braxton earned a Ph.D. in Applied Mathematics at Columbia University. Before moving to Utah\, he was an NSF Postdoctoral Fellow in the Department of Mathematics at the University of California\, Los Angeles. \nIn his free time\, Braxton enjoys biking\, skiing\, running\, hiking\, and generally spending time outdoors. \n 
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-selim-esedoglu-university-of-michigan/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Bahar Acu":MAILTO:Bahar_Acu@pitzer.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251010T110000
DTEND;TZID=America/Los_Angeles:20251010T121500
DTSTAMP:20260519T205204
CREATED:20250923T140917Z
LAST-MODIFIED:20251008T232409Z
UID:3860-1760094000-1760098500@colleges.claremont.edu
SUMMARY:CCMS Colloquium: Sinai Robins (University of São Paulo - Brazil)
DESCRIPTION:CCMS Colloquium invites you to a talk by Sinai Robins (University of São Paulo – Brazil)\n\n \nTitle: An introduction to the geometry of numbers through the lens of analysis\n \n\nAbstract: We introduce the geometry of numbers\, beginning from the first principles\, and proceeding to modern research topics in the field. Our point of view includes Fourier analysis on compact sets and in particular on convex bodies. We give some recent extensions of previous results by C. L. Siegel\, and E. Bombieri\, both of whom extended Minkowski’s first theorem for convex\, centrally symmetric bodies. \nA discrete version of these results allows us to give some new formulations for finite sums of discrete covariograms\, for any finite set of integer points in Euclidean space. We’ll give visual examples\, with pictures\, of everything in dimension 2. On the other hand\, a continuous application of these results allows us to shed additional light on the enumeration of lattice points in polytopes in R^d\, and in particular some Ehrhart-type theory. This is joint work with Michel Faleiros. \n\n \nBio: Professor Sinai Robins completed his Ph.D. in Number Theory at UCLA. He has held tenured positions at Temple University and Nanyang Technological University and is currently a full professor at the University of São Paulo\, Brasil. Professor Robins enjoys tackling problems in Discrete Geometry\, Fourier Analysis\, Number Theory\, Combinatorial Optimization\, and Data Science. Some of his recent research is reflected in his new 2024 book\, called Fourier analysis on polytopes and the geometry of numbers: Part I\, a gentle introduction. This book offers a unique\, modern\, Fourier-analytic perspective on the geometry of numbers. It explores the relationship between geometric properties of a polytope and its Fourier transform\, provides new streamlined proofs of fundamental results\, and invites undergraduates to explore these important ideas.
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-sinai-robins-university-of-sao-paulo-brazil/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Bahar Acu":MAILTO:Bahar_Acu@pitzer.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251003T110000
DTEND;TZID=America/Los_Angeles:20251003T121500
DTSTAMP:20260519T205204
CREATED:20250923T140603Z
LAST-MODIFIED:20251003T021636Z
UID:3859-1759489200-1759493700@colleges.claremont.edu
SUMMARY:CCMS Colloquium: Ruby Kim (University of Michigan)
DESCRIPTION:CCMS Colloquium invites you to a talk by Ruby Kim (University of Michigan) \nTitle: Mathematical Models of Circadian Rhythms and Seasonal Timing\n \nAbstract: The circadian clock shapes nearly 24-hour periodic rhythms throughout the body\, from the activity of individual cells to our daily sleep/wake cycles. These rhythms can be self-sustained (for example\, people still show circadian patterns even in total darkness)\, but they are also strongly influenced by the environment\, especially light. Mathematical models of circadian rhythms have provided insight into many intriguing phenomena\, including jet lag\, mid-afternoon fatigue\, and how animals sense the changing seasons. In this talk\, I will introduce how mathematical models of circadian rhythms are constructed and used. Then\, I will share recent work on seasonal timing in a large population of medical interns\, using data collected from wearable devices. Our results suggest that seasonal timing plays a key role in how people respond to shift work. Overall\, the goal of this talk is to introduce how mathematical modeling can be used to better understand biological rhythms and their impact on daily life.\n \nBio: I am originally from Koreatown\, Los Angeles. I did my undergraduate studies at Pomona College (Class of ’17)\, where I majored in math and completed a thesis under the mentorship of Dr. Ami Radunskaya. I enjoyed teaching mathematics and doing research\, so I decided to pursue graduate studies in math at Duke University. During my PhD\, I fell in love with biological rhythms and mathematical neuroscience. Currently\, I am a postdoc at the University of Michigan using mathematical modeling and data science to study biology and health. During my free time\, I enjoy playing pool\, hanging out with my dog\, and reading.
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-ruby-kim-university-of-michigan/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Bahar Acu":MAILTO:Bahar_Acu@pitzer.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251002T160000
DTEND;TZID=America/Los_Angeles:20251002T170000
DTSTAMP:20260519T205204
CREATED:20250922T013036Z
LAST-MODIFIED:20250922T013226Z
UID:3847-1759420800-1759424400@colleges.claremont.edu
SUMMARY:Analysis seminar: Transfinite Apollonian metric (Zair Ibragimov\, CSU Fullerton)
DESCRIPTION:Title: Transfinite Apollonian metric \nAbstract: The concept of transfinite diameter of compact sets in the complex plane was introduced by Fekete in 1923. It is a generalization of the standard diameter of sets and has found many applications in the study of conformal mappings. The Apollonian metric was introduced by A. Beardon in 1995 and has since been used in the study of non-Euclidean geometries\, hyperbolic-type metrics\, and quasiconformal mappings. After a brief introduction to these concepts\, we will discuss in some details the constructions of Apollonian metrics of order k and the transfinite Apollonian metric. Time permitting\, we will discuss several properties\, connections to other hyperbolic-type metrics\, and some open problems.
URL:https://colleges.claremont.edu/ccms/event/analysis-seminar-transfinite-apollonian-metric-zair-ibragimov-csu-fullerton/
LOCATION:Davidson Lecture Hall\, CMC\, 340 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:20250926T110000
DTEND;TZID=America/Los_Angeles:20250926T121500
DTSTAMP:20260519T205204
CREATED:20250917T194906Z
LAST-MODIFIED:20250922T185920Z
UID:3839-1758884400-1758888900@colleges.claremont.edu
SUMMARY:CCMS Colloquium: Robert Cass (CMC)
DESCRIPTION:CCMS Colloquium invites you to a talk by Assistant Professor of Mathematics Robert Cass of Claremont McKenna College:\n\n \nTitle: An introduction to the Langlands program\n \nAbstract: Class field theory\, which was established in the early 20th century\, has its origins in Gauss’s law of quadratic reciprocity. As such\, it allows one to determine whether certain integer polynomials have a root mod p. The Langlands program is a vast area of current research in number theory that can be viewed as a generalization of class field theory to all integer polynomials. In this talk\, I will give a leisurely introduction to this circle of ideas by way of some concrete examples. I will conclude with my own work\, which includes a result on the independence of the cohomology theory chosen in a geometric and categorical analogue of the Langlands program.\n \nBrief Bio: Robert Cass joined the Mathematical Sciences Department at CMC as an Assistant Professor of Mathematics this fall. He received his B.S. from the University of Kentucky and his Ph.D. from Harvard University. After that\, he was an NSF postdoctoral fellow at Caltech and the University of Michigan. He is interested in the Langlands program and arithmetic geometry\, as well as related problems in algebraic geometry and representation theory. He enjoys mathematical questions that are simple to state but whose solutions involve tools from multiple disciplines\, especially those with unexpected connections to geometry.
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-robert-cass-cmc/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Bahar Acu":MAILTO:Bahar_Acu@pitzer.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250925T160000
DTEND;TZID=America/Los_Angeles:20250925T170000
DTSTAMP:20260519T205204
CREATED:20250915T214113Z
LAST-MODIFIED:20250915T215619Z
UID:3836-1758816000-1758819600@colleges.claremont.edu
SUMMARY:Analysis seminar: Geometric classification problems with the Bergman metric (John Treuer\, UCSD)
DESCRIPTION:Title: Geometric classification problems with the Bergman metric \nAbstract: One of the common problems in mathematics is the classification problem: When are two mathematical structures really the same? The classification problem appears throughout undergraduate mathematics courses in different forms. For example\, in an abstract algebra course\, one asks when are two groups isomorphic? In a geometry course\, one asks when are two surfaces isometric? In a discrete math course\, one asks when are two sets bijective? The version in complex analysis is when are two domains (open\, connected sets) biholomorphic to each other? \nIn this talk\, we will begin by defining the primarily studied functions in complex analysis\, the complex differentiable functions also known as the holomorphic functions. We will then study the classification problem through the Bergman kernel and the Bergman metric. Towards the end of the talk\, recent progress on classifying domains and complex manifolds with Bergman metrics of constant holomorphic sectional curvature will be presented.
URL:https://colleges.claremont.edu/ccms/event/analysis-seminar-john-treuer-ucsd/
LOCATION:Davidson Lecture Hall\, CMC\, 340 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:20250919T110000
DTEND;TZID=America/Los_Angeles:20250919T120000
DTSTAMP:20260519T205204
CREATED:20250903T163230Z
LAST-MODIFIED:20250917T194549Z
UID:3817-1758279600-1758283200@colleges.claremont.edu
SUMMARY:NO CCMS Colloquium this Friday!
DESCRIPTION:We’ll be back next week!
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Bahar Acu":MAILTO:Bahar_Acu@pitzer.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250912T110000
DTEND;TZID=America/Los_Angeles:20250912T120000
DTSTAMP:20260519T205204
CREATED:20250903T160356Z
LAST-MODIFIED:20250909T001255Z
UID:3816-1757674800-1757678400@colleges.claremont.edu
SUMMARY:CCMS Colloquium: Morse theory\, Floer homology\, and string topology (Ko Honda\, UCLA)
DESCRIPTION:CCMS Colloquium invites you to a talk by Professor Ko Honda\, Professor of Mathematics at UCLA. \nTitle: Morse theory\, Floer homology\, and string topology \nAbstract: One of the most important theories in geometry/topology is Floer homology\, which can be viewed as a Morse theory of a loop space of a manifold (a generalization of a surface to higher dimensions).  The aim of this talk is to give a gentle pictorial introduction to Morse theory for surfaces and then upgrade it in two steps: to Morse theory of loop spaces (e.g.\, of the 2-dimensional sphere) and then to “multiloops” (collections of many loops).  The last upgrade is intimately related to a mathematical model for string theory called “string topology”\, due to Chas-Sullivan\, and to quantum topology via the HOMFLY polynomial of knots/links. \nSpeaker Bio: Ko Honda is an entirely American-trained mathematician\, receiving his BA and MA from Harvard University in 1992 and PhD from Princeton University in 1997.  After postdocs/visiting positions at Duke\, the University of Georgia\, the American Institute of Mathematics\, and IHES\, he arrived in LA in 2001\, was a faculty member at USC for 12.5 years\, and then moved across town to UCLA\, where he has been for the last 11.5 years.  Sometime during his postdoc at Duke\, he discovered/invented an object called a “bypass” in contact geometry\, which allowed him to simplify the analysis of 3-dimensional contact manifolds and solve several open problems in that area\, some in joint work with Colin\, Etnyre\, and Giroux.  He has been working on contact and symplectic geometry ever since\, gradually branching out into adjacent areas (e.g.\, low-dimensional topology\, Floer theory\, and quantum topology) in the intervening years.
URL:https://colleges.claremont.edu/ccms/event/ccms-colloquium-presents-title-ko-honda/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Bahar Acu":MAILTO:Bahar_Acu@pitzer.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20230502T121500
DTEND;TZID=America/Los_Angeles:20230502T131000
DTSTAMP:20260519T205204
CREATED:20230125T224231Z
LAST-MODIFIED:20230425T203617Z
UID:3055-1683029700-1683033000@colleges.claremont.edu
SUMMARY:Towers and elementary embeddings in total relatively hyperbolic groups (Christopher Perez\, Loyola University New Orleans)
DESCRIPTION:In a remarkable series of papers Zlil Sela classified the first-order theories of free groups and torsion-free hyperbolic groups using geometric structures he called towers\, and independently Olga Kharlampovich and Alexei Myasnikov did the same using equivalent structures they called regular NTQ groups. It was later proved by Chloé Perin that if H is an elementarily embedded subgroup (or elementary submodel) of a torsion-free hyperbolic group G\, then G is a tower over H. We prove a generalization of Perin’s result to toral relatively hyperbolic groups using JSJ and shortening techniques.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-christopher-perez-loyola-university-new-orleans/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20230425T121500
DTEND;TZID=America/Los_Angeles:20230425T131000
DTSTAMP:20260519T205204
CREATED:20230116T180753Z
LAST-MODIFIED:20230417T230547Z
UID:3027-1682424900-1682428200@colleges.claremont.edu
SUMMARY:Bias in cubic Gauss sums: Patterson's conjecture (Alex Dunn\, CalTech)
DESCRIPTION:We prove\, in this joint work with Maksym Radziwill\, a 1978 conjecture of S. Patterson (conditional on the Generalized Riemann Hypothesis) concerning the bias of cubic Gauss sums. This explains a well-known numerical bias in the distribution of cubic Gauss sums first observed by Kummer in 1846. One important byproduct of our proof is that we show Heath-Brown’s cubic large sieve is sharp under GRH.  This disproves the popular belief that the cubic large sieve can be improved. An important ingredient in our proof is a dispersion estimate for cubic Gauss sums. It can be interpreted as a cubic large sieve with correction by a non-trivial asymptotic main term.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-alex-dunn-caltech/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20230418T121500
DTEND;TZID=America/Los_Angeles:20230418T131000
DTSTAMP:20260519T205204
CREATED:20230211T054504Z
LAST-MODIFIED:20230411T184945Z
UID:3078-1681820100-1681823400@colleges.claremont.edu
SUMMARY:Systems of homogeneous polynomials over finite fields with maximum number of common zeros (Sudhir Ghorpade\, IIT Bombay)
DESCRIPTION:It is elementary and well known that a nonzero polynomial in one variable of degree d with coefficients in a field F has at most d zeros in F. It is meaningful to ask similar questions for systems of several polynomials in several variables of a fixed degree\, provided the base field F is finite. These questions become particularly interesting and challenging when one restricts to polynomials that are homogeneous\, and considers zeros (other than the origin) that are non-proportional to each other. More precisely\, we consider the following question: \nGiven a system of a fixed number of linearly independent homogeneous polynomial equations of a fixed degree with coefficients in a fixed finite field F\, what is the maximum number of common zeros they can have in the corresponding protective space over F?The case of a single homogeneous polynomial (or in geometric terms\, a projective hypersurface) corresponds to a classical inequality proved by Serre in 1989. For the general case\, an elaborate conjecture was made by Tsfasman and Boguslavsky\, which was open for almost two decades. Recently significant progress in this direction has been made\, and it is shown that while the Tsfasman-Boguslavsky Conjecture is true in certain cases\, it can be false in general. Some new conjectures have also been proposed. We will give a motivated outline of these developments. If there is time and interest\, connections to coding theory or to the problem of counting points of sections of Veronese varieties by linear subvarieties of a fixed dimension will also be outlined. \nThis talk is mainly based on joint works with Mrinmoy Datta and with Peter Beelen and Mrinmoy Datta.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-sudhir-ghorpade-iit-bombay/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20230411T121500
DTEND;TZID=America/Los_Angeles:20230411T131000
DTSTAMP:20260519T205204
CREATED:20230201T212937Z
LAST-MODIFIED:20230405T034512Z
UID:3063-1681215300-1681218600@colleges.claremont.edu
SUMMARY:Discrete Calculus through generating functions (Wai Yan Pong\, Cal State Dominguez Hills)
DESCRIPTION:Discrete Calculus studies discrete structures\, such as sequences and graphs\, using techniques similar to those used in Calculus for continuous functions. The basic idea of generating functions is to associate a function with a sequence so that the coefficients of the power series expansion of the function represent the terms of the sequence. They provide a systematic way to encode information about a sequence or a combinatorial structure in a single function\, which can then be manipulated algebraically to obtain various types of results. In this talk\, we will examine a few well-known results about binomial coefficients\, Stirling numbers and Bernoulli numbers using both Discrete Calculus and generating functions as well as the interaction between them.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-wai-yan-pong-cal-state-dominguez-hills/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20230404T121500
DTEND;TZID=America/Los_Angeles:20230404T131000
DTSTAMP:20260519T205204
CREATED:20230112T225942Z
LAST-MODIFIED:20230327T230516Z
UID:3023-1680610500-1680613800@colleges.claremont.edu
SUMMARY:Noise stability of ranked choice voting (Steven Heilman\, USC)
DESCRIPTION:Given votes for candidates\, what is the best way to determine the winner of the election\, if some of the votes have been corrupted or miscounted?  As we saw in Florida in 2000\, where a difference of 537 votes determined the president of the United States\, the electoral college system does not seem to be the best voting method. We will survey some recent progress on the above question along with some open problems. In particular\, we consider which ranked choice voting method is most stable to corrupted or miscounted votes. \nhttps://arxiv.org/abs/2209.11183
URL:https://colleges.claremont.edu/ccms/event/antc-talk-steven-heilman-usc/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20230328T121500
DTEND;TZID=America/Los_Angeles:20230328T131000
DTSTAMP:20260519T205204
CREATED:20230124T212708Z
LAST-MODIFIED:20230320T225330Z
UID:3054-1680005700-1680009000@colleges.claremont.edu
SUMMARY:The Smith normal form of a polynomial of a random integral matrix (Gilyoung Cheong\, UC Irvine)
DESCRIPTION:Given a prime p\, let P(t) be a non-constant monic polynomial in t over the ring of p-adic integers. Let X(n) be an n x n uniformly random (0\,1)-matrix over the same ring. We compute the asymptotic distribution of the cokernel of P(X(n)) as n goes to infinity. When P(t) is square-free modulo p\, this lets us compute the asymptotic distribution of the Smith normal form of P(X(n)). In fact\, we shall consider the same problem with a more general random matrix X(n)\, which also includes the example of a Haar-random matrix. Our work crucially uses a recent work of W. Sawin and M. M. Wood which shows that the moments of finite size modules over any ring determine their distribution.\n\nThis is joint work with Myungjun Yu. https://arxiv.org/abs/2303.09125
URL:https://colleges.claremont.edu/ccms/event/antc-talk-gilyoung-cheong-uci/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20230321T121500
DTEND;TZID=America/Los_Angeles:20230321T131000
DTSTAMP:20260519T205204
CREATED:20230113T153459Z
LAST-MODIFIED:20230313T193754Z
UID:3025-1679400900-1679404200@colleges.claremont.edu
SUMMARY:Robust properties of graphs (Asaf Ferber\, UC Irvine)
DESCRIPTION:In this talk we will consider some notions of `robustness’ of graph/hypergraph properties. We will survey some existing results and will try to emphasize the following new result (joint with Adva Mond and Kaarel Haenni): The binomial random digraph $D_{n\,p}$ typically contains the minimum between the minimum out- and in-degrees many edge-disjoint Hamilton cycles\, given that $p\geq \log^C n/n$. The result is optimal up to log factors.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-asaf-ferber-uc-irvine/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20230221T121500
DTEND;TZID=America/Los_Angeles:20230221T131000
DTSTAMP:20260519T205204
CREATED:20230201T215846Z
LAST-MODIFIED:20230215T012913Z
UID:3065-1676981700-1676985000@colleges.claremont.edu
SUMMARY:On zeros of multilinear polynomials (Max Forst\, CGU)
DESCRIPTION:Consider rational polynomials in multiple variables that are linear with respect to some of the variables. In this talk we discuss the problem of finding a zero of such polynomials that are bounded with respect to a height function. For a system of such polynomials satisfying certain technical conditions we prove the existence of a bounded height simultaneous zero. For a single such polynomial we prove the existence of a zero of bounded height lying outside of a prescribed algebraic set. Based on joint work with Lenny Fukshansky.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-max-forst-cgu-2/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20230207T121500
DTEND;TZID=America/Los_Angeles:20230207T131000
DTSTAMP:20260519T205204
CREATED:20230202T190817Z
LAST-MODIFIED:20230202T190817Z
UID:3066-1675772100-1675775400@colleges.claremont.edu
SUMMARY:Orthogonality defect and coherence of cyclotomic lattices (Lenny Fukshansky\, CMC)
DESCRIPTION:There are two different measures of how far a given Euclidean lattice is from being orthogonal — the orthogonality defect and the average coherence. The first of these comes from the study of sphere packing while the second is motivated by frame theory\, but both of them have applications in digital communications\, especially in coding theory and cryptography. It is interesting to understand how the two are related. We investigate this question on an important class of cyclotomic lattices\, where some nice formulas can be derived and certain empirical observations can be made. Joint work with David Kogan.
URL:https://colleges.claremont.edu/ccms/event/orthogonality-defect-and-coherence-of-cyclotomic-lattices-lenny-fukshansky-cmc/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20230131T121500
DTEND;TZID=America/Los_Angeles:20230131T131000
DTSTAMP:20260519T205204
CREATED:20230112T013416Z
LAST-MODIFIED:20230112T054807Z
UID:3021-1675167300-1675170600@colleges.claremont.edu
SUMMARY:Biquandle arrow weights (Sam Nelson\, CMC)
DESCRIPTION:Many knot invariants are defined from features of knot projections such as arcs or crossings. Gauss diagrams provide an alternative combinatorial scheme for representing knots. In this talk we will use Gauss diagrams to enhance the biquandle counting invariant for classical and virual knots using biquandle arrow weights\, a new algebraic structure without a clear geometric interpretation. This is joint work with Migiwa Sakurai (Shibaura Institute of Technology\, Tokyo).
URL:https://colleges.claremont.edu/ccms/event/antc-talk-sam-nelson-cmc-3/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20221206T121500
DTEND;TZID=America/Los_Angeles:20221206T131000
DTSTAMP:20260519T205204
CREATED:20221130T053013Z
LAST-MODIFIED:20221130T053013Z
UID:3005-1670328900-1670332200@colleges.claremont.edu
SUMMARY:Positive semigroups in lattices and totally real number fields (Lenny Fukshansky\, CMC)
DESCRIPTION:Let  L be a full-rank lattice in R^n and write L+ for the semigroup of all vectors with nonnegative coordinates in L. We call a basis X for L positive if it is contained in L+. There are infinitely many such bases\, and each of them spans a conical semigroup S(X) consisting of all nonnegative integer linear combinations of the vectors of X. Such S(X) is a sub-semigroup of L+\, and we investigate the distribution of the gaps of S(X) in L+\, i.e. points in L+ outside of S(X). We describe some basic properties and counting estimates for these gaps. Our main focus is on the restrictive successive minima of these sets\, for which we produce bounds in the spirit of Minkowski’s successive minima theorem. We apply these results to obtain analogous bounds for the successive minima with respect to Weil height of totally positive sub-semigroups of ideals in totally real number fields. Joint work with Siki Wang (CMC’22).
URL:https://colleges.claremont.edu/ccms/event/positive-semigroups-in-lattices-and-totally-real-number-fields-lenny-fukshansky-cmc/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20221115T121500
DTEND;TZID=America/Los_Angeles:20221115T131000
DTSTAMP:20260519T205204
CREATED:20220823T003904Z
LAST-MODIFIED:20221102T220943Z
UID:2786-1668514500-1668517800@colleges.claremont.edu
SUMMARY:Minimal Mahler measure in number fields (Kate Petersen\, University of Minnesota Duluth)
DESCRIPTION:The Mahler measure of a polynomial is the modulus of its leading term multiplied by the moduli of all roots outside the unit circle.  The Mahler measure of an algebraic number b\, M(b) is the Mahler measure of its minimal polynomial. By a result of Kronecker\, an algebraic number b satisfies M(b)=1 if and only if b is a root of unity. Famously\, Lehmer asked if there are algebraic numbers with Mahler measures arbitrarily close to 1 (but not equal to 1). We will investigate the minimal Mahler measure of a number field.  For a number field K this is the smallest Mahler measure of a non-torsion generator for K\, written M(K). There are known upper and lower bounds for M(K) in terms of the degree and discriminant of K.  Focusing on cubics\, we will discuss how these bounds correspond to other properties of the number field\, and the sharpness of these bounds.  This is joint work with Lydia Eldredge.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-kate-petersen-university-of-minnesota-duluth/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20221108T121500
DTEND;TZID=America/Los_Angeles:20221108T131000
DTSTAMP:20260519T205204
CREATED:20220824T204820Z
LAST-MODIFIED:20221031T203245Z
UID:2787-1667909700-1667913000@colleges.claremont.edu
SUMMARY:Factoring translates of polynomials (Arvind Suresh\, University of Arizona - Tucson)
DESCRIPTION:Given a degree d polynomial f(x) in Q[x]\, consider the subset S_f  of Q consisting of rational numbers t for which the translated polynomial f(x) – t factors completely in Q[x]. For example\, if f is linear or quadratic then S_f is always infinite\, but if degree of f is at least 3\, then interesting things can happen. In this talk\, we discuss a connection between the set S_f and the classical Prouhet–Tarry–Escott problem (which asks for integer solutions to certain symmetric family of equations)\, and we present two infinite families of polynomials f for which S_f is infinite (upon replacing Q with certain number fields). Time permitting\, we outline how these can then be used to produce algebraic curves over number fields having a record number of rational points (relative to their genus).
URL:https://colleges.claremont.edu/ccms/event/antc-talk-arvind-suresh-university-of-arizona-tucson/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20221101T121500
DTEND;TZID=America/Los_Angeles:20221101T131000
DTSTAMP:20260519T205204
CREATED:20220906T211012Z
LAST-MODIFIED:20221031T180722Z
UID:2839-1667304900-1667308200@colleges.claremont.edu
SUMMARY:A tale of two worlds: parking functions &  reduction algebras (Dwight Anderson Williams II\, Pomona)
DESCRIPTION:“A Tale of Two Cities” is a novel told in three books/parts. Here we describe three projects related both to published work and ongoing pieces: \nPROJECT 1: In the world of combinatorics\, parking functions are combinatorial objects arising from the situation of parking cars under a parking strategy. In this part of the talk\, we will refresh the notion of classical parking functions given by the classical parking rules/strategy. We will then state an interesting correspondence between certain classical parking functions and so-called ideal states of the famous Tower of Hanoi game. This work is to appear in The American Mathematical Monthly with the following co-authors: Y. Aguillon\, D. Alvarenga\, P.E. Harris\, S. Kotapati\, J.C. Martinez Mori\, C. Monroe\, Z. Saylor\, and C. Tieu. \nPROJECT 2: In the world of algebra\, we shed light on representation theory of Lie superalgebras by constructing reduction algebras. These algebras provide structures to study in their own right\, and we give an example in presenting the diagonal reduction algebra of $osp(1|2)$\, first described in a joint paper with Jonas T. Hartwig. \nPROJECT 3: Continuing down an algebraic pathway\, we summarize the general framework given by Zhelobenko to apply representation theory of reduction algebras as a method to solve equations. Fixing equations important to the study of physics has led to recent work with Jonas T. Hartwig and Erin Dolecheck\, as well\, Irmak Bukey.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-dwight-anderson-williams-ii-pomona/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20221025T121500
DTEND;TZID=America/Los_Angeles:20221025T131000
DTSTAMP:20260519T205204
CREATED:20220906T160323Z
LAST-MODIFIED:20221012T181637Z
UID:2834-1666700100-1666703400@colleges.claremont.edu
SUMMARY:Properties of redistricting Markov chains (Sarah Cannon\, CMC)
DESCRIPTION:Markov chains have become widely-used to generate random political districting plans. These random districting plans can be used to form a baseline for comparison\, and any proposed districting plans that differ significantly from this baseline can be flagged as potentially gerrymandered. However\, very little is rigorously known about these Markov chains – Are they irreducible? What is their mixing time? For some\, even the stationary distribution remains unknown. I will present recent work that answers some of these questions\, which uses tools from probability\, computational geometry\, and more.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-sarah-cannon-cmc/
LOCATION:Davidson Lecture Hall\, CMC\, 340 E 9th St\, Claremont\, CA\, 91711\, United States
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
END:VCALENDAR