{
  "annotation_id": "c3408b1b-cbb6-400d-a0bc-d12745bff3d8",
  "date_created": "2026-02-17T05:53:04.448000Z",
  "date_modified": "2026-02-17T05:53:04.448000Z",
  "file_hash": "344218fb7e3415aeed64a9477eccc0c9f3381e7ee55b8488efa3105604f74f58",
  "private": false,
  "record": {
    "abstract": "We study a quantitative Ramsey-type problem on 3-term arithmetic progressions: how should the set of integers $[n] = \\{1, 2, \\dots, n\\}$ be colored using 3 colors in order to maximize the number of rainbow 3-term arithmetic progressions? By \"rainbow\", we mean progressions whose elements are each assigned a distinct color. We determine a lower bound for this question and upper and lower bounds when $[n]$ is replaced with the integers modulo $n$, including an exact maximum when $n$ is a multiple of 3.",
    "arxiv_id": "2601.05442",
    "authors": [
      "Gabriel Elvin",
      "Alexis Gonzales",
      "Alejandro Rodriguez",
      "Israel Wilbur"
    ],
    "categories": [
      "math.CO"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "title": "Bounds on Arithmetic Rainbow Ramsey Multiplicities",
    "url": "https://arxiv.org/abs/2601.05442",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "c78f4bfa-40a9-4f70-b719-3fb5a8ac7ac4",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}