메뉴 건너뛰기




Volumn 113, Issue 52, 2009, Pages 15106-15117

3nj Morphogenesis and semiclassical disentangling

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC METHOD; EIGENSTATES; NUMERICAL TOOLS; QUANTUM COMPUTING; QUANTUM GRAVITY; RECOUPLING; UNITARY TRANSFORMATIONS; YUTSIS GRAPH;

EID: 73949122308     PISSN: 10895639     EISSN: None     Source Type: Journal    
DOI: 10.1021/jp905212a     Document Type: Article
Times cited : (28)

References (35)
  • 1
    • 0003194424 scopus 로고
    • The racah-wigner algebra in quantum theory
    • Rota, G.-C., Ed; Addison-Wesley Publ. Co.: Reading, MA
    • Biedenharn, L. C.; Louck, J. D. The Racah-Wigner Algebra in Quantum Theory. Encyclopedia of Mathematics and its Applications Vol 9; Rota, G.-C., Ed; Addison-Wesley Publ. Co.: Reading, MA, 1981.
    • (1981) Encyclopedia of Mathematics and Its Applications , vol.9
    • Biedenharn, L.C.1    Louck, J.D.2
  • 6
    • 73949146840 scopus 로고    scopus 로고
    • The last two monographs were published seven years after the Biedenharn-Louck text; in particular the last one is now the most exhaustive and reliable collection of definitions of angular momentum functions and related algebraic and analytic formulas
    • The last two monographs were published seven years after the Biedenharn-Louck text; in particular the last one is now the most exhaustive and reliable collection of definitions of angular momentum functions and related algebraic and analytic formulas.
  • 7
    • 73949137684 scopus 로고    scopus 로고
    • As an aside remark, recall that the isomorphism problem in graph theory is a typical NP-complete problem, actually a #P problem, even for regular graphs: this means that, given two instances of graphs, one can decide if they are isomorphic or not in polynomial time but the general solution -the enumeration of all graphs isomorphic to a given one- requires an exponential time as the complexity of the graphs grows, i.e., as the number of vertices increases (see, e.g., ref 8)
    • As an aside remark, recall that the isomorphism problem in graph theory is a typical NP-complete problem, actually a #P problem, even for regular graphs: this means that, given two instances of graphs, one can decide if they are isomorphic or not in polynomial time but the general solution -the enumeration of all graphs isomorphic to a given one- requires an exponential time as the complexity of the graphs grows, i.e., as the number of vertices increases (see, e.g., ref 8).
  • 24
    • 73949100307 scopus 로고    scopus 로고
    • 3,3 has the same nonorientable and orientable genus is exceptional: most graphs have different values for g and c
    • 3,3 has the same nonorientable and orientable genus is exceptional: most graphs have different values for g and c.
  • 28
    • 0002414354 scopus 로고
    • Angular Momentum: An approach to combinatorial space-time
    • Bastin, T. (Ed.), Cambridge University Press: Cambridge, U.K.
    • Penrose, R. Angular Momentum: an approach to combinatorial space-time, in: Bastin, T. (Ed.), Quantum Theory and Beyond; Cambridge University Press: Cambridge, U.K., 1971; p 151.
    • (1971) Quantum Theory and beyond , pp. 151
    • Penrose, R.1
  • 33
    • 73949112683 scopus 로고    scopus 로고
    • Bailey, D. H. At ;http://crd.lbl.gov/dhbailey/mpdist/ , 2006.
    • (2006)
    • Bailey, D.H.1
  • 35
    • 73949091108 scopus 로고    scopus 로고
    • Uniform semiclassical approximation of the Wigner 6j symbol in terms of rotation matrices
    • submitted for publication
    • Littlejohn, R. G.; Yu, L. Uniform semiclassical approximation of the Wigner 6j symbol in terms of rotation matrices. J. Phys. Chem. A, submitted for publication.
    • J. Phys. Chem. A
    • Littlejohn, R.G.1    Yu, L.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.