Zihan Tan
zihantan09.bsky.social
Zihan Tan
@zihantan09.bsky.social
Assistant Professor at UMN CS, interested in theoretical computer science.
Reposted by Zihan Tan
A thread with distributed/parallel papers from the FOCS 2025 list of accepted papers that I was able to find on arXiv… focs.computer.org/2025/accepte...
Accepted Papers – FOCS 2025
focs.computer.org
July 14, 2025 at 7:41 AM
Reposted by Zihan Tan
Jonathan Conroy and Arnold Filtser have recently solved the padded decomposition problem for minor-free graphs, one of my favorite open problems. Congratulations to both!

Their paper here: arxiv.org/abs/2504.00278

My take: minorfree.github.io/PaddedSolved/
How to Protect Yourself from Threatening Skeletons: Optimal Padded Decompositions for Minor-Free Graphs
Roughly, a metric space has padding parameter $β$ if for every $Δ>0$, there is a stochastic decomposition of the metric points into clusters of diameter at most $Δ$ such that every ball of radius $γΔ$...
arxiv.org
April 13, 2025 at 9:48 PM
Reposted by Zihan Tan
I am happy to announce that the Kakeya set conjecture, one of the most sought after open problems in geometric measure theory, has now been proven (in three dimensions) by Hong Wang and Joshua Zahl! arxiv.org/abs/2502.17655 I discuss some ideas of the proof at terrytao.wordpress.com/2025/02/25/t...
Volume estimates for unions of convex sets, and the Kakeya set conjecture in three dimensions
We study sets of $δ$ tubes in $\mathbb{R}^3$, with the property that not too many tubes can be contained inside a common convex set $V$. We show that the union of tubes from such a set must have almos...
arxiv.org
February 26, 2025 at 4:49 AM
Reposted by Zihan Tan
New post on additive spanners. Oustanding open problem: construct a +4 spanner with O(n^{4/3}) edges.
Additive Spanners | Rambling on Graphs
minorfree.github.io
November 24, 2024 at 9:24 PM