{"schema":"vela.problem-packet.v0.1","problem":503,"statement":"What is the size of the largest $A\\subseteq \\mathbb{R}^d$ such that every three points from $A$ determine an isosceles triangle? That is, for any three points $x,y,z$ from $A$, at least two of the distances $\\lvert x-y\\rvert,\\lvert y-z\\rvert,\\lvert x-z\\rvert$ are equal.","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A175769","name":"Maximum cardinality of isosceles sets in E^n.","terms":"3,6,8,11,17,28,30,45","url":"https://oeis.org/A175769"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}