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:20200308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20201101T090000
END:STANDARD
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:20220330T161500
DTEND;TZID=America/Los_Angeles:20220330T173000
DTSTAMP:20260409T005440
CREATED:20220311T141931Z
LAST-MODIFIED:20220328T160742Z
UID:2658-1648656900-1648661400@colleges.claremont.edu
SUMMARY:Voronoi Tessellations:  Optimal Quantization and Modeling Collective Behavior (Prof. Rustum Choksi)
DESCRIPTION:Title: Voronoi Tessellations: Optimal Quantization and Modeling Collective Behavior \nSpeaker: Prof. Rustum Choksi\, Department of Mathematics and Statistics\, McGill University \nAbstract:  Given a set of N distinct points (generators) in a domain (a bounded subset of Euclidean space or a compact Riemannian manifold)\, a Voronoi tessellation is a partition of the domain into N regions (Voronoi cells) with the following property: all points in the interior of the ith Voronoi cell are closer to the ith generating point than to any other generator.  Voronoi tessellations give rise to a wealth of analytic\, geometric\, and computational questions. They are also very useful in mathematical and computational modeling. \nThis talk will consist of three parts: \n\nWe begin by introducing the basic definitions and geometry of Voronoi tessellations\,  centroidal Voronoi tessellations (CVTs)\, and the notion of optimal quantization.\nWe will then address simple\, yet rich\, questions on optimal quantization on the 2D and 3D torus\, and on  the 2-sphere. We will address the geometric nature of the global minimizer (the optimal CVT)\, presenting a few conjectures and a short discussion on rigorous asymptotic results and their proofs.\nWe will then shift gears to address the use Voronoi tessellations in modeling collective behaviors.\n\nCollective behavior in biological systems\, in particular the contrast and connection between individual and collective behavior\, has fascinated researchers for decades. A well-studied paradigm entails the tendency of groups of individual agents to form flocks\, swarms\, herds\, schools\, etc. We will first review some well-known and widely used models for collective behavior.  We will then present a new dynamical model for generic crowds in which individual agents are aware of their local Voronoi environment — i.e.\, neighboring agents and domain boundary features –and may seek static target locations. Our model incorporates features common to many other active matter models like collision avoidance\, alignment among agents\, and homing toward targets. However\, it is novel in key respects: the model combines topological and metrical features in a natural manner based upon the local environment of the agent’s Voronoi diagram. With only two parameters\, it captures a wide range of collective behaviors. The results of many simulations will be shown. \n\nRustum Choksi received the PhD degree in mathematics from Brown University\, in 1994. He held post-doctoral positions with the Center for Nonlinear Analysis\, Carnegie Mellon University and the Courant Institute\, New York University. From 1997 to 2010\, he was a faculty member with the Department of Mathematics\, Simon Fraser University. In 2010\, he joined McGill University where he is currently a full professor with the Department of Mathematics and Statistics. His main research interests include interaction of the calculus of variations and partial differential equations with pattern formation.
URL:https://colleges.claremont.edu/ccms/event/voronoi-tessellations-optimal-quantization-and-modeling-collective-behavior-prof-rustum-choksi/
LOCATION:Zoom
CATEGORIES:Colloquium
ORGANIZER;CN="Andrew Bernoff":MAILTO:ajb@hmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220329T150000
DTEND;TZID=America/Los_Angeles:20220329T160000
DTSTAMP:20260409T005440
CREATED:20230913T080151Z
LAST-MODIFIED:20230913T080151Z
UID:3230-1648566000-1648569600@colleges.claremont.edu
SUMMARY:Kauffman Bracket Skein Modules and their Structure (Rhea Palak Bakshi\, ETH Zurich)
DESCRIPTION:Skein modules were introduced by Jozef H. Przytycki as generalisations of the Jones and HOMFLYPT polynomial link invariants in the 3-sphere to arbitrary 3-manifolds. The Kauffman bracket skein module (KBSM) is the most extensively studied of all. However\, computing the KBSM of a 3-manifold is notoriously hard\, especially over the ring of Laurent polynomials. With the goal of finding a definite structure of the KBSM over this ring\, several conjectures and theorems were stated over the years for KBSMs. We show that some of these conjectures\, and even theorems\, are not true. In this talk I will briefly discuss a counterexample to Marche’s generalisation of Witten’s conjecture. I will show that a theorem stated by Przytycki in 1999 about the KBSM of the connected sum of two handlebodies does not hold. I will also give the exact structure of the KBSM of the connected sum of two solid tori.
URL:https://colleges.claremont.edu/ccms/event/kauffman-bracket-skein-modules-and-their-structure-rhea-palak-bakshi-eth-zurich/
LOCATION:Zoom
CATEGORIES:Topology Seminar
ORGANIZER;CN="Sam Nelson":MAILTO:snelson@cmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220329T123000
DTEND;TZID=America/Los_Angeles:20220329T132000
DTSTAMP:20260409T005440
CREATED:20220127T202631Z
LAST-MODIFIED:20220326T051329Z
UID:2573-1648557000-1648560000@colleges.claremont.edu
SUMMARY:Peg solitaire in multiple colors on graphs (Tara Davis\, Hawaii Pacific University and Roberto Soto\, Cal State Fullerton)
DESCRIPTION:Peg solitaire is a popular one person board game that has been played in many countries on various board shapes. Recently\, peg solitaire has been studied extensively in two colors on mathematical graphs. We will present our rules for multiple color peg solitaire on graphs. We will present some student and faculty results classifying the solvability of the game on several graceful graphs\, as well as discuss open questions.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-tara-davis-hawaii-pacific-university-and-roberto-soto-cal-state-fullerton/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220323T161500
DTEND;TZID=America/Los_Angeles:20220323T173000
DTSTAMP:20260409T005440
CREATED:20220320T201004Z
LAST-MODIFIED:20220320T201104Z
UID:2667-1648052100-1648056600@colleges.claremont.edu
SUMMARY:The 6 Cs - Covid and the 5 Claremont Colleges (Prof. Maryann E. Hohn)
DESCRIPTION:Title: The 6 Cs – Covid and the 5 Claremont Colleges \nSpeaker: Maryann E. Hohn\, Department of Mathematics and Statistics\, Pomona College \nAbstract: The Claremont Colleges’ (5Cs) environment consists of students\, faculty\, and staff that congregate together in indoor spaces\, creating a higher risk for possible COVID-19 infection.  Additionally\, a majority of the students live on campus\, presenting a relatively closed campus environment that limits students’ interactions with their greater community. However\, the close knit quarters in which students live may contribute to a rise in infections that may ultimately reach other more vulnerable populations on the campuses such as faculty and staff. \n  \nIn this talk\, we present several models of COVID-19 spread at the 5Cs.  We start with an early model consisting of several interconnected modified SEIR differential equations to investigate the dynamics between different populations at the 5Cs and the influence of mitigation techniques such as students adhering to health protocols and contact tracing. With the addition of vaccines\, we show how the model changed\, how student researchers are contributing to our models\, and how a few students created their own.\n \n\nDr. Maryann Hohn is a Visiting Assistant Professor of Mathematics and Statistics at Pomona College.  Her research interests lie in mathematical modeling and data analysis to solve societal problems.  She utilizes a variety of mathematical tools such as stochastic processes\, PDEs\, numerical analysis\, and graph theory.  She also actively supports groups like AWM that support students in underrepresented groups\, mentors both undergraduate and graduate students\, and advises undergraduate researchers.
URL:https://colleges.claremont.edu/ccms/event/the-6-cs-covid-and-the-5-claremont-colleges-prof-maryann-e-hohn/
LOCATION:Shanahan B460 (HMC) and Zoom – Hybrid
CATEGORIES:Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220322T150000
DTEND;TZID=America/Los_Angeles:20220322T160000
DTSTAMP:20260409T005440
CREATED:20230913T075943Z
LAST-MODIFIED:20230913T075943Z
UID:3229-1647961200-1647964800@colleges.claremont.edu
SUMMARY:Towards Knot Homology for 3-Manifolds (Aaron Mazel-Gee\, California Institute of Technology)
DESCRIPTION:The Jones polynomial is an invariant of knots in R^3. Following a proposal of Witten\, it was extended to knots in 3-manifolds by Reshetikhin-Turaev using quantum groups. Khovanov homology is a categorification of the Jones polynomial of a knot in R^3\, analogously to how ordinary homology is a categorification of the Euler characteristic of a space. It is a major open problem to extend Khovanov homology to knots in 3-manifolds. In this talk\, I will explain forthcoming work towards solving this problem\, joint with Leon Liu\, David Reutter\, Catharina Stroppel\, and Paul Wedrich. Roughly speaking\, our contribution amounts to the first instance of a braiding on 2-representations of a categorified quantum group. More precisely\, we construct a braided (infinity\,2)-category that simultaneously incorporates all of Rouquier’s braid group actions on Hecke categories in type A\, articulating a novel compatibility among them.
URL:https://colleges.claremont.edu/ccms/event/towards-knot-homology-for-3-manifolds-aaron-mazel-gee-california-institute-of-technology/
LOCATION:Zoom
CATEGORIES:Topology Seminar
ORGANIZER;CN="Sam Nelson":MAILTO:snelson@cmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220322T123000
DTEND;TZID=America/Los_Angeles:20220322T132000
DTSTAMP:20260409T005440
CREATED:20220128T031313Z
LAST-MODIFIED:20220321T182413Z
UID:2575-1647952200-1647955200@colleges.claremont.edu
SUMMARY:Continuous extensions of Ramanujan-expandable arithmetic functions (Matthew Fox\, Perimeter Institute for Theoretical Physics and Chai Karamchedu\, Sandia National Labs)
DESCRIPTION:We describe a natural way to continuously extend arithmetic functions that admit a Ramanujan expansion and derive the conditions under which such an extension exists. In particular\, we show that the absolute convergence of a Ramanujan expansion does not guarantee the convergence of its real variable generalization. We take the divisor function as a case study\, and consider how to continuously extend it to the reals.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-matthew-fox-perimeter-institute-for-theoretical-physics-and-chai-karamchedu-sandia-national-labs/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220321T161500
DTEND;TZID=America/Los_Angeles:20220321T171500
DTSTAMP:20260409T005440
CREATED:20220110T210855Z
LAST-MODIFIED:20230816T041537Z
UID:2521-1647879300-1647882900@colleges.claremont.edu
SUMMARY:Applied Math Seminar -- Jamie Haddock (HMC)
DESCRIPTION:Title: Connections between Iterative Methods for Linear Systems and Consensus Dynamics on Networks \nAbstract:\nThere is a well-established linear algebraic lens for studying consensus dynamics on networks\, which has yielded significant theoretical results in areas like distributed computing\, modeling of opinion dynamics\, and ranking methods.  Recently\, strong connections have been made between problems of consensus dynamics on networks and classical iterative methods in numerical linear algebra.  This talk will discuss an instance of these connections\, in particular between the gossip methods in distributed computing and the Kaczmarz methods in numerical linear algebra.  We will present theoretical convergence results\, empirical and numerical simulation results\, and discuss future work in applying these numerical linear algebraic techniques to broader and more complex consensus dynamics models\, especially those coming from opinion dynamics and ranking.
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-jamie-haddock-hmc/
LOCATION:Emmy Noether Room\, Estella 1021\, Pomona College\,\, 610 N. College Ave.\, 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:20220309T160000
DTEND;TZID=America/Los_Angeles:20220309T174500
DTSTAMP:20260409T005440
CREATED:20220307T083704Z
LAST-MODIFIED:20220307T083802Z
UID:2654-1646841600-1646847900@colleges.claremont.edu
SUMMARY:CCMS Field Committee Meeting
DESCRIPTION:The Field Committee Meeting is our chance to socialize with our colleagues and coordinate our course offerings for the coming academic year (2022-2023). Please come to discuss course offerings and other synergistic items. Refreshments in the Shanahan sunken courtyard at HMC starting at 4:00\, meeting in Shanahan B460 at 4:20. \nWe will be back in person for this meeting. A Zoom link will also be sent out\, for those unable to attend physically.
URL:https://colleges.claremont.edu/ccms/event/ccms-field-committee-meeting-2/
LOCATION:Shanahan B460\, Harvey Mudd College\, 301 Platt Blvd.\, Claremont\, CA\, 91711\, United States
CATEGORIES:Colloquium,Special Event
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220308T150000
DTEND;TZID=America/Los_Angeles:20220308T160000
DTSTAMP:20260409T005440
CREATED:20230913T075742Z
LAST-MODIFIED:20230913T075742Z
UID:3228-1646751600-1646755200@colleges.claremont.edu
SUMMARY:Systematically Detecting Flypes and Hexagonal Mosaics (Hugh Howards\, Wake Forest University)
DESCRIPTION:We talk about building knots using mosaics which were as introduced as a way of modeling quantum knots by Lomonaco and Kauffman and a newer variant\, hexagonal mosaics\, introduced by Jennifer McLoud-Mann. In the process we find a new bound on crossing numbers for hexagonal mosaics and find an infinite family of knots which do not achieve their hexagonal mosaic number while also in a projection which achieves their crossing number\, extending a result of Lew Ludwig et al. In the process we introduce a new tool which makes it easier to systematically recognize when two knots differ by a sequence of Flypes (for example\, giving a process to recognize that the Perko Pair were in fact the same knot). No background with mosaics or flypes is necessary. This is joint work with Jiong Li* and Xiotian Liu* (* indicates undergraduate students).
URL:https://colleges.claremont.edu/ccms/event/systematically-detecting-flypes-and-hexagonal-mosaics-hugh-howards-wake-forest-university/
LOCATION:Zoom
CATEGORIES:Topology Seminar
ORGANIZER;CN="Sam Nelson":MAILTO:snelson@cmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220308T123000
DTEND;TZID=America/Los_Angeles:20220308T132000
DTSTAMP:20260409T005440
CREATED:20220112T041154Z
LAST-MODIFIED:20220222T011851Z
UID:2527-1646742600-1646745600@colleges.claremont.edu
SUMMARY:Equidistribution of norm 1 elements in cyclic number fields (Kate Petersen\, University of Minnesota Duluth)
DESCRIPTION:By Hilbert’s theorem 90\, if K is a cyclic number field with Galois group generated by g\, then any element of norm 1 can be written as a/g(a).  This gives rise to a natural height function on elements of norm 1.  I’ll discuss equidistribution problems and show that these norm 1 elements are equidistributed (in an appropriate quotient) with respect to this height.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-kate-petersen-university-of-minnesota-duluth/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220302T161500
DTEND;TZID=America/Los_Angeles:20220302T173000
DTSTAMP:20260409T005440
CREATED:20220221T184448Z
LAST-MODIFIED:20220221T202722Z
UID:2631-1646237700-1646242200@colleges.claremont.edu
SUMMARY:On sparse geometry of numbers (Prof. Lenny Fukshansky)
DESCRIPTION:Title: On sparse geometry of numbers\n\nSpeaker: Prof. Lenny Fukshansky\, Department of Mathematics\, Claremont McKenna College\n\n\nAbstract: Geometry of Numbers is an area of mathematics pioneered by Hermann Minkowski at the end of the 19th century. He achieved stunning success introducing a novel geometric framework into the study of algebraic numbers\, prompting mathematicians of later generations to compare his work to “the story of Saul\, who set out to look for his father’s asses and discovered a Kingdom” (J. V. Armitage). In this talk\, we will look at some contemporary variations of Minkowski’s classical results that will take us on a journey from linear algebra and convex analysis to algebraic number theory and arithmetic geometry. This is joint work with P. Guerzhoy and S. Kuehnlein. \n\n\nLenny Fukshansky is a Professor of Mathematics at Claremont McKenna College. His work is at the intersection of number theory\, discrete geometry and geometric combinatorics. He is especially interested in lattices\, quadratic forms\, polynomials\, height functions and Diophantine problems. When not doing math\, Lenny loves biking in the mountains and drinking wine\, although tries not to do it simultaneously.
URL:https://colleges.claremont.edu/ccms/event/on-sparse-geometry-of-numbers/
LOCATION:Shanahan B460 (HMC) and Zoom – Hybrid
CATEGORIES:Colloquium
ORGANIZER;CN="Andrew Bernoff":MAILTO:ajb@hmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220301T150000
DTEND;TZID=America/Los_Angeles:20220301T160000
DTSTAMP:20260409T005440
CREATED:20230913T075541Z
LAST-MODIFIED:20230913T075541Z
UID:3226-1646146800-1646150400@colleges.claremont.edu
SUMMARY:Two-Bridge Knots Admit no Purely Cosmetic Surgeries (Thomas Mattman\, California State University\, Chico)
DESCRIPTION:(Joint with Ichihara\, Jong\, and Saito). We show that two-bridge knots admit no purely cosmetic surgeries\, ie no pair of distinct Dehn surgeries on such a knot produce 3-manifolds that are homeomorphic as oriented manifolds. Our argument is based on a recent result by Hanselman and a study of signature and finite type invariants of knots as well as the SL(2\,\C) Casson invariant.
URL:https://colleges.claremont.edu/ccms/event/two-bridge-knots-admit-no-purely-cosmetic-surgeries-thomas-mattman-california-state-university-chico/
LOCATION:Zoom
CATEGORIES:Topology Seminar
ORGANIZER;CN="Sam Nelson":MAILTO:snelson@cmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220301T123000
DTEND;TZID=America/Los_Angeles:20220301T132000
DTSTAMP:20260409T005440
CREATED:20220111T231348Z
LAST-MODIFIED:20220221T211055Z
UID:2524-1646137800-1646140800@colleges.claremont.edu
SUMMARY:Gap theorems for linear forms and for rotations on higher dimensional tori (Alan Haynes\, University of Houston)
DESCRIPTION:This talk is based on joint work with Jens Marklof\, and with Roland Roeder. The three distance theorem states that\, if x is any real number and N is any positive integer\, the points x\, 2x\, … \, Nx modulo 1 partition the unit interval into component intervals having at most 3 distinct lengths. We will present two higher dimensional analogues of this problem. In the first we consider points of the form mx+ny modulo 1\, where x and y are real numbers and m and n are integers taken from an expanding set in the plane. This version of the problem was previously studied by Geelen and Simpson\, Chevallier\, Erdős\, and many other people\, and it is closely related to the Littlewood conjecture in Diophantine approximation. The second version of the problem is a straightforward generalization to rotations on higher dimensional tori which\, surprisingly\, has been mostly overlooked in the literature. For the two dimensional torus\, we are able to prove a five distance theorem\, which is best possible. In higher dimensions we also have bounds\, but establishing optimal bounds is an open problem.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-alan-haynes-university-of-houston/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220228T161500
DTEND;TZID=America/Los_Angeles:20220228T171500
DTSTAMP:20260409T005440
CREATED:20220125T180406Z
LAST-MODIFIED:20220317T190247Z
UID:2558-1646064900-1646068500@colleges.claremont.edu
SUMMARY:Applied Math Seminar -- Illia Karabash (IAMM of NAS of Ukraine and TU Dortmund)
DESCRIPTION:Title: Pareto optimization of resonances and optimal control methods \nAbstract: \nFirst successes in fabrication of high-Q optical cavities two decades ago led to active applied physics and numerical studies of optimization problems involving resonances. The questions is how to design an open resonator that has an eigenvalue as close as possible to the real line under certain constraints. The analytic spectral optimization theory for such types of non-Hermitian eigenproblems is still in the stage of development. It is planned to explain briefly why the Pareto optimization settings are natural for non-Hermitian spectral problems\, and how the associated nonlinear Euler-Lagrange eigenproblems can be rigorously derived for the case of resonances in 1-d photonic crystals. Then we concentrate on the recently developed optimal control approach of (Karabash\, Koch\, Verbytskyi `20) and show how it is related to Pareto frontiers and Hamilton-Jacobi-Bellman PDEs. An application of Pontryagin Maximum Principle and a special method of minimum-time shooting to a line of no-return will be also discussed.
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-illia-karabash-tu-dortmund/
LOCATION:Emmy Noether Room\, Estella 1021\, Pomona College\,\, 610 N. College Ave.\, 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:20220223T161500
DTEND;TZID=America/Los_Angeles:20220223T173000
DTSTAMP:20260409T005440
CREATED:20220216T183109Z
LAST-MODIFIED:20220217T003329Z
UID:2626-1645632900-1645637400@colleges.claremont.edu
SUMMARY:Modeling  Zoonotic Infectious Diseases from Wildlife to Humans (Prof. Linda J. S. Allen)
DESCRIPTION:Title: Modeling  Zoonotic Infectious Diseases from Wildlife to Humans \nSpeaker: Prof. Linda J. S. Allen\, P. W. Horn Distinguished Professor Emeritus Texas Tech University \nAbstract: Zoonotic infectious diseases are diseases transmitted from animals to humans. It is estimated that over 60% of human infectious diseases are zoonotic. The Centers for Disease Control and Prevention has identified eight priority zoonoses in the US. Three of the priority zoonoses are avian influenza\, Lyme disease\, and emerging coronaviruses. Spillover of infections from animals to humans depends on a complex pathway from the natural wildlife reservoir.  The natural reservoir for avian influenza virus is wild birds but it is spread to humans from infected chickens. The natural reservoir for the bacterial pathogen causing Lyme disease is mice but it is transmitted to humans through the bite of an infected tick vector.    In this presentation\, we discuss a few of the modeling efforts to better understand the spread of infection in the natural reservoir and the spillover to humans as well as the impacts of demographic and environmental variability on timing of spillover.  \n___________________________________________________________________________________________________ \nLinda J. S. Allen received her PhD in Mathematics from University of Tennessee and was a Professor of Mathematics at Texas Tech University until 2019.  She is currently an Adjunct  Graduate Faculty at Texas Tech University. Her research interests are in mathematical ecology\, epidemiology\, and immunology.\nhttps://www.math.ttu.edu/~lallen/\nhttps://www.depts.ttu.edu/provost/scholars/lindaallen.php\n\nResearch Experiences for Undergraduates at Texas Tech University “Mathematical\, Statistical\, and Computational Methods for Problems in the Life Sciences”\n June 6-July 20\, 2022\n\nREU Applications Due: March 6\, 2022:\nhttps://www.math.ttu.edu/undergraduate/reu2022/
URL:https://colleges.claremont.edu/ccms/event/modeling-zoonotic-infectious-diseases-from-wildlife-to-humans-prof-linda-j-s-allen/
LOCATION:Zoom meeting\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Andrew Bernoff":MAILTO:ajb@hmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220216T161500
DTEND;TZID=America/Los_Angeles:20220216T173000
DTSTAMP:20260409T005440
CREATED:20220128T164956Z
LAST-MODIFIED:20220214T180454Z
UID:2577-1645028100-1645032600@colleges.claremont.edu
SUMMARY:Solving the Race in Backgammon (Prof. Arthur Benjamin)
DESCRIPTION:Title: Solving the Race in Backgammon\n \nSpeaker: Prof. Arthur Benjamin\nSmallwood Family Professor of Mathematics\nHarvey Mudd College\n \nAbstract: Backgammon is perhaps the oldest game that is still played today. It is a game that combines luck with skill\, where two players take turns rolling dice and decide how to move their checkers in the best possible way. It is the ultimate math game\, where players who possess a little bit of mathematical knowledge can have a big advantage over their opponents.  Players also have the opportunity to double the stakes of a game using something called the doubling cube\, which—when used optimally—leads to players winning more in the long run. Optimal use of the doubling cube relies on a player’s ability to estimate their winning chances at any stage of the game.\n\nWhen played to completion\, every game of backgammon eventually becomes a race\, where each player attempts to remove all of their checkers before their opponent does. The goal of our research is to be able to determine the optimal doubling cube action for any racing position\, and approximate the game winning chances for both sides. By calculating the Effective Pip Count for both players and identifying the positions’ Variance Types\, we arrive at a reasonably simple method for achieving this which is demonstrably superior to other popular methods.\n\n\n\n\nArthur Benjamin\, PhD\, Smallwood Family Professor of Mathematics\, is recognized nationally for his ability to perform rapid mental calculations. In 2020 he won the inaugural American Backgammon Tour Online (ABTO) with the best overall performance in a series of 17 national tournaments.  He has published several books on how to make math both fun and easy.  He is also a professional mathemagician and frequently performs at the Magic Castle in Hollywood and nationwide.
URL:https://colleges.claremont.edu/ccms/event/solving-the-race-in-backgammon-prof-arthur-benjamin/
LOCATION:Zoom meeting\, United States
CATEGORIES:Colloquium
ORGANIZER;CN="Andrew Bernoff":MAILTO:ajb@hmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220215T150000
DTEND;TZID=America/Los_Angeles:20220215T160000
DTSTAMP:20260409T005440
CREATED:20230913T075335Z
LAST-MODIFIED:20230913T075335Z
UID:3225-1644937200-1644940800@colleges.claremont.edu
SUMMARY:On Invariants for Surface-Links in Entropic Magmas via Marked Graph Diagrams (Seonmi Choi\, Kyungpook Natl U\, Korea)
DESCRIPTION:M. Niebrzydowski and J. H. Przytycki defined a Kauffman bracket magma and constructed the invariant P of framed links in 3-space. The invariant is closely related to the Kauffman bracket polynomial. The normalized bracket polynomial is obtained from the Kauffman bracket polynomial by the multiplication of indeterminate and it is an ambient isotopy invariant for links. In this talk\, we reformulate the multiplication by using a map from the set of framed links to a Kauffman bracket magma in order that P is invariant for links in 3-space. We define a generalization of a Kauffman bracket magma\, which is called a marked Kauffman bracket magma. We find the conditions to be invariant under Yoshikawa moves except the first one and use a map from the set of admissible marked graph diagrams to a marked Kauffman bracket magma to obtain the invariant for surface-links in 4-space.
URL:https://colleges.claremont.edu/ccms/event/on-invariants-for-surface-links-in-entropic-magmas-via-marked-graph-diagrams-seonmi-choi-kyungpook-natl-u-korea/
LOCATION:Zoom
CATEGORIES:Topology Seminar
ORGANIZER;CN="Sam Nelson":MAILTO:snelson@cmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220215T123000
DTEND;TZID=America/Los_Angeles:20220215T132000
DTSTAMP:20260409T005440
CREATED:20220119T153839Z
LAST-MODIFIED:20220210T023821Z
UID:2540-1644928200-1644931200@colleges.claremont.edu
SUMMARY:Recent trends in using representations in voting theory - committees and cyclic orders (Karl-Dieter Crisman\, Gordon College)
DESCRIPTION:One of the most important axioms in analyzing voting systems is that of “neutrality”\, which stipulates that the system should treat all candidates symmetrically. Even though this doesn’t always directly apply (such as in primary systems or those with intentional incumbent protection)\, it is extremely important both in theory and practice.If the voting systems in question additionally are tabulated using some sort of points\, we can translate the notion of neutrality into invariance under an action of the symmetric group on a vector space. This means we can exploit representation theory to analyze them\, and this has been successfully done in a number of social choice contexts from cooperative games to voting on full rankings.In this talk\, we describe recent progress in extending this technique to two interesting situations. First we consider work of Barcelo et al. on voting for committees of representatives (such as for departments in a college)\, where the wreath product of two symmetric groups comes into play. Then we look at work by Crisman et al. regarding voting on “cyclic orders”\, or ways to seat people around a table\, which implicitly has both left and right actions of the symmetric group to consider.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-karl-dieter-crisman-gordon-college/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220214T161500
DTEND;TZID=America/Los_Angeles:20220214T171500
DTSTAMP:20260409T005440
CREATED:20220125T182526Z
LAST-MODIFIED:20220125T182526Z
UID:2560-1644855300-1644858900@colleges.claremont.edu
SUMMARY:Applied Math Seminar -- Project Pitch Day
DESCRIPTION:
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-project-pitch-day/
LOCATION:Emmy Noether Room\, Estella 1021\, Pomona College\,\, 610 N. College Ave.\, 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:20220209T161500
DTEND;TZID=America/Los_Angeles:20220209T173000
DTSTAMP:20260409T005440
CREATED:20220131T170105Z
LAST-MODIFIED:20220131T170634Z
UID:2588-1644423300-1644427800@colleges.claremont.edu
SUMMARY:Modeling the waning and boosting of immunity (Prof. Lauren Childs)
DESCRIPTION:Title: Modeling the waning and boosting of immunity\n\n\nSpeaker: Dr. Lauren Childs\nAssistant Professor and the Cliff and Agnes Lilly Faculty Fellow\nVirgina Tech\n\n \nAbstract: Infectious disease often leads to significant loss of life and burden on society. Understanding disease dynamics is essential to the development and implementation of earlier and more effective interventions. Traditionally\, perfect\, long-lasting protection against disease is assumed to be acquired\, but this need not always be the case. Immunity following natural infection (or immunization) may wane\, increasing susceptibility with time since exposure. In this talk\, we begin by examining a classic model of waning and boosting immunity with a focus on the bifurcation structure and how it changes as reinfection is considered. Then\, we discuss an extension of this framework with an age- and immune status-dependent model of disease transmission. In this model\, susceptibility\, infectiousness\, and symptom severity all vary with immune status\, while age affects contacts and vaccination.  We examine applications of this model to two diseases: pertussis\, commonly known as whooping cough\, and COVID-19. For pertussis\, we examine age-specific incidence and prevalence and find vaccination leads to a resurgence of immunity-modified pertussis in older children\, as observed with effective vaccination programs. For COVID-19\, we examine the role of waning and boosting immunity to estimate seroprevalence in Canada and to evaluate vaccination strategies. We find a large fraction of the Canadian population with some immunity following infection or vaccination\, but that the quality and longevity of this immunity decreases with time. Using contact and demographic data from specific locations coupled with disease-specific parameterization\, our model has the potential to assist in the development and optimization of vaccination schedules. This is important to mitigate resurgence of immunity-modified disease due to natural boosting.\n\n\nDr. Lauren Childs is an Assistant Professor in the Department of Mathematics and the Cliff and Agnes Lilly Faculty Fellow in the College of Science at Virginia Tech. Her research focuses on developing and analyzing mathematical and computational models for a better understanding of the dynamics of infectious diseases\, in particular vector-borne diseases such as malaria. Her research emphasizes the interactions within a host organism\, such as between an invading pathogen and the immune response\, and the impacts of such interactions on transmission between individuals in the population.
URL:https://colleges.claremont.edu/ccms/event/modeling-the-waning-and-boosting-of-immunity-prof-lauren-childs/
LOCATION:Zoom
CATEGORIES:Colloquium
ORGANIZER;CN="Andrew Bernoff":MAILTO:ajb@hmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220208T150000
DTEND;TZID=America/Los_Angeles:20220208T160000
DTSTAMP:20260409T005440
CREATED:20230913T074942Z
LAST-MODIFIED:20230913T074942Z
UID:3223-1644332400-1644336000@colleges.claremont.edu
SUMMARY:Experimental Knot Music v2 (Sam Nelson\, CMC)
DESCRIPTION:In this talk I will recount the history of my knot theory-based music project and show an example of my method for creating music from knot homsets.
URL:https://colleges.claremont.edu/ccms/event/experimental-knot-music-v2-sam-nelson-cmc/
LOCATION:Zoom
CATEGORIES:Topology Seminar
ORGANIZER;CN="Sam Nelson":MAILTO:snelson@cmc.edu
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220208T123000
DTEND;TZID=America/Los_Angeles:20220208T132000
DTSTAMP:20260409T005440
CREATED:20220131T003643Z
LAST-MODIFIED:20220131T003643Z
UID:2585-1644323400-1644326400@colleges.claremont.edu
SUMMARY:Frame coherence and nearly orthogonal lattices (Lenny Fukshansky\, CMC)
DESCRIPTION:A frame in a Euclidean space is a spanning set\, which can be overdetermined. Large frames are used for redundant signal transmission\, which allows for error correction. An important parameter of frames is coherence\, which is maximal absolute value of the cosine of the angle between two frame vectors: the smaller it is\, the closer is the frame to being orthogonal\, which minimizes noise from overlapping frequencies in transmission. One good source frames with sufficiently low coherence comes from layers of minimal vectors in a lattice. We will discuss a particular class of so-called nearly orthogonal lattices\, which exhibits some interesting properties from the stand-point of coherence and other related optimization problems. This is joint work with David Kogan (CGU).
URL:https://colleges.claremont.edu/ccms/event/frame-coherence-and-nearly-orthogonal-lattices-lenny-fukshansky-cmc/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220207T161500
DTEND;TZID=America/Los_Angeles:20220207T171500
DTSTAMP:20260409T005440
CREATED:20220125T183035Z
LAST-MODIFIED:20220201T005247Z
UID:2565-1644250500-1644254100@colleges.claremont.edu
SUMMARY:Applied Math Seminar -- Yunied Puig de Dios (CMC)
DESCRIPTION:Title: Modern techniques to approach the invariant subspace problem \nAbstract:  The invariant subspace problem is by far one of the most important problems in operator theory. It has been open for more than half a century\, and there are many significant contributions with a huge variety of techniques\, making this challenging problem so interesting; however the solution seems to be nowhere in sight. In this talk we are going to present a technique born in the 90’s and developed in the last two decades that has contributed tremendously to approach the invariant subspace problem\, becoming a very popular branch of operator theory and functional analysis\, called linear dynamics.
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-yunied-puig-de-dios-cmc/
LOCATION:Emmy Noether Room\, Estella 1021\, Pomona College\,\, 610 N. College Ave.\, 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:20220202T161500
DTEND;TZID=America/Los_Angeles:20220202T173000
DTSTAMP:20260409T005440
CREATED:20220128T183638Z
LAST-MODIFIED:20220131T193506Z
UID:2581-1643818500-1643823000@colleges.claremont.edu
SUMMARY:Exploiting metric structure for more accurate classification (Prof. Mike Izbicki)
DESCRIPTION:Title: Exploiting metric structure for more accurate classification \nSpeaker: Mike Izbicki\, Department of Mathematical Sciences\, Claremont McKenna College \nAbstract: Classification problems often have many semantically similar classes.  For example\, the famous ImageNet dataset contains classes for 80 different dog breeds\, 40 different bird species\, and 25 types of vehicles.  This semantic structure can be formalized using a metric space\, with semantic similarity of classes encoded by the distance function.  In this talk\, I’ll describe the “tree loss”\, which is the first technique with provable performance guarantees for exploiting this metric structure.  I’ll also show that the tree loss has better empirical performance than competing algorithms on image\, text\, and vector data. \n\nMike studies machine learning theory\, focusing on applications to natural language and social media.  He has been at CMC for 3 years now\, where he teaches computer and data science classes.  Prior to his academic career\, Mike spent 7 years in the US Navy.  Highlights include converting >10g of Uranium into pure energy as a nuclear submarine officer\, and doing [redacted] for the NSA.  After leaving the navy\, Mike went to North Korea to teach computer science as part of an academic exchange program designed to improve relations between the US and North Korea.  He earned his phd from UC Riverside.
URL:https://colleges.claremont.edu/ccms/event/exploiting-metric-structure-for-more-accurate-classification-prof-mike-izbicki/
LOCATION:Zoom meeting\, United States
CATEGORIES:Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220201T123000
DTEND;TZID=America/Los_Angeles:20220201T132000
DTSTAMP:20260409T005440
CREATED:20220121T001428Z
LAST-MODIFIED:20220126T183034Z
UID:2543-1643718600-1643721600@colleges.claremont.edu
SUMMARY:Niho's last conjecture (Daniel Katz\, Cal State Northridge)
DESCRIPTION:A power permutation of a finite field F is a permutation of F whose functional form is x -> x^d for some exponent d.  Power permutations are used in cryptography\, and the exponent d must be chosen so that the permutation is highly nonlinear\, that is\, not easily approximated by linear functions.  The Walsh spectrum of a power permutation is a list of numbers measuring the correlation of our power permutation with the various linear functions. The last conjecture in Niho’s 1972 thesis considers a particular infinite family of highly nonlinear power permutations\, and states that each permutation in this family has a Walsh spectrum with at most five distinct values. Niho’s own techniques show that there are at most eight distinct values. Each of the eight candidate values corresponds to a possible number of distinct roots of a seventh degree polynomial on a subset of the finite field F called the unit circle. We use symmetry arguments to show that it is impossible to have four\, six\, or seven roots on the unit circle: this proves Niho’s last conjecture. This is joint work with Tor Helleseth and Chunlei Li.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-daniel-katz-cal-state-northridge/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220131T161500
DTEND;TZID=America/Los_Angeles:20220131T171500
DTSTAMP:20260409T005440
CREATED:20220116T203846Z
LAST-MODIFIED:20220118T032454Z
UID:2533-1643645700-1643649300@colleges.claremont.edu
SUMMARY:APPLIED MATH SEMINAR: Archetypal analysis by Professor Braxton Osting (University of Utah)
DESCRIPTION:Archetypal analysis is an unsupervised learning method that uses a convex polytope to summarize multivariate data. For fixed k\, the method finds a convex polytope with k vertices\, called archetype points\, such that the polytope is contained in the convex hull of the data and the mean squared distance between the data and the polytope is minimal. In this talk\, I’ll give an overview of the method and discuss connections to matrix factorization\, SVD/PCA\, and the k-means clustering method. I’ll discuss our recent results proving the consistency of archetypal analysis and describe probabilistic methods for approximate archetypal analysis. This is joint work with Ruijian Han\, Dong Wang\, Yiming Xu\, and Dominique Zosso.
URL:https://colleges.claremont.edu/ccms/event/applied-math-seminar-braxton-osting-university-of-utah/
LOCATION:CA
CATEGORIES:Applied Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220126T161500
DTEND;TZID=America/Los_Angeles:20220126T173000
DTSTAMP:20260409T005440
CREATED:20220121T013826Z
LAST-MODIFIED:20220121T212036Z
UID:2550-1643213700-1643218200@colleges.claremont.edu
SUMMARY:Using Stitching for faster sampling (Prof. Mark Huber)
DESCRIPTION:Title: Using Stitching for faster sampling \nSpeaker: Mark Huber\, Department of Mathematics\, Claremont McKenna College \nAbstract: Point processes are used to model location data\, such as the locations of trees in a forest\, or cities in a plain.  Repulsive point processes modify the basic model in order to obtain points that are farther apart from each other than would be expected if they were placed uniformly at random.  In order to understand the behavior of these models\, Monte Carlo methods are used\, which draw samples from the probabilistic model.  In this talk\, I’ll show how to draw from a particular example of a repulsive point process called the Strauss process for parameters that were never possible before.  The method is called stitching\, and is a type of divide-and-conquer algorithm that is surprisingly effective for these types of problems. \n\nHuber got his start in data science (before it was called that) at HMC (’94).  He then headed to Cornell and obtained his Ph.D. from the Operations Research and Industrial Engineering department.  After a postdoc at Stanford and a position at Duke\, he returned to the West Coast and is now the Fletcher Jones Foundation Professor of Mathematics and Statistics and George R. Roberts Fellow\, and the Program Director of Data Science and Computer Science at Claremont McKenna.  His third book\, “Probability Adventures”\, is now available.
URL:https://colleges.claremont.edu/ccms/event/using-stitching-for-faster-sampling-prof-mark-huber/
LOCATION:CA
CATEGORIES:Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220125T123000
DTEND;TZID=America/Los_Angeles:20220125T132000
DTSTAMP:20260409T005440
CREATED:20210907T183748Z
LAST-MODIFIED:20220119T170851Z
UID:2308-1643113800-1643116800@colleges.claremont.edu
SUMMARY:Questions on Symmetric Chains (Shahriar Shahriari\, Pomona)
DESCRIPTION:The set of subsets {1\, 3}\, {1\, 3\, 4}\, {1\, 3\, 4\, 6} is a symmetric chain in the partially ordered set (poset) of subsets of {1\,…\,6}. It is a chain\, because each of the subsets is a subset of the next one. It is symmetric because the collection has as many subsets with less than 3 elements as it has subsets with more than 3 elements (3 is half of 6\, the size of the original set). It is straightforward to partition the set of all subsets of {1\,…\,6} into symmetric chains. Such a partition is called a symmetric chain decomposition of the poset. We are interested in the following—admittedly curious sounding—question. What is the maximum integer k\, such that given any collection of k disjoint symmetric chains in the poset of subsets of a finite set\, we can enlarge the collection to a symmetric chain decomposition of the poset? I don’t know the answer\, but in this talk\, I will discuss a special case\, a number of related results and questions\, and provide some background on why symmetric chain decompositions are useful.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-shahriar-shahriari-pomona/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20211208T163000
DTEND;TZID=America/Los_Angeles:20211208T173000
DTSTAMP:20260409T005440
CREATED:20211104T163615Z
LAST-MODIFIED:20211110T164207Z
UID:2462-1638981000-1638984600@colleges.claremont.edu
SUMMARY:Where do Putnam problems come from? (Prof. Andrew Bernoff)
DESCRIPTION:Title: Where do Putnam problems come from? \nSpeaker: Andrew Bernoff\, Department of Mathematics\, Harvey Mudd College \nAbstract: The William Lowell Putnam Exam is the preeminent mathematics competition for undergraduate college students in the United States and Canada. I recently finished a three year stint on the competition’s problem committee. This talk is a personal reflection on where Putnam problems come from. I’ll discuss three problems which can loosely be described as: \n\na mathematician’s viewpoint on axe throwing\,\na model for how chickens establish a pecking order inspired by a high school math competition and a subsequent tweet by Jordan Ellenberg\, and\na covering problem that arose from a generalization of several previous Putnam problems viewed through the lens of a mathematician obsessed with the Fourier transform.\n\nI’ll close with some observations about best practices and pitfalls to avoid when constructing an exam whether it be for a class or a competition. \n\nAndrew Bernoff is a Professor of Mathematics at Harvey Mudd College. While his research concentrates on using dynamical systems methods to understand experiments and natural phenomena\, he has a longstanding interest in recreational mathematics and problem solving. As an undergraduate at MIT he ran the first Integration Bee\, a tradition that has now continued for over four decades. More recently he just finished a three year stint on the William Lowell Putnam Exam’s problem committee.
URL:https://colleges.claremont.edu/ccms/event/where-do-putnam-problems-come-from-prof-andrew-bernoff/
LOCATION:CA
CATEGORIES:Colloquium
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20211207T123000
DTEND;TZID=America/Los_Angeles:20211207T132000
DTSTAMP:20260409T005440
CREATED:20210907T183311Z
LAST-MODIFIED:20211130T221522Z
UID:2304-1638880200-1638883200@colleges.claremont.edu
SUMMARY:Difference sets in higher dimensions (David Conlon\, Cal Tech)
DESCRIPTION:Let d >= 2 be a natural number. We determine the minimum possible size of the difference set A-A in terms of |A| for any sufficiently large finite subset A of R^d that is not contained in a translate of a hyperplane. By a construction of Stanchescu\, this is best possible and thus resolves an old question first raised by Uhrin. Joint work with Jeck Lim.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-david-conlon-cal-tech/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
END:VCALENDAR