{
  "id": "oai:papers.qnfo.org:why-vertices-not-points-vertex-anchored-braiding-stabilizer-arithmetic-and-displ",
  "slug": "why-vertices-not-points-vertex-anchored-braiding-stabilizer-arithmetic-and-displ",
  "title": "Why Vertices, Not Points? Vertex-Anchored Braiding, Stabilizer Arithmetic, and Displacement Gaps on Bruhat–Tits Buildings",
  "authors": [
    "Rowan Brad Quni-Gudzinas"
  ],
  "abstract": "Bruhat–Tits buildings are the canonical combinatorial-geometric objects attached to reductive groups over non-Archimedean local fields, and the recent QNFO constructions of p-adic braid groups [12], p-adic anyon models [13], and a p-adic Temperley–Lieb parameter [14] anchor their discrete braiding data at the vertex set of the building rather than at arbitrary points of its geometric realization. This paper answers the question posed in the title with a combination of exact arithmetic and explicit metric computation in the rank-one case, where the building of SL₂ over ℚ_p is a (p+1)-regular tree. We compute ball growth exactly (for p = 3: a radius-2 ball contains 17 vertices and 16 edges; a radius-3 ball contains 53 vertices and 52 edges), we compute the finite stabilizer layers exactly (|SL₂(𝔽_p)| = p(p²−1), edge-stabilizer index p+1, pro-p Iwahori filtration index p²−1), and we compute a displacement gap: a point at distance d from the nearest vertex is moved by exactly 2d by the Weyl element of the vertex stabilizer, so the covering radius of the vertex set is 1/2 and any vertex-stabilizer-equivariant structure supported in a ball of radius r < 1/2 is vertex-supported. We show that the vertex set is the unique G-orbit whose stabilizer surjects onto the full finite group SL₂(𝔽_p), yielding p+1 fusion channels per vertex, while generic edge points cost a stabilizer factor of p+1, collapse the finite layer to the Borel of order p(p−1), and supply no new braid generators. Limitations (rank one, finite radius, projected higher-rank bounds) and falsification criteria are stated explicitly.",
  "abstract_markdown": "Bruhat–Tits buildings are the canonical combinatorial-geometric objects attached to reductive groups over non-Archimedean local fields, and the recent QNFO constructions of p-adic braid groups [12], p-adic anyon models [13], and a p-adic Temperley–Lieb parameter [14] anchor their discrete braiding data at the *vertex set* of the building rather than at arbitrary points of its geometric realization. This paper answers the question posed in the title with a combination of exact arithmetic and explicit metric computation in the rank-one case, where the building of SL₂ over ℚ_p is a (p+1)-regular tree. We compute ball growth exactly (for p = 3: a radius-2 ball contains 17 vertices and 16 edges; a radius-3 ball contains 53 vertices and 52 edges), we compute the finite stabilizer layers exactly (|SL₂(𝔽_p)| = p(p²−1), edge-stabilizer index p+1, pro-p Iwahori filtration index p²−1), and we compute a displacement gap: a point at distance d from the nearest vertex is moved by exactly 2d by the Weyl element of the vertex stabilizer, so the covering radius of the vertex set is 1/2 and any vertex-stabilizer-equivariant structure supported in a ball of radius r < 1/2 is vertex-supported. We show that the vertex set is the unique G-orbit whose stabilizer surjects onto the full finite group SL₂(𝔽_p), yielding p+1 fusion channels per vertex, while generic edge points cost a stabilizer factor of p+1, collapse the finite layer to the Borel of order p(p−1), and supply no new braid generators. Limitations (rank one, finite radius, projected higher-rank bounds) and falsification criteria are stated explicitly.",
  "date": "2026-10-02",
  "first_published": "2026-10-02",
  "last_revised": "2026-10-02T00:00:00Z",
  "modified": "2026-10-02T00:00:00Z",
  "version": "1.0.0",
  "version_count": 1,
  "language": "en",
  "keywords": [],
  "quality_tags": [
    "High-quality scholarly research",
    "open-access scholarly work",
    "versioned research publication"
  ],
  "quality_label": "High-quality scholarly research",
  "quality_basis": "QNFO publisher classification for open-access, versioned research with a public revision history and reader correction channel; this is not a claim of independent peer review.",
  "quality_evidence_url": "https://qnfo.org/about",
  "peer_review_status": "Not independently peer-reviewed",
  "resource_type": "ScholarlyArticle",
  "doi": null,
  "doi_url": null,
  "url": "https://papers.qnfo.org/papers/why-vertices-not-points-vertex-anchored-braiding-stabilizer-arithmetic-and-displ",
  "license_url": "https://legal.qnfo.org/",
  "license_spdx": null,
  "sha256": "a843819e02c78230630d6df8adbd055e5aac133b19a865ea73ea0ea668f8d3d9",
  "version_url": "https://papers.qnfo.org/papers/why-vertices-not-points-vertex-anchored-braiding-stabilizer-arithmetic-and-displ/v/1.0.0",
  "datacite": {
    "schemaVersion": "http://datacite.org/schema/kernel-4",
    "identifiers": [
      {
        "identifier": "https://papers.qnfo.org/papers/why-vertices-not-points-vertex-anchored-braiding-stabilizer-arithmetic-and-displ",
        "identifierType": "URL"
      }
    ],
    "creators": [
      {
        "name": "Rowan Brad Quni-Gudzinas",
        "nameType": "Personal",
        "nameIdentifiers": [
          {
            "nameIdentifier": "https://orcid.org/0009-0002-4317-5604",
            "nameIdentifierScheme": "ORCID",
            "schemeUri": "https://orcid.org"
          }
        ]
      }
    ],
    "titles": [
      {
        "title": "Why Vertices, Not Points? Vertex-Anchored Braiding, Stabilizer Arithmetic, and Displacement Gaps on Bruhat–Tits Buildings"
      }
    ],
    "publisher": "QNFO",
    "publicationYear": "2026",
    "resourceType": {
      "resourceTypeGeneral": "Text",
      "resourceType": "ScholarlyArticle"
    },
    "subjects": [
      {
        "subject": "High-quality scholarly research",
        "subjectScheme": "QNFO publisher classification",
        "schemeUri": "https://qnfo.org/about"
      },
      {
        "subject": "open-access scholarly work",
        "subjectScheme": "QNFO publisher classification",
        "schemeUri": "https://qnfo.org/about"
      },
      {
        "subject": "versioned research publication",
        "subjectScheme": "QNFO publisher classification",
        "schemeUri": "https://qnfo.org/about"
      }
    ],
    "dates": [
      {
        "date": "2026-10-02",
        "dateType": "Issued"
      },
      {
        "date": "2026-10-02",
        "dateType": "Updated"
      }
    ],
    "language": "en",
    "version": "1.0.0",
    "rightsList": [
      {
        "rightsUri": "https://legal.qnfo.org/"
      }
    ],
    "descriptions": [
      {
        "description": "Bruhat–Tits buildings are the canonical combinatorial-geometric objects attached to reductive groups over non-Archimedean local fields, and the recent QNFO constructions of p-adic braid groups [12], p-adic anyon models [13], and a p-adic Temperley–Lieb parameter [14] anchor their discrete braiding data at the vertex set of the building rather than at arbitrary points of its geometric realization. This paper answers the question posed in the title with a combination of exact arithmetic and explicit metric computation in the rank-one case, where the building of SL₂ over ℚ_p is a (p+1)-regular tree. We compute ball growth exactly (for p = 3: a radius-2 ball contains 17 vertices and 16 edges; a radius-3 ball contains 53 vertices and 52 edges), we compute the finite stabilizer layers exactly (|SL₂(𝔽_p)| = p(p²−1), edge-stabilizer index p+1, pro-p Iwahori filtration index p²−1), and we compute a displacement gap: a point at distance d from the nearest vertex is moved by exactly 2d by the Weyl element of the vertex stabilizer, so the covering radius of the vertex set is 1/2 and any vertex-stabilizer-equivariant structure supported in a ball of radius r < 1/2 is vertex-supported. We show that the vertex set is the unique G-orbit whose stabilizer surjects onto the full finite group SL₂(𝔽_p), yielding p+1 fusion channels per vertex, while generic edge points cost a stabilizer factor of p+1, collapse the finite layer to the Borel of order p(p−1), and supply no new braid generators. Limitations (rank one, finite radius, projected higher-rank bounds) and falsification criteria are stated explicitly.",
        "descriptionType": "Abstract"
      },
      {
        "description": "Publisher quality classification: High-quality scholarly research. QNFO publisher classification for open-access, versioned research with a public revision history and reader correction channel; this is not a claim of independent peer review.",
        "descriptionType": "Other"
      },
      {
        "description": "Peer review status: Not independently peer-reviewed",
        "descriptionType": "Other"
      }
    ],
    "formats": [
      "text/html"
    ]
  }
}