搜索:
 
 当前位置:>首页 -> 学术报告
6-15吴文俊数学重点实验室组合图论系列讲座之119【符方伟】


题目:Two Hypercube Coloring Problems

报告人:符方伟,南开大学

时间:2018.6.15,周五上午9:00-10:00

地点:管理楼1208

摘要:We study the following two hypercube coloring problems: Given n and d, find the minimum number of colors needed to color the vertices of the n-cube such that any two vertices with Hamming distance at most d (resp. exactly d) have different colors. These problems originally arose in the study of the scalability of optical networks. In this talk we present some new results obtained by using methods in coding theory.
  科大主页 | 国家数学与交叉科学中心(合肥) | 中科院吴文俊数学重点实验室 |
中科院数学与系统科学研究院 | 北京国际数学研究中心 | 安徽省数学会