Set operads in combinatorics and computer science

Resource Information

The work Set operads in combinatorics and computer science represents a distinct intellectual or artistic creation found in University of Liverpool. This resource is a combination of several types including: Work, Language Material, Books.

Label

Set operads in combinatorics and computer science

Statement of responsibility

Miguel A. Méndez

Creator

• Méndez, Miguel A

Author

• Méndez, Miguel A

Subject

• Decomposition method
• Operads
• Categories (Mathematics)
• Computer science -- Mathematics

Language

eng

Summary

This monograph has two main objectives. The first one is to give a self-contained exposition of the relevant facts about set operads, in the context of combinatorial species and its operations. This approach has various advantages: one of them is that the definition of combinatorial operations on species, product, sum, substitution and derivative, are simple and natural. They were designed as the set theoretical counterparts of the homonym operations on exponential generating functions, giving an immediate insight on the combinatorial meaning of them. The second objective is more ambitious. Before formulating it, authors present a brief historic account on the sources of decomposition theory. For more than forty years decompositions of discrete structures have been studied in different branches of discrete mathematics: combinatorial optimization, network and graph theory, switching design or boolean functions, simple multi-person games and clutters, etc

Member of

• Online access with purchase: Springer
• SpringerBriefs in mathematics

Cataloging source

N$T

Dewey number

512.62

Illustrations

illustrations

Index

no index present

LC call number

QA169

Literary form

non fiction

Nature of contents

• dictionaries
• bibliography

Series statement

SpringerBriefs in Mathematics,