Organizers: Igor Pak (UCLA) and Greta Panova (USC).
Format: Two or three 30 min talks with 15 min breaks between them reserved for meet and greet, and various math discussions.
Time: Tuesdays, 9:30-10, and 10:15-10:45
(all times Los Angeles).
See also this time zone converter for your local time.
Location: Zoom meeting ID: 965 6429 0758
Passcode: 4-digit number abcd, such that e=2.7abcd.
Warning: You must be registered under your name to be admitted.
Abstracts: see Research Seminars page.
Videos: see our YouTube channel.
Goals of the Seminar:
10:15 – Christian Ikenmeyer (University of Liverpool, UK)
The Computational Complexity of Plethysm Coefficients,
Abstract,
Paper,
Slides,
Video.
10:15 – Javier Tadashi Akagi (National University of Asunción, San Lorenzo, Paraguay)
Hard and Easy Instances of L-Tromino Tilings,
Abstract,
Paper,
Slides,
Video.
09:30 – Vladimir Podolskii (Steklov Mathematical Institute and HSE University, Moscow, Russia)
Max-plus polynomials and their roots,
Abstract,
Paper,
Slides,
Video.
10:15 – Markus Bläser (Saarland University, Saarbrücken, Germany)
Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory,
Abstract,
Paper,
Slides, Video.
10:15 – Igor Shinkar (Simon Fraser University, BC, Canada)
On Percolation and NP-Hardness, Abstract,
Paper (see also this paper),
Slides,
Video.
09:30 – Arnaud De Mesmay (LIGM, Université Paris Est, France)
Link crossing number is NP-hard, Abstract, Paper,
Slides,
Video.
10:15 – Zuzana Patáková (Charles University, Prague, Czech Republic)
Shellability is NP-complete, Abstract, Paper, Slides,
Video.
09:30 – Peter
Bürgisser (TU Berlin, Germany)
Complexity of computing zeros of structured polynomial systems,
Abstract,
Paper,
Slides,
Video.
10:15 – Christoph Haase (UCL, London, UK)
On the size of finite rational matrix semigroups,
Abstract,
Paper,
Slides,
Video.
09:30 – Meirav Zehavi (BGU, Beer Sheba, Israel)
Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds, Abstract, Paper,
Slides,
Video.
10:15 – Cris Moore (Santa Fe Institute, NM)
Percolation is Odd, Abstract,
Paper,
Slides,
Video.
10:15 – Joshua Grochow (University of Colorado at Boulder)
Designing Strassen's algorithm for matrix multiplication, Abstract,
Paper,
Slides,
Video.
09:30 – Yuri Rabinovich (University of Haifa, Israel)
Large simple cycles in dense simplicial complexes,
Abstract, Paper,
Slides, Video.
10:15 – Giovanni Paolini (AWS and Caltech)
How to collapse a simplicial complex: theory and practice,
Abstract,
Paper,
Slides,
Video.
10:15 – 10:45, Bhaskar DasGupta (UIC)
Removing partisan bias in redistricting: computational complexity meets the science of gerrymandering,
Abstract,
Paper,
Slides.
11:00 – 11:30, Dustin G. Mixon (OSU, Columbus, OH)
The Mathematics of Partisan Gerrymandering,
Abstract,
Paper,
Slides,
Video.
Return to Igor Pak Home Page or Greta Panova Home Page.
Click below to e-mail Igor or Greta and delete .zzz
Last updated: 11/24/2020