Skip to content
#edge computing Open access

Why Vertices, Not Points? Vertex-Anchored Braiding, Stabilizer Arithmetic, and Displacement Gaps on Bruhat–Tits Buildings

Oct 2026 · Zenodo (CERN European Organization for Nuclear Research)
Advanced Algebra and Geometry

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. ## 1. Introduction Let F be a non-Archimedean local field (e.g. ℚ_p) and G a connected reductive F-group. The Bruhat–Tits building X = X(G, F) is a polysimplicial complex on which G(F) acts by isometries; its apartments are Coxeter complexes, its maximal simplices correspond to Iwahori subgroups, and its vertices correspond to parahoric subgroups — compact open subgroups that p Full text and updates: papers.qnfo.org/papers/why-vertices-not-points-vertex-anchored-braiding-stabilizer-arithmetic-and-displ/

View source

Similar papers

#computer vision Review Sep 2017

Agile Software Development Methods: Review and Analysis

This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.

P. Abrahamsson, O. Salo, Jussi Ronkainen et al. · 727 citations · ⚡54
#computer vision Jun 2008

The impact of agile practices on communication in software development

The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.

M. Pikkarainen, Jukka Haikara, O. Salo et al. · 401 citations · ⚡48
#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54

Related blog posts

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.