9 citations · 18 across the 10 of their papers we have counts for
16 papers
Regularity lemma for Gaussian polynomials
Chris Jones
We prove a regularity lemma for polynomials with fixed degree and any number of standard Gaussian input variables. Following modern approaches to the Szemer{é}di regularity lem…
Sharper Bounds for the Complex Grothendieck Constant
Steven Heilman, Chris Jones, Giulio Malavolta
We show that , where is the complex Grothendieck constant. The upper bound improves on Haagerup's bound of $1.40490913\ldots…
Universality of first-order methods on random and deterministic matrices
Nicola Gorini, Chris Jones, Dmitriy Kunisky +1
General first-order methods (GFOM) are a flexible class of iterative algorithms which update a state vector by matrix-vector multiplications and entrywise nonlinearities. A long li…
The Grothendieck Constant is Strictly Larger than Davie-Reeds' Bound
Chris Jones, Giulio Malavolta
The Grothendieck constant is a fundamental quantity in functional analysis, with important connections to quantum information, combinatorial optimization, and the geometry…
Sparsest cut and eigenvalue multiplicities on low degree Abelian Cayley graphs
Tommaso d'Orsi, Chris Jones, Jake Ruotolo +2
Whether or not the Sparsest Cut problem admits an efficient -approximation algorithm is a fundamental algorithmic question with connections to geometry and the Unique Games C…
Low-degree Security of the Planted Random Subgraph Problem
Andrej Bogdanov, Chris Jones, Alon Rosen +1
The planted random subgraph detection conjecture of Abram et al. (TCC 2023) asserts the pseudorandomness of a pair of graphs , where is an Erdos-Renyi random graph on $…