|
|
|
|
| LEADER |
03320nmm a2200349 u 4500 |
| 001 |
EB001848115 |
| 003 |
EBX01000000000000001012419 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
181001 ||| eng |
| 020 |
|
|
|a 9783319950013
|
| 100 |
1 |
|
|a Yau, Donald
|
| 245 |
0 |
0 |
|a Operads of Wiring Diagrams
|h Elektronische Ressource
|c by Donald Yau
|
| 250 |
|
|
|a 1st ed. 2018
|
| 260 |
|
|
|a Cham
|b Springer International Publishing
|c 2018, 2018
|
| 300 |
|
|
|a XI, 308 p. 437 illus
|b online resource
|
| 505 |
0 |
|
|a Introduction -- Part I Wiring Diagrams -- Wiring Diagrams -- Generators and Relations -- Decomposition of Wiring Diagrams -- Finite Presentation -- Finite Presentation for Algebras over Wiring Diagrams -- Part II Undirected Wiring Diagrams -- Undirected Wiring Diagrams -- Generators and Relations -- Decomposition of Undirected Wiring Diagrams -- Finite Presentation for Undirected Wiring Diagrams -- Algebras of Undirected Wiring Diagrams -- Part III Maps Between Operads of Wiring Diagrams -- A Map from Normal to Undirected Wiring Diagrams -- A Map from Wiring Diagrams to Undirected Wiring Diagrams -- Problems
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Dynamical Systems
|
| 653 |
|
|
|a Mathematical Models of Cognitive Processes and Neural Networks
|
| 653 |
|
|
|a Mathematical Applications in Computer Science
|
| 653 |
|
|
|a Algebra, Homological
|
| 653 |
|
|
|a Neural networks (Computer science)
|
| 653 |
|
|
|a Category Theory, Homological Algebra
|
| 653 |
|
|
|a Dynamical systems
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Lecture Notes in Mathematics
|
| 028 |
5 |
0 |
|a 10.1007/978-3-319-95001-3
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-319-95001-3?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 512.6
|
| 520 |
|
|
|a Wiring diagrams form a kind of graphical language that describes operations or processes with multiple inputs and outputs, and shows how such operations are wired together to form a larger and more complex operation. This monograph presents a comprehensive study of the combinatorial structure of the various operads of wiring diagrams, their algebras, and the relationships between these operads. The book proves finite presentation theorems for operads of wiring diagrams as well as their algebras. These theorems describe the operad in terms of just a few operadic generators and a small number of generating relations. The author further explores recent trends in the application of operad theory to wiring diagrams and related structures, including finite presentations for the propagator algebra, the algebra of discrete systems, the algebra of open dynamical systems, and the relational algebra. A partial verification of David Spivak’s conjecture regarding the quotient-freeness of therelational algebra is also provided. In the final part, the author constructs operad maps between the various operads of wiring diagrams and identifies their images. Assuming only basic knowledge of algebra, combinatorics, and set theory, this book is aimed at advanced undergraduate and graduate students as well as researchers working in operad theory and its applications. Numerous illustrations, examples, and practice exercises are included, making this a self-contained volume suitable for self-study
|