A non-trivial intersection theorem for permutations with fixed number of cycles
详细信息    查看全文
文摘
Let Sn denote the set of permutations of 741c8eaf76c56" title="Click to view the MathML source">[n]={1,2,…,n}. For a positive integer k, define Sn,k to be the set of all permutations of [n] with exactly k disjoint cycles, i.e.,
Sn,k={π∈Sn:π=c1c2⋯ck},
where 7267e1f2008b6" title="Click to view the MathML source">c1,c2,…,ck are disjoint cycles. The size of Sn,k is given by 7477bf1470424">View the MathML source, where s(n,k) is the Stirling number of the first kind. A family A⊆Sn,k is said to be t-cycle-intersecting if any two elements of A have at least t common cycles. A family A⊆Sn,k is said to be trivially t-cycle-intersecting if A is the stabiliser of t fixed points, i.e., A consists of all permutations in Sn,k with some t fixed cycles of length one. For 1≤j≤t, let
View the MathML source
For t+1≤s≤k, let
View the MathML source
In this paper, we show that, given any positive integers k,t with k≥2t+3, there exists an 7290ee5ffd6debfd291f638d3f749" title="Click to view the MathML source">n0=n0(k,t), such that for all n≥n0, if A⊆Sn,k is non-trivially t-cycle-intersecting, then
|A|≤|B|,
where View the MathML source. Furthermore, equality holds if and only if A is a conjugate of B, i.e., A=β−1 for some β∈Sn.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700