Dmitry Rybin (@DmitryRybin1)

Dinitz-Garg-Goemans conjecture is false. This graph theory problem was open for ~30 years. The graph below has fractional flow cost 58. Any unsplittable flow (with capacity violation &lt;=15) has cost at least 60. Chat with GPT 5.6 Pro where this was found: <a target="_blank" href="https://chatgpt...

We discovered faster way to compute product of matrix by its transpose! This has profound implications for data analysis, chip design, wireless communication, and LLM training! paper: <a target="_blank" href="https://arxiv.org/abs/2505.09814" color="blue">arxiv.org/abs/2505.09814</a> The algorith...