搜索结果: 1-1 共查到“数理逻辑与数学基础 Intersecting Families of Permutations”相关记录1条 . 查询时间(0.093 秒)
A set of permutations $I \subset S_n$ is said to be {\em k-intersecting} if any two permutations in $I$ agree on at least $k$ points. We show that for any $k \in \mathbb{N}$, if $n$ is sufficiently l...