𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A generalization of the notion of polarization

✍ Scribed by V. Guillemin; S. Sternberg


Publisher
Springer
Year
1986
Tongue
English
Weight
763 KB
Volume
4
Category
Article
ISSN
0232-704X

No coin nor oath required. For personal study only.

✦ Synopsis


Mi --N be a principal fiber bundle over N with structure group IR+. Given a symplectic form, co, on M, we will call the pair (M, A) a symplectic cone if, for every aΒ£ER+, the diffeomorphism, r a , of M associated with a satisfies (4.4) Ta = a D . A problem which we have considered in several previous papers ([2], [31, [4], [51) is the "quantization problem" for symplectic cones. Roughly speaking this problem consists of associating with M an algebra of operators, A, and a symbolic calculus for which the symbols of the operators belonging to A are functions on M. For instance if M is the punctured cotangent bundle of a compact manifold B: M = TB def T*B -O the ring of pseudodifferential operators on B has such a symbolic calculus. Therefore, the quantization problem consists of constructing something like a ring of pseudodifferential operators for any symplectic cone, MI. One


πŸ“œ SIMILAR VOLUMES


A higher-dimensional generalization of t
✍ Haisheng Li πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 287 KB

A higher-dimensional analogue of the notion of vertex algebra, called that of axiomatic G n -vertex algebra, is formulated with Borcherds' notion of G-vertex algebra as a motivation. Some examples are given and certain analogous duality properties are proved. It is proved that for any vector space W

Generalized notion of the coherence area
✍ A. Zardecki; C. Delisle; J. Bures πŸ“‚ Article πŸ“… 1972 πŸ› Elsevier Science 🌐 English βš– 199 KB
Generalizing the notion of schema in gen
✍ Michael D. Vose πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 458 KB

Vose, M.D., Generalizing the notion of schema in genetic algorithms (Research Note), Artificial Intelligence 50 (1991) 385-396. In this paper we examine some of the fundamental assumptions which are frequently used to explain the practical success which Genetic Algorithms (GAs) have enjoyed. Specifi

A generalized notion of quotient for fin
✍ G.L. O'brien πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 271 KB

A finite Abelian group G is partitioned into subsets which are translations of each othtr. A binary operation is defined on these sets in a way which generalizes the quotient group operation. Every finite Abelian group can be realized as such a generalized quotient with G cyclic.