Forbidding intersection patterns between layers of the cube
نویسندگان
چکیده
منابع مشابه
Forbidding intersection patterns between layers of the cube
A family A ⊂ P[n] is said to be an antichain if A 6⊂ B for all distinct A,B ∈ A. A classic result of Sperner shows that such families satisfy |A| ≤ ( n bn/2c ) , which is easily seen to be best possible. One can view the antichain condition as a restriction on the intersection sizes between sets in different layers of P[n]. More generally one can ask, given a collection of intersection restrict...
متن کاملForbidding Just One Intersection
Following a conjecture of P. Erdos, we show that if 9 is a family of k-subsets of an n-set no two of which intersect in exactly I elements then for k 2 21+ 2 and n sufficiently large IF:/ < (;:‘,I:) with equality holding if and only if 9 consists of all the k-sets containing a fixed (I+ I)-set. In general we show 19) <dknmax(‘.k-‘-l), where dk is a constant depending only on k. These results ar...
متن کاملIntersection problems in the q-ary cube
We propose new intersection problems in the q-ary n-dimensional hypercube. The answers to the problems include the Katona’s t-intersection theorem and the Erdős–Ko–Rado theorem as special cases. We solve some of the basic cases of our problems, and for example we get an Erdős–Ko–Rado type result for t-intersecting k-uniform families of multisets with bounded repetitions. Another example is obta...
متن کاملon translation of phatic communion and socio-cultural relationships between the characters of the novels
phatic communion is a cultural concept which differs across cultures. according to hofstede (2001), the u.s. tends to have individualistic culture; however, asian countries tend to have collectivistic cultures. these cultures view phatic communion differently. in individualistic cultures like u.s., phatic communion reflects speakers’ socio-cultural relationships in conversations. to see whether...
15 صفحه اولGenerating Frequent Patterns Through Intersection Between Transactions
the problem of frequent itemset mining is considered in this paper. One new technique proposed to generate frequent patterns in large databases without time-consuming candidate generation. This technique is based on focusing on transaction instead of concentrating on itemset. This algorithm based on take intersection between one transaction and others transaction and the maximum shared items be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2015
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2014.08.008