TITLE

A sequential formula for electronic coupling in long range bridge-assisted electron transfer:

AUTHOR(S)
Chao-Ping Hsu; Marcus, R. A.
PUB. DATE
January 1997
SOURCE
Journal of Chemical Physics;1/8/1997, Vol. 106 Issue 2, p584
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Discusses the formulation of a recursion relation for the Green's function for calculating the effective electron coupling in bridge-assisted electronic transfer systems within the framework of the tight-binding Hamiltonian. Recursion expression that is applicable regardless of the number of orbitals per unit.
ACCESSION #
4163202

 

Related Articles

  • Bi-Hamiltonian systems and Maslov indices. Scherer, W. // Journal of Mathematical Physics;Nov92, Vol. 33 Issue 11, p3746 

    It is shown that any Lagrangian distribution on a 2n-dimensional symplectic manifold Γ is equivalent to a principal O(n) bundle obtained as a reduction of the frame bundle. Bisymplectic manifolds with Nijenhuis recursion operators are studied and it is shown that the set of all bi-Lagrangian...

  • Quasi-exactly solvable potentials on the line and orthogonal polynomials. Finkel, Federico; Gonzalez-Lopez, Artemio; Rodriguez, Miguel A. // Journal of Mathematical Physics;Aug96, Vol. 37 Issue 8, p3954 

    Shows that a quasi-exactly solvable one-dimensional Hamiltonian satisfying very mild conditions defines a family of weakly orthogonal polynomials which obey a three-term recursion relation. Quasi-exactly solvable potentials; Construction of the weakly orthogonal polynomial system associated to...

  • Integrable Hamiltonian systems related to the polynomial eigenvalue problem. Zeng, Yunbo; Li, Yishen // Journal of Mathematical Physics;Dec90, Vol. 31 Issue 12, p2835 

    The independent integrals of motion in involution for the Hamiltonian system related to the second-order polynomial eigenvalue problem are constructed by using relevant recursion formula. The hierarchy of Hamiltonian systems obtained from the above problem and the time part of the Lax pair are...

  • RECURSIVE GENERATION OF ISOCHRONOUS HAMILTONIAN SYSTEMS.  // Journal of Nonlinear Mathematical Physics (World Scientific Publ;Sep2010, Vol. 17 Issue 3, p251 

    No abstract available.

  • Macro-microscopic self-similarity in socio-cognio-physical dynamics. Ivancevic, Vladimir G.; Johnson, Wayne T. // Mathematics in Engineering, Science & Aerospace (MESA);2012, Vol. 3 Issue 3, p325 

    A nonlinear, complex, Hamiltonian description of socio-cognio-physical dynamics at the macroscopic, classical, inter-personal crowd level and microscopic, quantum, intra-personal agent level, is presented in the unique form of the open Liouville equation. At the microscopic level, this can be...

  • Subrecursive degrees and fragments of Peano Arithmetic. Kristiansen, Lars // Archive for Mathematical Logic;2001, Vol. 40 Issue 5, p365 

    Let T[sub 0] ⪯ T[sub 1] denote that each computable function, which is provable total in the first order theory T[sub 0] , is also provable total in the first order theory T[sub 1] . Te relation ⪯ induces a degree structure on the sound finite Π[sub 2] extensions of EA (Elementary...

  • The ...-measure as a tool for classifying computational complexity. Niggl, Karl-Heinz // Archive for Mathematical Logic;2000, Vol. 39 Issue 7, p515 

    Focuses on PR[sub 1] and PR[sub 2], typed term systems for the representation of algorithms computing primitive recursive functions. Measure employed to determine computational complexity of algorithms; Characteristic of the failure of standard measure to classify sub-elementary complexity classes.

  • Characterizing the elementary recursive functions by a fragment of Gödel's T. Beckmann, Arnold; Weiermann, Andreas // Archive for Mathematical Logic;2000, Vol. 39 Issue 7, p475 

    Discusses the characterization of elementary recursive functions using a fragment of T in Godel's system of primitive recursive functionals. Normalization proof for T; Recursion schemes of T under the Howard-Schutte style argument.

  • Bad Lattice Structures for Vectors of Nonsuccesive Values Produced by Some Linear Recurrences. L' Ecuyer, Pierre // INFORMS Journal on Computing;Winter97, Vol. 9 Issue 1, p57 

    Considers the case where the t values taken are not successive but separated by lags that are chosen a priori. Definition of a multiple recursive random number generator; Analysis of a class of linear congruential generators; Functions of classes of applications dealing with random points in...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics