Set Operads in Combinatorics and Computer Science
In Computer Science and Combinatorics
Series: SpringerBriefs in Mathematics;
- Publisher's listprice EUR 53.49
-
22 184 Ft (21 128 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 4 437 Ft off)
- Discounted price 17 748 Ft (16 902 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
22 184 Ft
Availability
printed on demand
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 2015
- Publisher Springer International Publishing
- Date of Publication 21 January 2015
- Number of Volumes 1 pieces, Book
- ISBN 9783319117126
- Binding Paperback
- No. of pages129 pages
- Size 235x155 mm
- Weight 454 g
- Language English
- Illustrations XV, 129 p. 62 illus., 43 illus. in color. Illustrations, black & white 0
Categories
Long description:
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.
MoreTable of Contents:
Introduction.- Preliminaries on Species and Set Operads.- Operations on Species and Set Operads.- Decomposition Theory.- Rigid Operads.- Posets from Cancellative Operads and Koszul Duality.- Appendix.
More
