API Endpoint for journals.

GET /api/articles/65011/?format=api
HTTP 200 OK
Allow: GET
Content-Type: application/json
Vary: Accept

{
    "pk": 65011,
    "title": "Improved stability for the size and structure of iterated sumsets in \\(\\mathbb{Z}^d\\)",
    "subtitle": null,
    "abstract": "Let \\(A \\subset \\mathbb{Z}^d\\) be a finite set. It is known that the sumset \\(NA\\) has predictable size (\\(\\vert NA\\vert = P_A(N)\\) for some \\(P_A(X) \\in \\mathbb{Q}[X]\\)) and structure (all of the lattice points in some finite cone other than all of the lattice points in a finite collection of exceptional subcones), once \\(N\\) is larger than some threshold. In previous work, the first effective bounds for both of these thresholds were established, for an arbitrary set \\(A\\). In this article we substantially improve each of these bounds, coming much closer to the corresponding lower bounds known.\n \nMathematics Subject Classifications: 11P21, 05B10, 11B13, 11P70, 05A16\n \nKeywords: Sumsets, Set addition, Khovanskii polynomial, Structure Theorem, Explicit Bounds",
    "language": "en",
    "license": {
        "name": "Creative Commons Attribution 4.0",
        "short_name": "CC BY 4.0",
        "text": "Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.\n\nNo additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.",
        "url": "https://creativecommons.org/licenses/by/4.0"
    },
    "keywords": [
        {
            "word": "Sumsets"
        },
        {
            "word": "Set addition"
        },
        {
            "word": "Khovanskii polynomial"
        },
        {
            "word": "Structure Theorem"
        },
        {
            "word": "Explicit Bounds"
        }
    ],
    "section": "Research Articles",
    "is_remote": true,
    "remote_url": "https://escholarship.org/uc/item/590022kx",
    "frozenauthors": [
        {
            "first_name": "Andrew",
            "middle_name": "",
            "last_name": "Granville",
            "name_suffix": "",
            "institution": "Université de Montréal, Montréal, Canada",
            "department": ""
        },
        {
            "first_name": "Jack",
            "middle_name": "",
            "last_name": "Smith",
            "name_suffix": "",
            "institution": "University of Cambridge, U.K.",
            "department": ""
        },
        {
            "first_name": "Aled",
            "middle_name": "",
            "last_name": "Walker",
            "name_suffix": "",
            "institution": "King's College London, U.K.",
            "department": ""
        }
    ],
    "date_submitted": "2025-09-12T13:09:16Z",
    "date_accepted": "2025-09-12T13:09:16Z",
    "date_published": "2025-09-15T07:00:00Z",
    "render_galley": null,
    "galleys": [
        {
            "label": "",
            "type": "pdf",
            "path": "https://journalpub.escholarship.org/combinatorial_theory/article/65011/galley/49821/download/"
        }
    ]
}