This book is aimed at providing a coherent, essentially self-contained, rigorous and comprehensive abstract theory of Feynman's operational calculus for noncommuting operators. Although it is inspired by Feynman's original heuristic suggestions and time-ordering rules in his seminal 1951 paper An operator calculus having applications in quantum electrodynamics, as will be made abundantly clear in the introduction (Chapter 1) and elsewhere in the text, the theory developed in this book also goes well beyond them in a number of directions which were not anticipated in Feynman's work. Hence, the second part of the main title of this book. The basic properties of the operational calculus are developed and certain algebraic and analytic properties of the operational calculus are explored. Also, the operational calculus will be seen to possess some pleasant stability properties. Furthermore, an evolution equation and a generalized integral equation obeyed by the operational calculus are discussed and connections with certain analytic Feynman integrals are noted. This volume is essentially self-contained and we only assume that the reader has a reasonable, graduate level, background in analysis, measure theory and functional analysis or operator theory. Much of the necessary remaining background is supplied in the text itself.

This book provides the most comprehensive mathematical treatment to date of the Feynman path integral and Feynman's operational calculus. It is accessible to mathematicians, mathematical physicists and theoretical physicists. Including new results and much material previously only available in the research literature, this book discusses both the mathematics and physics background that motivate the study of the Feynman path integral and Feynman's operational calculus, and also provides more detailed proofs of the central results.

From the winner of the Turing Award and the Abel Prize, an introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography

This book constructs the mathematical apparatus of classical mechanics from the beginning, examining basic problems in dynamics like the theory of oscillations and the Hamiltonian formalism. The author emphasizes geometrical considerations and includes phase spaces and flows, vector fields, and Lie groups. Discussion includes qualitative methods of the theory of dynamical systems and of asymptotic methods like averaging and adiabatic invariance.

This radical first course on complex analysis brings a beautiful and powerful subject to life by consistently using geometry (not calculation) as the means of explanation. Aimed at undergraduate students in mathematics, physics, and engineering, the book's intuitive explanations, lack of advanced prerequisites, and consciously user-friendly prose style will help students to master the subject more readily than was previously possible. The key to this is the book's use of new geometric arguments in place of the standard calculational ones. These geometric arguments are communicated with the aid of hundreds of diagrams of a standard seldom encountered in mathematical works. A new approach to a classical topic, this work will be of interest to students in mathematics, physics, and engineering, as well as to professionals in these fields.