Chains of Infinite Order, Chains with Memory of Variable Length, and Maps of the Interval

We show how to construct a topological Markov map of the interval whose invariant probability measure is the stationary law of a given stochastic chain of infinite order. In particular we characterize the maps corresponding to stochastic chains with memory of variable length. The problem treated here is the converse of the classical construction of the Gibbs formalism for Markov expanding maps of the interval.

Supersymmetric Isospectral Formalism for the Calculation of Near-Zero Energy States: Application to the Very Weakly Bound He-4 Trimer Excited State

We propose a novel mathematical approach for the calculation of near-zero energy states by solving potentials which are isospectral with the original one. For any potential, families of strictly isospectral potentials (with very different shape) having desirable and adjustable features are generated by supersymmetric isospectral formalism. The near-zero energy Efimov state in the original potential is effectively trapped in the deep well of the isospectral family and facilitates more accurate calculation of the Efimov state. Application to the first excited state in He-4 trimer is presented.

The generator coordinate method in the unrestricted Hartree-Fock formalism

The generator coordinate method was implemented in the unrestricted Hartree-Fock formalism. Weight functions were built from Gaussian generator functions for 1s, 2s, and 2p orbitals of carbon and oxygen atoms. These weight functions show a similar behavior to those found in the generator coordinate restricted Hartree-Fock method, i.e., they are smooth, continuous, and tend to zero in the limits of integration. Moreover, the weight functions obtained are different for spin-up and spin-down electrons what is a result from spin polarization. (C) 2011 Wiley Periodicals, Inc. Int J Quantum Chem, 2012

COMPLEXITY MEASURE: A QUANTUM INFORMATION APPROACH

In the past decades, all of the efforts at quantifying systems complexity with a general tool has usually relied on using Shannon's classical information framework to address the disorder of the system through the Boltzmann-Gibbs-Shannon entropy, or one of its extensions. However, in recent years, there were some attempts to tackle the quantification of algorithmic complexities in quantum systems based on the Kolmogorov algorithmic complexity, obtaining some discrepant results against the classical approach. Therefore, an approach to the complexity measure is proposed here, using the quantum information formalism, taking advantage of the generality of the classical-based complexities, and being capable of expressing these systems' complexity on other framework than its algorithmic counterparts. To do so, the Shiner-Davison-Landsberg (SDL) complexity framework is considered jointly with linear entropy for the density operators representing the analyzed systems formalism along with the tangle for the entanglement measure. The proposed measure is then applied in a family of maximally entangled mixed state.