English

On $r$-cross $t$-intersecting families for weak compositions

Combinatorics 2013-11-11 v1

Abstract

Let N0\mathbb N_0 be the set of non-negative integers, and let P(n,l)P(n,l) denote the set of all weak compositions of nn with ll parts, i.e., P(n,l)={(x1,x2,,xl)N0l : x1+x2++xl=n}P(n,l)=\{ (x_1,x_2,\dots, x_l)\in\mathbb N_0^l\ :\ x_1+x_2+\cdots+x_l=n\}. For any element u=(u1,u2,,ul)P(n,l)\mathbf u=(u_1,u_2,\dots, u_l)\in P(n,l), denote its iith-coordinate by u(i)\mathbf u(i), i.e., u(i)=ui\mathbf u(i)=u_i. Let l=min(l1,l2,,lr)l=\min(l_1,l_2,\dots, l_r). Families AjP(nj,lj)\mathcal A_j\subseteq P(n_j,l_j) (j=1,2,,rj=1,2,\dots, r) are said to be rr-cross tt-intersecting if {i[l] : u1(i)=u2(i)==ur(i)}t\vert \{ i\in [l] \ :\ \mathbf u_1(i)=\mathbf u_2(i)=\cdots=\mathbf u_r(i)\} \vert\geq t for all ujAj\mathbf u_j\in \mathcal A_j. Suppose that lt+2l\geq t+2. We prove that there exists a constant n0=n0(l1,l2,,lr,t)n_0=n_0(l_1,l_2,\dots,l_r,t) depending only on ljl_j's and tt, such that for all njn0n_j\geq n_0, if the families AjP(nj,lj)\mathcal A_j\subseteq P(n_j,l_j) (j=1,2,,rj=1,2,\dots, r) are rr-cross tt-intersecting, then \begin{equation} \prod_{j=1}^r \vert \mathcal{A}_j \vert\leq \prod_{j=1}^r {n_j+l_j-t-1 \choose l_j-t-1}.\notag \end{equation} Moreover, equality holds if and only if there is a tt-set TT of {1,2,,l}\{1,2,\dots,l\} such that Aj={uP(nj,lj) : u(i)=0 for all iT}\mathcal{A}_j=\{\mathbf u\in P(n_j,l_j)\ :\ \mathbf u(i)=0\ {\rm for\ all}\ i\in T\} for j=1,2,,rj=1,2,\dots, r.

Keywords

Cite

@article{arxiv.1311.1813,
  title  = {On $r$-cross $t$-intersecting families for weak compositions},
  author = {Kok Bin Wong and Cheng Yeaw Ku},
  journal= {arXiv preprint arXiv:1311.1813},
  year   = {2013}
}

Comments

9 pages. arXiv admin note: text overlap with arXiv:1311.1592