Set Operads in Combinatorics and Computer Science

Miguel A. Méndez

ISBN 10: 3319117122 / ISBN 13: 9783319117126

Published by Springer International Publishing Jan 2015, 2015

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -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. 148 pp. Englisch.

Seller Inventory # 9783319117126

Bibliographic Details

• Title: Set Operads in Combinatorics and Computer Science
• Publisher: Springer International Publishing Jan 2015
• Publication Date: 2015
• Language: English
• ISBN 10: 3319117122
• ISBN 13: 9783319117126
• Binding: Taschenbuch
• Condition: Neu

About this title

Synopsis

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.

From the Back Cover

?