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, bounded arithmetic,  communication complexity, and extremal combinatorics.

From January through May 2023, I was a visiting graduate student at the Simons Institute for the Meta-Complexity program.

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 climbing, baking, playing my oud, or drinking a cup of tea.


Papers: 

  • On Student-Teacher Games and Consequences of Provability
    •        - [Submitted] Joint work with Marco Carmosino
                 - 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

My CV

Seminars:


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

Comments

Post a Comment

Popular posts from this blog

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

Learning Bounded Arithmetic -- A Guide from a Novice

Bounded Arithmetic is a field of mathematical logic which, very roughly, studies subtheories of Peano Arithmetic that "correspond" with reasoning associated with computational complexity classes or propositional proof systems. Correspond here can mean multiple things, but the two most common interpretations would be the prized Witnessing Theorems or Paris-Wilkies Propositional Translations. At the Simons Institute program for Meta Complexity this winter, many attendants (including myself) wished to learn bounded arithmetic due to its increasing appearances and connections with other areas of complexity. Marco Carmosino, Oliver Korten, and Jan Pich organized a bounded arithmetic reading group to go through many elementary and recent works in bounded arithmetic, with a preference towards those results relating to meta complexity. However, with the creation of the reading group, a running joke was spawned: " I won't define this bounded arithmetic theory " Every we
Read more

Google Summer of Code 2020: D-Complete and Mobile Posets

In this post, I thought I'd overview the work of  my first paper , which has just recently been accepted to SIDMA.  In order theory, a linear extension of a partially ordered set P is a totally ordered set L which respects the original ordering P. Many famous problems can be converted into counting the number of linear extensions. For example, the number of standard Young tableaux of a given shape is equivalent to the number of linear extensions of a poset with the same shape. Unfortunately, it is #P-complete in general to count linear extensions (even for posets of height 2!). However, there are famous classes of posets like Young diagrams (or more generally, d-complete posets), which have efficient computation. In our paper, we presented a new class of posets called mobiles that have determinant formulas for counting linear extensions and generalize d-complete posets and ribbon posets. Since this past summer converted me into a shut-in, I decided to spend some of that extra time
Read more