activity
20232026
most citedSimplex slicing: an asymptotically-sharp lower bound

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

collaborators

9 papers

cs.DS2026

Near-Optimal Oracle Bounds for Isotropic Rounding

Yang P. Liu, Richard Peng, Alicia Stepin +1

We give optimal bounds, up to polylogarithmic factors, for rounding convex bodies to near-isotropic position. A convex body in can be rou…

cs.DS2026

Faster high-accuracy multicommodity flow in dense graphs

Chenxin Dai, Alicia Stepin, Colin Tang

We give a fast algorithm for solving min-cost -commodity flow. The basic idea is to construct an auxiliary linear program that has low rank and whose minimum value is at most $1…

math.PR2026

Moments of sums of exponentials, beyond CHS

Silouanos Brazitikos, Colin Tang, Tomasz Tkocz

We establish a sharp lower bound on the -norm of sums of independent exponential random variables with fixed variance, for , thus extending Hunter's positivity theor…

cs.DS2025

Adaptive Matrix Sparsification and Applications to Empirical Risk Minimization

Yang P. Liu, Richard Peng, Colin Tang +2

Consider the empirical risk minimization (ERM) problem, which is stated as follows. Let be compact convex sets with for $i \in [m…

math.PR2025

Khinchin inequalities for uniforms on spheres with a deficit

Jacek Jakimiuk, Colin Tang, Tomasz Tkocz

We sharpen the moment comparison inequalities with sharp constants for sums of random vectors uniform on Euclidean spheres, providing a deficit term (optimal in high dimensions).

math.MG2025

From simplex slicing to sharp reverse Hölder inequalities

James Melbourne, Michael Roysdon, Colin Tang +1

Simplex slicing (Webb, 1996) is a sharp upper bound on the volume of central hyperplane sections of the regular simplex. We extend this to sharp bounds in the probabilistic framewo…

math.MG2024★ 2 cited

Simplex slicing: an asymptotically-sharp lower bound

Colin Tang

We show that for the regular n-simplex, the 1-codimensional central slice that's parallel to a facet will achieve the minimum area (up to a 1-o(1) factor) among all 1-codimensional…

math.MG2024

Stability of simplex slicing

Serhii Myroshnychenko, Colin Tang, Kateryna Tatarko +1

We establish dimension-free stability of Webb's sharp simplex slicing (1996). Incidentally, we investigate Lipschitzness of volume of hyperplane central sections of arbitrary (not…

math.CO2023

Hinged-rulers fold in

Colin Tang

A hinged-ruler is a sequence of line segments in the plane joined end-to-end with hinges, so each hinge joins exactly two segments, the first segment and last segment are adjacent…