3 papers
math.OC2023
Sparse Graphical Designs via Linear Programming
Hessa Al-Thani, Catherine Babecki, J. Carlos Martínez Mori
Graphical designs are a framework for sampling and numerical integration of functions on graphs. In this note, we introduce a method to address the trade-off between graphical desi…
cs.DM2023
Spectrahedral Geometry of Graph Sparsifiers
Catherine Babecki, Stefan Steinerberger, Rekha R. Thomas
We propose an approach to graph sparsification based on the idea of preserving the smallest eigenvalues and eigenvectors of the Graph Laplacian. This is motivated by the fact t…
math.NT2016
Higher Order Smallest Parts Functions and Rank-Crank Moment Inequalities from Bailey Pairs
Catherine Babecki, Chris Jennings-Shaffer, Geoffrey Sangston
We generalize a result of Garvan on inequalities and interpretations of the moments of the partition rank and crank functions. In particular for nearly 30 Bailey pairs, we introduc…