About Me



Ahoy there! My name is Stefan Grosser, and I am a PhD student in Computer Science at McGill studying under Robert Robere. My research interests are in proof complexity, communication complexity, and extremal combinatorics.

I had the absolute privilege of working with Hamed Hatami and Sergey Norin for my Master's in Mathematics at McGill, and Alejandro Morales during my final year at UMass Amherst.

If I'm not doing math or programming, you'll find me swing dancing, climbing, baking, playing my oud, or drinking a cup of tea.


Papers: 
                 - arXiv link, SIAM link
                 - JMM 2019 poster. Won the MAA Outstanding Poster Award
                 - Poster at FPSAC 2022


Surveys and Lecture Notes:
Mentoring:
  • Directed Reading Project on Crossing Numbers
    • Massimo Vicenzo

Teaching:
  • Teaching Assistant for Comp 330 (Theory of Computation) at McGill, Winter 2022
  • Teaching Assistant for Comp 360 (Algorithm Design and Analysis) at McGill, Fall 2021
  • Teaching Assistant for Math 240 (Discrete Mathematics) at McGill, Winter 2021
  • Teaching Assistant for Comp 251 (Algorithms and Data Structures) at McGill, Winter 2020
  • Teaching Assistant for Math 140 (Calculus 1) at McGill, Fall 2019
  • Teaching Assistant for Math 300 (Intro to Proofs) at UMass Amherst, Fall 2018
  • Grader for CS 311 (Intro to Algorithms) at UMass Amherst, Fall 2016, Fall 2017 and Spring 2018
  • Grader for CS 501 (Formal Language Theory) at UMass Amherst, Spring 2017

Projects:
  • Google Summer of Code 2020: Adding Efficient Counting of Linear Extensions to SageMath
           - Mentored by Travis Scrimshaw

Github


Seminars:


Contact me at myfirstname.mylastname @ mail.mcgill.ca

Comments

Post a Comment

Popular posts from this blog

The Catalan Grenade is Accepting Papers!

As an inaugural post to this blog, I will announce that I am perpetually accepting papers! Here at the Catalan Grenade, I'll be going through papers on cool results, old and new, in Combinatorics and Algebra. Currently, I am a recent graduate from UMass Amherst (Fall 2018), and am waiting to hear back from grad schools. This seems like a fun way to pass the time.
Read more

Extension Complexity Part II - Classifying Nonnegative Rank by Randomized Communication

A classical result from Yannakakis states that $$\text{xc}(P) = \text{rank}_+(S),$$ where \(P\) is a polytope with slack matrix \(S\). Yannakakis further showed that with nondeterministic communication complexity, one can give a lower bound for the nonnegative rank. This lower bound is sufficient to prove that some polytopes, like the correlation polytope, have exponential extension complexity. However, it fails for many other examples.  In a 2013 paper, "Extended formulations, nonnegative factorizations, and randomized communication protocols," by Faenza, Fiorini, Grappe, and Tiwary, they show that a model of randomized communication complexity can not only lower bound nonnegative rank, but exactly characterize it.  In my communication complexity reading group, I gave a talk presenting this paper and its results. The proofs are extremely elegant and simple, making for a very enjoyable read.  For those interested, here is a link to my lecture notes! 
Read more

Extension Complexity

 Last week I gave an introductory lecture on extension complexity for my communication complexity reading group. It is a fascinating topic, discussing if a polytope with exponentially many facets might be described as a linear projection from a higher dimensional polytope with polynomially many facets. Specifically, the extension complexity is defined as xc(P) := min{# facets of Q : Q projects to P}.  A classical example of this would be the permutohedron  with dimension N; it has 2^N - 2 facets, but there is a polytope in dimension N^2 + N with O(N^2) facets which projects to the permutohedron. I covered this example, as well as Yannakakis' theorem, which shows an equivalence between extension complexity and nonnegative rank of a certain matrix. I also highlight a connection with communication complexity, which will be expanded upon in the upcoming semester. I hope to give more in-depth lectures, with the intent of covering Rothvoss' 2017 result on exponential lower bounds for
Read more