Metraipolis › archive › dc_565b15d324d3
Uniform Computability of Isotypic Block Diagonalization for Finite-Group Representations — arXiv:2610.02547
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.02547
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T08:47:50.001Z
- SHA-256 of the archived text
171e69e229eb4216f1f49900085e5d6e35af3e30718b467b51ebcdbdbf0b8497- Stable URL of this page
https://metraipolis.com/documento/dc_565b15d324d3
How to cite
Uniform Computability of Isotypic Block Diagonalization for Finite-Group Representations — arXiv:2610.02547 — arXiv (en), https://arxiv.org/abs/2610.02547 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_565b15d324d3 (Metraipolis archive dc_565b15d324d3, sha256 171e69e229eb4216f1f49900085e5d6e35af3e30718b467b51ebcdbdbf0b8497)
BibTeX
@misc{dc565b15d324d3,
title = {Uniform Computability of Isotypic Block Diagonalization for Finite-Group Representations — arXiv:2610.02547},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.02547},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_565b15d324d3; sha256 171e69e229eb4216f1f49900085e5d6e35af3e30718b467b51ebcdbdbf0b8497},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.02547. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the universal isotypic block-diagonalization problem in the Type-2 theory of effectivity (TTE). We obtain a uniform computability result for the universal block diagonalizer for commutants of given finite group representations. As an application, when the given representation is orthogonal, we compute ordinary $QR$ factorizations blockwise in the isotypic basis. After transforming back to the original coordinates this yields a factorization $A=QX$, where $Q$ is orthogonal and $X$ is generally not upper triangular. Moreover, given a Wedderburn-adapted orthogonal basis, the transformed-back factors can be computed within the commutant. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-05 in math.LO). Categorie arXiv: Logic (math.LO) ; Numerical Analysis (math.NA); Representation Theory (math.RT). Pagina del lavoro: https://arxiv.org/abs/2610.02547 — 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-06T08:20:15.619Z dalla pagina https://arxiv.org/catchup/math.LO/2026-10-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).