z-logo
Premium
Entropic functionals of Laguerre polynomials and complexity properties of the half‐line Coulomb potential
Author(s) -
SánchezMoreno P.,
Omiste J. J.,
Dehesa J. S.
Publication year - 2011
Publication title -
international journal of quantum chemistry
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.484
H-Index - 105
eISSN - 1097-461X
pISSN - 0020-7608
DOI - 10.1002/qua.22552
Subject(s) - laguerre polynomials , coulomb , wave function , physics , quantum mechanics , mathematics , tsallis entropy , quantum , mathematical physics , statistical physics , entropy (arrow of time) , electron
The stationary states of the half‐line Coulomb potential are described by quantum‐mechanical wavefunctions, which are controlled by the Laguerre polynomials L   n (1) ( x ). Here, we first calculate the q th‐order frequency or entropic moments of this quantum system, which is controlled by some entropic functionals of the Laguerre polynomials. These functionals are shown to be equal to a Lauricella function F   A (2 q +1) ( ${1 \over q}$ ,…,, ${1 \over q}$ ,1) by use of the Srivastava‐Niukkanen linearization relation of Laguerre polynomials. The resulting general expressions are applied to obtain the following information‐theoretic quantities of the half‐line Coulomb potential: disequilibrium, Renyi and Tsallis entropies. An alternative and simpler expression for the linear entropy is also found by means of a different method. Then, the Shannon entropy and the LMC shape complexity of the lowest and highest (Rydberg) energetic states are explicitly given; moreover, sharp information‐theoretic‐based upper bounds to these quantities are found for general physical states. These quantities are numerically discussed for the ground and various excited states. Finally, the uncertainty measures of the half‐line Coulomb potential given by the information‐theoretic lengths are discussed. © 2010 Wiley Periodicals, Inc. Int J Quantum Chem, 2011

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here