Real zeros and the alternatingly increasing property *starts at 10:30 a.m. sharp*
|
Real zeros and the alternatingly increasing property *starts at 10:30 a.m. sharp*

Room 116

Details of Real zeros and the alternatingly increasing property *starts at 10:30 a.m. sharp*
Determinantal representations of hyperbolic polynomials
|
Determinantal representations of hyperbolic polynomials

Room 116

Details of Determinantal representations of hyperbolic polynomials
Problems in Matrix Variables: A Taste of Noncommutative (Convex) Algebraic Geometry *starts at 10:15 a.m. sharp*
|
Problems in Matrix Variables: A Taste of Noncommutative (Convex) Algebraic Geometry *starts at 10:15 a.m. sharp*

Room 116

Details of Problems in Matrix Variables: A Taste of Noncommutative (Convex) Algebraic Geometry *starts at 10:15 a.m. sharp*
Colouring locally sparse graphs via the hard-core model
|
Colouring locally sparse graphs via the hard-core model

Room 116

Details of Colouring locally sparse graphs via the hard-core model
Ground states and Hyperuniformity properties for models of interacting gas. 
|
Ground states and Hyperuniformity properties for models of interacting gas. 

Room 116

Details of Ground states and Hyperuniformity properties for models of interacting gas. 
Next mini course: McMullen’s polytope algebra
|
Next mini course: McMullen’s polytope algebra

Room 146

Details of Next mini course: McMullen’s polytope algebra
Modified log-Sobolev inequalities for strongly log-concave distributions *starts at 10:30 a.m. sharp*
|
Modified log-Sobolev inequalities for strongly log-concave distributions *starts at 10:30 a.m. sharp*

Room 116

Details of Modified log-Sobolev inequalities for strongly log-concave distributions *starts at 10:30 a.m. sharp*
A Ramsey-type Theorem on the Max-Cut Value of d-Regular Graphs *starts at 10:30 a.m. sharp*
|
A Ramsey-type Theorem on the Max-Cut Value of d-Regular Graphs *starts at 10:30 a.m. sharp*

Room 116

Details of A Ramsey-type Theorem on the Max-Cut Value of d-Regular Graphs *starts at 10:30 a.m. sharp*
Problem Solving Day #2
|
Problem Solving Day #2

Calvin Lab auditorium

Details of Problem Solving Day #2
Bethe approximation is an optimization-based framework for approximating partition functions, with roots in statistical physics. *starts at 10:30 a.m. sharp*
|
Bethe approximation is an optimization-based framework for approximating partition functions, with roots in statistical physics. *starts at 10:30 a.m. sharp*

Room 116

Details of Bethe approximation is an optimization-based framework for approximating partition functions, with roots in statistical physics. *starts at 10:30 a.m. sharp*