Set Operads in Combinatorics and Computer Science

组合数学与计算机科学的Set Operads操作对象

数学分析

原   价:
553.00
售   价:
442.00
优惠
平台大促 低至8折优惠
作      者
出版时间
2015年01月15日
装      帧
平装
ISBN
9783319117126
复制
页      码
143
语      种
英语
综合评分
暂无评分
我 要 买
- +
库存 50 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
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.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个