{
  "annotation_id": "868b759c-719d-42e5-badb-5cc92d678368",
  "date_created": "2026-02-17T05:53:19.847000Z",
  "date_modified": "2026-02-17T05:53:19.847000Z",
  "file_hash": "11145d825e65993ff24932aad374c447fcd9088633679fec0e50eaa042cd0aa4",
  "private": false,
  "record": {
    "abstract": "Chip-firing on a directed graph is a game in which chips, a discrete commodity, are placed on the vertices of the graph and are transferred between vertices. In this paper, we study a chip-firing game on the Hasse diagram of the lattice of nonnegative integer points on the plane, where we start with $2^n$ chips at the origin. When we fire a vertex $v$, we send one chip to each out-neighbor. We fire until we reach a stable configuration, a distribution of chips where no vertex can fire.\n  We study the intermediate firing configuration: a table that assigns to each vertex the total number of chips that pass through it. We prove that the nonzero entries of the stable configuration correspond to the odd entries of the intermediate configuration. The intermediate configuration consists of three parts: the top triangle, the midsection, and the bottom triangle. We describe properties of each part. We study properties of each row and the number of rows of the intermediate configuration. We also explore properties of the difference tables, which are tables of first differences of each row of the intermediate firing configuration.",
    "arxiv_id": "2601.09125",
    "authors": [
      "Ryota Inagaki",
      "Tanya Khovanova",
      "Austin Luo"
    ],
    "categories": [
      "math.CO"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "title": "Chip-firing on the Lattice of Nonnegative Integer Points",
    "url": "https://arxiv.org/abs/2601.09125",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "fd4a9a67-06f9-46ca-9403-5310824c9b53",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}