Curvy Boundaries Rewrite the Rules of Packing

When mathematicians map the geometry of four-dimensional spaces, they often pretend that the game is all about neat, rigid shapes. The new work by Cristofaro-Gardiner, Magill, and McDuff crashes that illusion with a playful reminder: a boundary that isn’t perfectly straight—curvy in just the right way—can swing the entire outcome of a packing problem. The…

Read More

When Substrings Cross a Point and Surprise Us

On the surface, counting substrings seems like a dusty corner of theoretical computer science—the sort of puzzle you expect to be solved with clever tricks and careful bookkeeping. But the paper counting distinct (non-)crossing substrings by Umezaki, Shibata, Köppl, Nakashima, Inenaga, and Bannai from Kyushu University and collaborators reframes this classic task as a lens…

Read More

Unlocking the Secrets of Constraint Programming: How GPUs are Revolutionizing Problem Solving

Imagine a world where complex problems, those that currently take hours or even days to solve using traditional computers, can be tackled in mere minutes. This isn’t science fiction; it’s the promise of a groundbreaking approach to constraint programming, a field at the heart of many technological advancements, from scheduling and logistics to artificial intelligence….

Read More