Metraipolis › archive › dc_51409e22656a
Multiform Longest Edge Bisection of Tetrahedra via Sextuple Permutations — arXiv:2609.26522
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.26522
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T15:55:35.372Z
- SHA-256 of the archived text
b3496ffbc94d21b5c20cfbd2708dff82e5e630c58523b5641cdfed8c5f9f654b- Stable URL of this page
https://metraipolis.com/documento/dc_51409e22656a
How to cite
Multiform Longest Edge Bisection of Tetrahedra via Sextuple Permutations — arXiv:2609.26522 — arXiv (en), https://arxiv.org/abs/2609.26522 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_51409e22656a (Metraipolis archive dc_51409e22656a, sha256 b3496ffbc94d21b5c20cfbd2708dff82e5e630c58523b5641cdfed8c5f9f654b)
BibTeX
@misc{dc51409e22656a,
title = {Multiform Longest Edge Bisection of Tetrahedra via Sextuple Permutations — arXiv:2609.26522},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.26522},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_51409e22656a; sha256 b3496ffbc94d21b5c20cfbd2708dff82e5e630c58523b5641cdfed8c5f9f654b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.26522. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We introduce a new formulation of the Longest Edge Bisection (LEB) of tetrahedra entirely in sextuple space R6, where tetrahedra are represented by the squares of their edge lengths. This representation renders the LEB refinement equations fully linear and eliminates the need for coordinate-based data structures. A central difficulty in three-dimensional LEB arises when a tetrahedron possesses multiple longest edges, making the refinement rule intrinsically multivalued. We formalize this phenomenon through the notion of Multiform Longest Edge Bisection (MLEB), which systematically explores all admissible longest-edge choices. To encode this multivalued behavior, we introduce the concept of bisection patterns, defined as sequences of sextuple permutations governing the refinement process. We prove that the set of sextuples sharing a common LEB pattern forms a convex region in R6. For structurally significant families of tetrahedra, including the R1+ family and the Liu-Joe family, we show that the infinite refinement tree collapses into a finite directed graph with eight states. Remarkably, both families are governed by the same graph, differing only in their initial state. This directed-graph formulation provides a unified combinatorial description of the refinement process and offers an efficient computational framework for deep iterative LEB analysis. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.NA). Categorie arXiv: Computational Geometry (cs.CG) ; Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2609.26522 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T15:15:47.533Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).