Annals of Combinatorics 4 (2000) 307-316


Graph and Group Classifications of Terms in Adiabatic and Semiclassical Expansions

S.A. Fulling

Mathematics Department, Texas A&M University, College Station, TX 77843-3368, USA
fulling@math.tamu.edu

Received April 14, 1999

AMS Subject Classification: 05C30, 20C35, 81Q20

Abstract. The author describe three ways in which concepts from discrete mathematics are being used, along with computer algebra systems, to bring order into the welter of terms that appear when asymptotic expansions of propagators or heat kernels are carried out to high orders. (The key needs are (a) specifying a linearly independent set of terms, and (b) classifying terms by their structural properties.) (1) For a Schrödinger operator with a scalar potential, a closed-form solution has been given as a sum over graphs (including loops and multiple lines). To generate the series requires only the listing of all graphs with given numbers of lines and vertices, taking account of isomorphism. This can be done by Pólya-type methods, obtaining along the way a finer classification of graphs by the distribution of lines among the vertices. (2) For problems involving a Riemann curvature tensor, enumerating and classifying all the linearly independent terms of each order involves the Schur-Young-Littlewood theory of representations of the symmetric and orthogonal groups. (3) For scalar equations, the connectedness of graphs has a profound relation to the mathematical structure of the series. If there is an analogue of this principle for equations with matrix-valued potentials, the relevant notion of connectedness must involve commutators as well as index contractions.

Keywords: asymptotic expansion, semiclassical approximation, tensor, multigraph, propagator, group representation


References

1.  I.G. Avramidi, A covariant technique for the calculation of the one-loop effective action, Nucl. Phys. B 355 (1991) 712–754.

2.  B. Fiedler, A use of ideal decomposition in the computer algebra of tensor expressions, Zeitschr. Anal. Anwend. 16 (1997) 145–164.

3.  B. Fiedler, A characterization of the dependence of the Riemannian metric on the curvature tensor by Young symmetrizers, Zeitschr. Anal. Anwend. 17 (1998) 135–157.

4.  Y. Fujiwara, T.A. Osborn, and S.F.J. Wilk, Wigner–Kirkwood expansions, Phys. Rev. A. 25 (1992) 14–34.

5.  S.A. Fulling, Cataloguing general graphs by point and line spectra: The World Wide Web site, URL http://www.math.tamu.edu/~fulling/graphs/ (1995).

6.  S.A. Fulling, I. Borosh, and A. da Conturbia, Cataloguing general graphs by point and line spectra, Computer Phys. Commun. 115 (1998) 93–112.

7.  S.A. Fulling, C.J. Cummins, R.C. King, and B.G. Wybourne, Group-theoretical classification of polynomial functions of the Riemann tensor, In: Classical and Quantum Systems — Foundations and Symmetries, H.D. Doebner, W. Scherer, and F. Schroeck, Eds., World Scientific, 1993, pp. 362–365.

8.  S.A. Fulling, R.C. King, B.G. Wybourne, and C.J. Cummins, Normal forms for tensor polynomials. I, Class. Quantum Grav. 9 (1992) 1151–1198.

9.  F. Harary and E. Palmer, Graphical Enumeration, Academic Press, New York, 1973.

10.  S. Ichinose, Graphical representation of invariants and covariants in general relativity, Class. Quantum Grav. 12 (1995) 1021–1054.

11.  V.A. Ilyin and A.P. Kryukov, ATENSOR–REDUCE program for tensor simplification, Computer Phys. Commun. 96 (1996) 36–52.

12.  G. Kennedy and S.A. Fulling, Structural aspects of the exponential expansion of the heat kernel, In: Heat Kernel Techniques and Quantum Gravity, S.A. Fulling, Ed., Texas A&M Mathematics Dept., 1995, pp. 101–114.

13.  K. Kirsten, and D.J. Toms, Bose–Einstein condensation in arbitrarily shaped cavities, Phys. Rev. E 59 (1999) 158–167.

14.  F.H. Molzahn and T.A. Osborn, Connected graph representations of the quantum propagator and semiclassical expansions, J. Phys. A 20 (1987) 3073–3094.

15.  F.H. Molzahn and T.A. Osborn, A phase space fluctuation method for quantum dynamics, Ann. Phys. (N.Y.) 230 (1994) 343–394.

16.  K.R. Parthasarathy, Enumeration of ordinary graphs with given partition, Canadian J. Math. 20 (1968) 40–47.

17.  R. Portugal, An algorithm to simplify tensor expressions, Computer Phys. Commun. 115 (1998) 215–244.

18.  B.G. Wybourne, SCHUR: An Interactive Programme for Calculating Properties of Lie Groups, 1992.


Get the DVI | PS | PDF file of this abstract.