组合数学讨论班

报告题目: On Closures of Finite Permutation Groups

报 告 人: Andrey Vasilev(Novosibirsk State University)

时      间: 2026年4月22日, 10:30-11:30

地      点:海纳苑2幢820

摘      要: Let X be a finite set and k a positive integer. The largest subgroup of the symmetric group Sym(X) having the same orbits as a given subgroup G of Sym(X) in the componentwise action of G on the kth Cartesian power of X is called the k-closure of G. We discuss properties of k-closures and the problem of how one can find k-closures efficiently.

联系人：冯涛（tfeng@zju.edu.cn）