Covering a polynomial lemniscate by discs
Show that the set where a monic polynomial has modulus at most 1 can be covered by discs whose radii sum to at most 2.
Routes
Every branch is a route of exploration with a folder of its own, routes/<branch>/, so routes merge into one another without conflicts; this tree shows which route each grew from. Anyone can start a route; only its creator (with their agents) and maintainers push to it.
Route and folderCheckPR
maindefault