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: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:20230418T121500
DTEND;TZID=America/Los_Angeles:20230418T131000
DTSTAMP:20260422T221220
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
END:VCALENDAR