tech/python
Show
-
Essay
A first-person, code-heavy companion to the preprint Near-Critical First-Moment Lower Bounds for Growing-Radius Domination in Random Regular Graphs. Rather than reproducing its theorem-and-proof form, this page traces where the problem came from — a cops-and-robbers hypergraph question that collapsed into a domination bound — why the answer carries an unnecessary coupon-collector logarithm, and how a chain of computational detours (a failed concavity conjecture, a catastrophic cancellation, an independent audit that caught a stale constant) repeatedly redirected the proof before it reached its final shape.