{'fraction_non_alphanumeric': 0.017204301075268817, 'fraction_numerical': 0.0, 'mean_word_length': 5.288288288288288, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Efficient enumeration of bosonic configurations with applications to the calculation of non-radiative rates.

This work presents algorithms for the efficient enumeration of configuration spaces following Boltzmann-like statistics, with example applications to the calculation of non-radiative rates, and an open-source implementation. Configuration spaces are found in several areas of physics, particularly wherever there are energy levels that possess variable occupations. In bosonic systems, where there are no upper limits on the occupation of each level, enumeration of all possible configurations is an exceptionally hard problem. We look at the case where the levels need to be filled to satisfy an energy criterion, for example, a target excitation energy, which is a type of knapsack problem as found in combinatorics. We present analyses of the density of configuration spaces in arbitrary dimensions and how particular forms of kernel can be used to envelope the important regions. In this way, we arrive at three new algorithms for enumeration of such spaces that are several orders of magnitude more efficient than the naive brute force approach. Finally, we show how these can be applied to the particular case of internal conversion rates in a selection of molecules and discuss how a stochastic approach can, in principle, reduce the computational complexity to polynomial time.