题目：Covering radius for sets of permutations

报告人:张先得研究员, 中国科技大学

Abstract: Given a finite set of points P in a metric space M, the covering radius of P in M is the smallest number r such that balls of radius r centered on all the points in P cover the entire space. In this talk, we give a survey on this problem when P is a set of permutations, and M is the symmetric group equipped with some metric d. In particular, we discuss known results when d is the Hamming distance and our recent progress when d is the infinity norm function.

时间：4月12日（周五）上午9:30--10:20

地点：首都师大新教2楼   613 教室

欢迎全体师生积极参加！