Non-trivial \(t\)-intersection in the function lattice (Q2576465)

Let \(t\), \(l\), and \(n_1 \leq n_2 \leq \cdots \leq n_l\) be positive integers, and let \[ F_l ( n_1, n_2, \dots, n_l ) := \{k = ( k_1, k_2, \dots, k_l): 0 \leq k_i \leq n_i , \;1 \leq i \leq l \} . \] Define a partial ordering on \(F_l ( n_1, n_2, \dots, n_l )\) via \(j \leq k\) if \(\operatorname{supp}(j)\subset \operatorname{supp}(k)\) and for all \(i \in \operatorname{supp}(j)\) we have \(j_i = k_i\). (Here \(\operatorname{supp}(k)\) denotes the support of the \(l\)-tuple \(k\), i.e., \(\operatorname{supp}(k)= \{i : k_i \neq 0 \}\).) This partially ordered set is the function lattice, often also called a generalized Boolean algebra. Two \(l\)-tuples \(k\) and \(j\) are \(t\)-intersecting if there are at least \(t\) different integers \(i \in \operatorname{supp}(j)\cap \operatorname{supp}(k)\) such that \(j_i = k_i\), in other words, if there is an \(l\)-tuple \(m\) with support of size \(t\) such that \(m \leq k\) and \(m \leq j\). The authors prove a Hilton-Milnor type theorem for systems of \(t\)-intersecting \(l\)-tuples.