An Erdős-Ko-Rado theorem for integer sequences of given rank (Q1096631): Difference between revisions

The subject of the paper is the set E(k,n) of n-permutations with repetition from k elements. There are defined and considered such notions as the partial order on E(k,n), the rank of an element from E(k,n), the t-intersecting subset \(E_ l(k,n)\) of E(k,n) (which is the l-th level of E(k,n)), the t-intersecting family in E(k,n), the size of \(E_ l(k,n)\) and the support of an element from E(k,n). As special cases they are mentioned e.g. the Boolean lattice and the Whitney numbers. The main part of the paper is devoted to the proofs of assertions about the maximum of a t-intersecting family in \(E_ l(k,n)\). There is given an open problem too.