Kevin Pratt

activity

20162025

most citedRigidity of Circle Polyhedra in the 2-Sphere and of Hyperideal Polyhedra in Hyperbolic 3-Space

3 citations · 7 across the 6 of their papers we have counts for

collaborators

11 papers

cs.DS2025

(Approximate) Matrix Multiplication via Convolutions

Yahel Uffenheimer, Omri Weinstein

We study the capability of the Fast Fourier Transform (FFT) to accelerate exact and approximate matrix multiplication without using Strassen-like divide-and-conquer. We present a s…

cs.DS2025

A note on Ordered Ruzsa-Szemerédi graphs

Kevin Pratt

A recent breakthrough of Behnezhad and Ghafari [FOCS 2024] and subsequent work of Assadi, Khanna, and Kiss [SODA 2025] gave algorithms for the fully dynamic $(1 - ε)$ -appro…

math.GR2024

Finite matrix multiplication algorithms from infinite groups

Jonah Blasiak, Henry Cohn, Joshua A. Grochow +2

The Cohn-Umans (FOCS '03) group-theoretic framework for matrix multiplication produces fast matrix multiplication algorithms from three subsets of a finite group $G$ satisfying a s…

math.CO2022★ 1 cited

A Note on Slice Rank and Matchings in Groups

Kevin Pratt

A multiplicative 3-matching in a group $G$ is a triple of sets ${a_{i}}, {b_{i}}, {c_{i}} \subset G$ such that $a_{i} b_{j} c_{k} = 1$ if and only if $i = j = k$ . Here we record the fact that…

math.GR2022★ 2 cited

Matrix multiplication via matrix groups

Jonah Blasiak, Henry Cohn, Joshua A. Grochow +2

In 2003, Cohn and Umans proposed a group-theoretic approach to bounding the exponent of matrix multiplication. Previous work within this approach ruled out certain families of grou…

cs.DM2022

High-Dimensional Expanders from Chevalley Groups

Ryan O'Donnell, Kevin Pratt

Let $Φ$ be an irreducible root system (other than $G_{2}$ ) of rank at least $2$ , let $F$ be a finite field with $p = char F > 3$ , and let $\mathrm{G}…