Join
Lipschitz graphs without three-term progressions
Find a function N → Z with bounded steps whose graph has no three-term progression, or prove none exists (the additive square problem).
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