×

A new method for constructing factorisable representations for current groups and current algebras. (English) Zbl 0332.43009


MSC:

43A65 Representations of groups, semigroups, etc. (aspects of abstract harmonic analysis)
43A15 \(L^p\)-spaces and other function spaces on groups, semigroups, etc.
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Araki, H.: Factorisable representations of current algebra, Publications of R.I.M.S. Kyoto University, Ser. A,5 (3), 361–422 (1970) · Zbl 0238.22014
[2] Guichardet, A.: Symmetric Hilbert spaces and related topics. In: Lecture Notes in Mathematics, Vol. 261. Berlin-Heidelberg-New York: Springer 1972 · Zbl 0265.43008
[3] Parthasarathy, K. R., Schmidt, K.: Positive definite kernels, continuous tensor products, and central limit theorems of probability theory. In: Lecture Notes in Mathematics, Vol. 272. Berlin-Heidelberg-New York: Springer 1972 · Zbl 0237.43005
[4] Parthasarathy, K. R., Schmidt, K.: Factorisable representations of current groups and the Araki-Woods imbedding theorem. Acta Math.128, 53–71 (1972) · Zbl 0233.22003 · doi:10.1007/BF02392159
[5] Schmidt, K.: Algebras with quasilocal structure and factorisable representations, Mathematics of Contemporary Physics (ed. R. F. Streater), pp. 237–251. New York: Academic Press 1972
[6] Streater, R. F.: Current commutation relations, continuous tensor products and infinitely divisible group representations. Rend. Sci. Int. Fisica E. Fermi, XI, 247–263 (1969)
[7] Vershik, A. M., Gelfand, I. M., Graev, M. I.: Representations of the groupSL(2,R) whereR is a ring of functions. Russ. Math. Surv.28, 87–132 (1973) · Zbl 0297.22003 · doi:10.1070/RM1973v028n05ABEH001616
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.