Title: Communication Complexity of Randomness Manipulation
Abstract: The task of manipulating randomness has been a subject of
intense investigation in computational complexity with dispersers,
extractors, pseudorandom generators, condensers, mergers being just a
few of the objects of interest. All these tasks consider a single
processor massaging random samples from an unknown source.
In this talk I will talk about a less studied setting where randomness
is distributed among different players who would like to convert this
randomness to others forms with relatively little communication. For
instance players may be given access to a source of biased correlated
bits, and their goal may be to get a common random bit out of this
source. Even in the setting where the source is known this can lead to
some interesting questions that have been explored since the 70s with
striking constructions and some suprisingly hard questions. After
giving some background, I will describe a recent work which explores
the task of extracting common randomness from correlated sources with
bounds on the number of rounds of interaction.
Based on joint work with Mitali Bafna (Harvard), Badih Ghazi (Google)
and Noah Golowich (Harvard).
Time:
4:00pm
Location:
Ramanujan Hall, Department of Mathematics
Description:
CACAAG Seminar
Speaker: Srikanth Srinivasan.
Time: Thursday, June 6, 4pm.
Venue: Ramanujan Hall.
Title: Algebraic complexity theory and connections to Hilbert functions
(Lecture III).
Abstract: In a few lectures, I will introduce some of the main
problems in Algebraic Complexity theory and some of the techniques
that have been used to make progress on them. The techniques are
closely related to Hilbert functions and Young flattenings.
Time:
4:00pm
Location:
Ramanujan Hall, Department of Mathematics
Description:
Speaker: Dr. Uday Sharma, IISER Pune.
Date & Time: 21st of June, 2019, Friday, 4:00 PM.
Venue: Ramanujan Hall.
Title: Simultaneous conjugacy classes of commuting tuples
Abstract: In this seminar, I will talk about the classification of tuples
of commuting matrices over a finite field, upto simultaneous conjugation.
Time:
5:00pm
Location:
Room No105 , Department of Mathematics
Description:
Mathematics Colloquium
Date and Time: 5:00pm, Wednesday 26 June, 2019.
Venue: Room No.105 Department of Mathematics
Speaker: Dilip Patil, IISc, Bangalore.
Title: On the number of rational points on real algebraic varieties.
ABSTRACT. The main result of this colloquium is the equality of the
number of K-rational points with the signature of the trace form of a
finite K-algebra over a real closed field K. The main tools are symmetric
bilinear forms, Hermitian forms, trace forms, generalized trace forms and
their types and signatures. Further, we prove a criterion for the
existence of K-rational points by using generalized trace forms. As an
application we prove the Pederson-Roy-Szpirglas theorem about counting
common real zeros of real polynomial equations.