arXiv · 2611.22193
Stable recurrences of the super-transition array formalism from marked generating functions
Abstract
The conventional evaluation of super-transition-array (STA) mean energies and variances uses partition recurrences with alternating terms that can lose numerical accuracy. Here we apply a marked-generating-function approach to derive coupled coefficient recurrence relations that avoid these sums and directly accumulate fixed-occupation partition functions and arbitrary-order moments of the configuration-average (centroid) transition energies. Unlike explicit expansions into products of subshell occupations, the resulting recurrences require only one coefficient numerator per moment order. The same approach provides recurrences for polynomial occupation-number averages, which can be contracted to obtain the contributions of individual configurations to the STA variance and the Boltzmann energy correction entering the partition function. These contractions avoid the explicit evaluation of individual occupation-product averages and reduce the number of auxiliary quantities required. Numerical examples demonstrate agreement with direct configuration enumeration, including regimes where the alternating Bar--Shalom recurrences lose accuracy. Complementary hole-counting recurrences are also derived for all quantities, starting from a full supershell.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Daniel Aberg, Brian G. Wilson, Jean-Christophe Pain. 2026-11-17. Stable recurrences of the super-transition array formalism from marked generating functions. https://searcharxiv.com/abs/2611.22193
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.