Fri, September 13, 2019
Public Access Category: All |
|||||||||||||||||||||
|
- Time:
- 11:00am-12:00pm
- Location:
- Room No.215, Department of Mathematics
- Description:
- Combinatorics seminar.
Speaker: Niranjan Balachandran.
Affiliation: IIT Bombay.
Date and Time: Friday 13 September, 11:00 am - 12:00 pm.
Venue: Room No.215, Department of Mathematics.
Title: Equiangular lines in R^d.
Abstract: Suppose $0<\alpha<1$. The problem of determining the size of a
maximum set of lines (through the origin) in R^d s.t. the angle between
any two of them is arccos(\alpha) has been one of interest in
combinatorial geometry for a while now (since the mid 60s). Recently,
Yufei Zhao and some of his students settled this in a strong form. We will
see a proof of this result. The proof is a linear algebraic argument and
should be accessible to all grad students.
- Time:
- 4:30pm-5:30pm
- Location:
- Ramanujan Hall, Department of Mathematics
- Description:
- CACAAG seminar.
Speaker: Maria Mathew.
Affiliation: IIT Bombay.
Date and Time: Friday 13 September, 4:30 pm - 5:30 pm.
Venue: Ramanujan Hall, Department of Mathematics.
Title: Gubeladze's geometric proof of Anderson's conjecture (Lecture II).
Abstract: Let M be a finitely generated seminormal submonoid of the free
monoid \mathbb Z_+^n and let k be a field. Then Anderson conjectured that
all finitely generated projective modules over the monoid algebra k[M] is
free. He proved this in case n=2. Gubeladze proved this for all n using
the geometry of polytopes. In a series of 3 lectures, we will outline a
proof of this theorem.