Abstract

Letn, s1,s2, ... ands n be positive integers. Assume\(\mathcal{M}(s_1 ,s_2 , \cdots ,s_n ) = \{ (x_1 ,x_2 , \cdots x_n )|0 \leqslant x_i \leqslant s_i ,x_i\) is an integer for eachi}. For\(a = (a_1 ,a_2 , \cdots a_n ) \in \mathcal{M}(s_1 ,s_2 , \cdots ,s_n )\),\(\mathcal{F} \subseteq \mathcal{M}(s_1 ,s_2 , \cdots ,s_n )\), and\(A \subseteq \{ 1,2, \cdots ,n\}\), denotes p (a)={j|1≤j≤n,a j ≥p},\(S_p (\mathcal{F}) = \{ s_p (a)|a \in \mathcal{F}\}\), and\(W_p (A) = p^{n - |A|} \prod\limits_{i \in A} {(s_i - p)}\).\(\mathcal{F}\) is called anI t p -intersecting family if, for any a,b∈\(\mathcal{F}\),a i Λb i =min(a i ,b i )≥p for at leastt i's.\(\mathcal{F}\) is called a greedyI t P -intersecting family if\(\mathcal{F}\) is anI t p -intersecting family andW p (A)≥W p (B+A c ) for anyAeS p (\(\mathcal{F}\)) and any\(B \subseteq A\) with |B|=t−1.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.