Colin Tang

activity

20232026

most citedSimplex slicing: an asymptotically-sharp lower bound

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

collaborators

Showing 2026Show all

3 papers · 1 filter

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 $B (0, r) \subseteq K \subseteq B (0, R)$ in $R^{n}$ 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 $k$ -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 $L_{p}$ -norm of sums of independent exponential random variables with fixed variance, for $p \geq 2$ , thus extending Hunter's positivity theor…