Metraipolis › archive › dc_7f95b32da43a
SU3HOB-ladder: a Fortran package for harmonic-oscillator brackets in the SU(3) basis from pseudo-spin ladder operators — arXiv:2608.02640
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.02640
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T13:12:57.957Z
- SHA-256 of the archived text
0ecf1c98cc7a110e9160a1f330b0a6faf766e42ccbc29b707d79929fb8ca1f93- Stable URL of this page
https://metraipolis.com/documento/dc_7f95b32da43a
How to cite
SU3HOB-ladder: a Fortran package for harmonic-oscillator brackets in the SU(3) basis from pseudo-spin ladder operators — arXiv:2608.02640 — arXiv (en), https://arxiv.org/abs/2608.02640 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7f95b32da43a (Metraipolis archive dc_7f95b32da43a, sha256 0ecf1c98cc7a110e9160a1f330b0a6faf766e42ccbc29b707d79929fb8ca1f93)
BibTeX
@misc{dc7f95b32da43a,
title = {SU3HOB-ladder: a Fortran package for harmonic-oscillator brackets in the SU(3) basis from pseudo-spin ladder operators — arXiv:2608.02640},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.02640},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7f95b32da43a; sha256 0ecf1c98cc7a110e9160a1f330b0a6faf766e42ccbc29b707d79929fb8ca1f93},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.02640. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We present SU3HOB-ladder, a Fortran 2008 package computing the general Talmi-Moshinsky harmonic-oscillator transformation brackets for an arbitrary mass-ratio parameter d in the SU(3) basis. The bracket reduces to a single sum over Wigner d-functions of the reflection-containing Talmi-Moshinsky matrix, weighted by products of SU(3) > SO(3) isofactors of the chain U(6) > U(3)xU(2); the isofactors are d-independent, so they are built once per block (E,L) and reused for every d. We obtain them from the U(2) pseudo-spin generators of that same chain: because the U(3) and U(2) labels inside [E] of U(6) are complementary, the highest-weight states are the null space of the raising operator J_+ = a^dag(1).a(2) and the remaining members of each multiplet follow by lowering, so that no SU(3) recoupling machinery, K-matrix or outer-multiplicity resolution is required at any point. We compare this construction with two alternatives that produce the same brackets - the same scheme with isofactors taken from the vector-coherent-state library Su3cgvcs, and the classical Talmi-Moshinsky sum of Kamuntavicius et al. - over every block up to E=50. Evaluating the classical sum with its factorials in logarithmic form rather than as tabulated binomials removes the range limit that otherwise caps it near E ~ 12, and makes it an absolute check on the bracket values over the whole range where its cost is bearable. Against that check the two routes agree to within a factor of a few at every shell, while the ladder construction is faster by three orders of magnitude; it is also the only one of the three usable over the whole range, retaining max| this http URL ^T - I| <~ 2x10^-6 at E=50, where the library route has become unusable and the classical route is prohibitively slow. Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-08-05 in physics.comp-ph). Categorie arXiv: Nuclear Theory (nucl-th) ; Computational Physics (physics.comp-ph). Pagina del lavoro: https://arxiv.org/abs/2608.02640 — 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-31T13:01:51.229Z dalla pagina https://arxiv.org/catchup/physics.comp-ph/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).