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: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
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20230404T121500
DTEND;TZID=America/Los_Angeles:20230404T131000
DTSTAMP:20260418T111643
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:20230411T121500
DTEND;TZID=America/Los_Angeles:20230411T131000
DTSTAMP:20260418T111643
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:20230418T121500
DTEND;TZID=America/Los_Angeles:20230418T131000
DTSTAMP:20260418T111643
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:20230425T121500
DTEND;TZID=America/Los_Angeles:20230425T131000
DTSTAMP:20260418T111643
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
END:VCALENDAR