Article Instance

HTTP 200 OK
Allow: GET
Content-Type: application/json
Vary: Accept

{
    "pk": 64988,
    "title": "A framework unifying some bijections for graphs and its connection to Lawrence polytopes",
    "subtitle": null,
    "abstract": "Let \\(G\\) be a connected graph. The Jacobian group (also known as the Picard group or sandpile group) of \\(G\\) is a finite abelian group whose cardinality equals the number of spanning trees of \\(G\\). The Jacobian group admits a canonical simply transitive action on the set \\(\\mathcal{R}(G)\\) of cycle-cocycle reversal classes of orientations of \\(G\\). Hence one can construct combinatorial bijections between spanning trees of \\(G\\) and \\(\\mathcal{R}(G)\\) to build connections between spanning trees and the Jacobian group. The BBY bijections and the Bernardi bijections are two important examples. In this paper, we construct a new family of such bijections that includes both. Our bijections depend on a pair of atlases (different from the ones in manifold theory) that abstract and generalize certain common features of the two known bijections. The definitions of these atlases are derived from triangulations and dissections of the Lawrence polytopes associated to \\(G\\). The acyclic cycle signatures and cocycle signatures used to define the BBY bijections correspond to regular triangulations. Our bijections can extend to subgraph-orientation correspondences. Most of our results hold for regular matroids. We present our work in the language of fourientations, which are a generalization of orientations.\n \nMathematics Subject Classifications: 05C30, 05C25, 52B05, 52C40\n \nKeywords: Sandpile group, cycle-cocycle reversal class, Lawrence polytope, triangulation, dissection, fourientation",
    "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": "Sandpile group"
        },
        {
            "word": "cycle-cocycle reversal class"
        },
        {
            "word": "Lawrence polytope"
        },
        {
            "word": "triangulation"
        },
        {
            "word": "dissection"
        },
        {
            "word": "fourientation"
        }
    ],
    "section": "Research Articles",
    "is_remote": true,
    "remote_url": "https://escholarship.org/uc/item/4hk2k3kp",
    "frozenauthors": [
        {
            "first_name": "Changxin",
            "middle_name": "",
            "last_name": "Ding",
            "name_suffix": "",
            "institution": "School of Mathematics, Georgia Institute of Technology, U.S.A.",
            "department": ""
        }
    ],
    "date_submitted": "2025-07-16T00:18:59+09:00",
    "date_accepted": "2025-07-16T00:18:59+09:00",
    "date_published": "2025-07-15T16:00:00+09:00",
    "render_galley": null,
    "galleys": [
        {
            "label": "",
            "type": "pdf",
            "path": "https://journalpub.escholarship.org/combinatorial_theory/article/64988/galley/49798/download/"
        }
    ]
}