TY  - BOOK
AU  - Yau,Donald
AU  - Johnson,Mark W.
TI  - Foundation for PROPs, algebras, and modules
T2  - Mathematical surveys and monographs
SN  - 9781470421977 (hardback: alk. paper)
U1  - 510MS 23
PY  - 2015///
CY  - Providence : 
PB  - American Mathematical Society
KW  - Permutation groups
KW  - Categories (Mathematics)
KW  - Modules (Algebra)
N1  - Includes bibliographical references and index; Part 1. Wheeled graphs and pasting schemes. 
1. Wheeled graphs --
2. Special sets of graphs --
3. Basic operations on wheeled graphs --
4. Graph groupoids --
5. Graph substitution --
6. Properties of graph substitution --
7. Generators of graphs --
8. Pasting schemes --
9. Well-matched pasting schemes --

Part 2. Generalized PROPs, algebras, and modules. 
10. Generalized PROPs --
11. Biased characterizations of generalized PROPs --
12. Functors of generalized PROPs --
13. Algebra over generalized PROPs --
14. Alternative descriptions of generalized PROPs --
15. Modules over generalized PROPs --
16. May modules over algebras over operads --
Bibliography --
Index
N2  - PROPs and their variants are extremely general and powerful machines that encode operations with multiple inputs and multiple outputs. In this respect PROPs can be viewed as generalizations of operads that would allow only a single output. Variants of PROPs are important in several mathematical fields, including string topology, topological conformal field theory, homotopical algebra, deformation theory, Poisson geometry, and graph cohomology. The purpose of this monograph is to develop, in full technical detail, a unifying object called a generalized PROP. Then with an appropriate choice of pasting scheme, one recovers (colored versions of) dioperads, half-PROPs, (wheeled) operads, (wheeled) properads, and (wheeled) PROPs. Here the fundamental operation of graph substitution is studied in complete detail for the first time, including all exceptional edges and loops as examples of a new definition of wheeled graphs. A notion of generators and relations is proposed which allows one to build all of the graphs in a given pasting scheme from a small set of basic graphs using graph substitution. This provides information at the level of generalized PROPs, but also at the levels of algebras and of modules over them. Working in the general context of a symmetric monoidal category, the theory applies for both topological spaces and chain complexes in characteristic zero. This book is useful for all mathematicians and mathematical physicists who want to learn this new powerful technique.
ER  -