DateSpeakerTopic
July 13, 2016
11:00-12:00
N. Narayanan, Dept of Maths,
IIT-Madras
Binomial regularity of trees
July 11, 2016
14:00-15:00
Vaidy Sivaraman,
SUNY, Binghamton
Forbidden Induced Subgraph Characterizations
Autumn 2016  
March 29, 2016
14:00-15:30
Niranjan Balachandran,
IIT Bombay
Rational Exponents in Extremal Graph Theory
March 01, 2016
14:00-15:30
Niranjan Balachandran,
IIT Bombay
Random Algebraic Constructions
February 23, 2016
14:00-15:30
Srikanth Srinivasan,
IIT Bombay
Constructive discrepancy minimization of convex sets
February 16, 2016
14:00-15:30
Srikanth Srinivasan,
IIT Bombay
A derandomization of Lovasz's algorithm for Perfect Matching
February 02, 2016,
14:00-15:30
Niranjan Balachandran,
IIT Bombay
The number of parts in an $\epsilon$-regular partition grows as a tower of 2's of height $\Omega(1/epsilon^c)$ for some absolute constant c.
November 2,
16:00-17:00
Eshita Mazumdar,
HRI Allahabad
On a modification of Griffiths' method
October 28,
11:30-12:30
Ashish Mishra,
IIT Bombay
Studies in the representation theory of G wreath S_n
July 31,
14:00-15:00
Srikanth Srinivasan,
IIT Bombay
Meta algorithms and circuit lower bounds
Spring 2015  
March 20,
15:30-16:30
Xavier G. Viennot,
University of Bordeaux
Tamari lattice and its extensions
March 12,
14:30-16:00
Niranjan Balachandran,
IIT Bombay
On a problem of Erdos and Lovasz: Random lines in a projective plane
February 26,
14:00-15:30
Kaushik Majumder,
ISI Bangalore
On maximum number of points in a maximal intersecting family of finite sets
February 19,
14:30-16:00
Ashish Mishra,
IIT Bombay
Wreath product action on generalized Boolean algebras
February 12,
14:30-16:00
Murali Srinivasan,
IIT Bombay
On the representation theory of G wreath S_n
January 29,
14:30-16:00
Srikanth Srinivasan,
IIT Bombay
Monotone circuit lower bounds
January 14,
14:15-15:45
Madhu Sudan,
Microsoft
Low-Degree Testing
Fall 2014  
September 19,
14:00-15:00
Niranjan Balachandran,
IIT Bombay
An extremal problem in Graph theory and hardness of additive approximation for edge deletion problems - II
September 12,
14:00-15:00
Niranjan Balachandran,
IIT Bombay
An extremal problem in Graph theory and hardness of additive approximation for edge deletion problems
July 17,
16:30-17:30
Frederique Oggier,
Nanyang Technological University
On generalized rank weights
Spring 2014  
April 15,
13:45-14:45
Srikanth Srinivasan,
IIT Bombay
Shifted partial derivatives in arithmetic circuit complexity
April 10,
14:30-15:30
Rahul Santhanam,
University of Edinburgh
The Complexity of Explicit Constructions
March 25,
13:45-14:45
Srikanth Srinivasan,
IIT Bombay
How to write the determinant efficiently as a sum of products of linear functions
March 18,
13:45-14:45
Niranjan Balachandran,
IIT Bombay
The absorption technique
March 11,
13:45-14:45
Anand Srivastav,
University of Kiel
Randomized Algorithms for Set Covering Problems in Hypergraphs
March 04,
13:45-14:45
Srikanth Srinivasan,
IIT Bombay
A probabilistic existence theorem for designs
February 25,
13:45-14:45
Niranjan Balachandran,
IIT Bombay
Almost Steiner Designs
February 11,
13:45-14:45
Niranjan Balachandran,
IIT Bombay
The Design Problem I: The Erdos-Hanani Conjecture (cont'd)
February 04,
13:45-14:45
Niranjan Balachandran,
IIT Bombay
The Design Problem I: The Erdos-Hanani Conjecture
January 28,
13:45-14:45
Srikanth Srinivasan,
IIT Bombay
Bipartite Ramanujan Graphs - II
January 21,
13:50-14:50
Srikanth Srinivasan,
IIT Bombay
Bipartite Ramanujan Graphs
Fall 2013  
November 07,
13:50-14:50
Srikanth Srinivasan,
IIT Bombay
Expanders: Constructions and Applications - III
October 24,
13:50-14:50
Srikanth Srinivasan,
IIT Bombay
Expanders: Constructions and Applications - II
October 10,
14:00-15:00
Srikanth Srinivasan,
IIT Bombay
Expanders: Constructions and Applications - I
October 03,
14:00-15:00
Krishnan Sivasubramanian,
IIT Bombay
Affine Permutations of Type A (II)
October 01,
14:00-15:00
Parikshit Gopalan,
Microsift Research
Locally Testable codes and Cayley Graphs
September 26,
14:00-15:00
Krishnan Sivasubramanian,
IIT Bombay
Affine Permutations of Type A
September 19,
14:00-15:00
Murali K. Srinivasan,
IIT Bombay
Some new upper bounds on binary code size
September 05,
14:00-15:00
Murali K. Srinivasan,
IIT Bombay
The Goldman-Rota identity and the Grassmann scheme
August 29,
14:00-15:00
Murali K. Srinivasan,
IIT Bombay
A bijective proof problem on the spanning trees of the Grassmann graphs II
August 22,
14:00-15:00
Murali K. Srinivasan,
IIT Bombay
A bijective proof problem on the spanning trees of the Grassmann graphs
August 01,
14:00-15:00
Dhruv Mubayi,
University of Illinois at Chicago
Hypergraph Ramsey Problems
April 19,
09:30-10:30
Niranjan Balachandran,
IIT Bombay
A Hypergraph Regularity Lemma a la Gowers - Part 2
April 12,
09:30-10:30
Niranjan Balachandran,
IIT Bombay
A Hypergraph Regularity Lemma a la Gowers
April 05,
09:30-10:30
Srikanth Srinivasan,
IIT Bombay
The Szemeredi Regularity Lemma - Some Applications (Contd.)
February 13,
14:00-15:30
Xavier G. Viennot,
University of Bordeaux
A Short Course on Combinatorics and Physics: The Cellular Ansatz
February 08,
09:30-11:00
Xavier G. Viennot,
University of Bordeaux
A Short Course on Combinatorics and Physics: The Cellular Ansatz
February 06,
14:00-15:30
Xavier G. Viennot, CNRS-LaBRI at the University of Bordeaux, France A Short Course on Combinatorics and Physics: The Cellular Ansatz
February 01,
09:30-11:00
Xavier G. Viennot,
University of Bordeaux
A Short Course on Combinatorics and Physics: The Cellular Ansatz
January 21,
14:00-15:30
Xavier G. Viennot,
University of Bordeaux
A Short Course on Combinatorics and Physics: The Cellular Ansatz
January 18,
09:30-11:00
Xavier G. Viennot,
University of Bordeaux
A Short Course on Combinatorics and Physics: The Cellular Ansatz
January 16,
14:00-15:30
Xavier G. Viennot,
University of Bordeaux
A Short Course on Combinatorics and Physics: The Cellular Ansatz
January 11,
09:30-11:00
Xavier G. Viennot,
University of Bordeaux
A Short Course on Combinatorics and Physics: The Cellular Ansatz
January 07,
16:00-17:00
Xavier G. Viennot,
University of Bordeaux
A Short Course on Combinatorics and Physics: The Cellular Ansatz
December 26,
15:30-16:30
Richard Wilson,
California Institute of Technology
A lemma on polynomials modulo $p^m$ and applications to coding theory
October 26,
16:00-17:00
Srikanth Srinivasan,
IIT Bombay
Algorithmic Aspects of the Lovasz Local Lemma (contd.)
August 13,
17:00-18:00
Mokshay Madiman,
Yale University
An entropy-based sumset calculus for discrete and continuous settings
June 29,
15:30-16:30
Srikanth Srinivasan,
IAS Princeton
The Hardness of the Noncommutative Determinant
November 08,
16:30-17:30
Anand Srivastav,
University of Kiel
Quantum-Evolutionary Computation of the Discrepancy of Arithmetic Progressions
August 26,
10:30-11:30
Martin Charles Golumbic,
University of Haifa
"Algorithmic Graph Theory and its Applications: Twenty Five Years of EPT Graphs"
February 01,
15:30-16:30
Marcelo Aguiar,
University of Texas A & M
Hopf Algebras in Topology, Combinatorics, and Representation Theory
February 04,
15:30-16:30
Marcelo Aguiar,
University of Texas A & M
The Hopf Monoid of Generalized Permutahedra Theory
October 23,
16:00-17:00
Ravindra B. Bapat,
Indian Statistical Institute, New Delhi
Interplay of Ranks of Submatrices
November 28,
16:00-17:00
Ravindra B. Bapat,
Indian Statistical Institute, New Delhi
Distance Matrix of a Tree and Beyond