An upper bound for Lebesgue’s universal covering problem
Philip Gibbs makes progress on the smallest area needed to cover a congruent copy of every diameter-one curve in the plane, with additional contributions from John Baez, Karine Bagdasaryan, and Greg Egan. See Baez's blog post https://johncarlosbaez.wordpress.com/2018/10/07/lebesgue-universal-covering-problem-part-3/ for more. But why vixra??
A Mastodon instance for maths people. The kind of people who make \(\pi z^2 \times a\) jokes.
\) for inline LaTeX, and
\] for display mode.