The curse of the Euclidean metric:

Krzysztof Fleszar posts about a big difficulty with algorithms for problems like Euclidean shortest paths where the answer is a sum of distances: we don't know how to compare two solutions efficiently.

Krzysztof's SODA 2019 paper on approximate TSP of hyperplanes (find a short tour that touches each given hyperplane) is — fortunately in this case it's possible to use approximate numerical comparisons.

Paul Erdős died in 1996, but his most recent paper is from 2015, nearly 20 years later! There's a writeup at; the paper itself is

It's about Egyptian fractions – representations of rationals as sums of distinct unit fractions – and is motivated by the conjecture that it's always possible for all denominators to be semiprime. That's still open, but they prove that every integer has a representation with all denominators products of three primes.


Generalistic and moderated instance. All opinions are welcome, but hate speeches are prohibited. Users who don't respect rules will be silenced or suspended, depending on the violation severity.