31 research outputs found
-free families in the Boolean lattice
For a family of subsets of [n]=\{1, 2, ..., n} ordered by
inclusion, and a partially ordered set P, we say that is P-free
if it does not contain a subposet isomorphic to P. Let be the
largest size of a P-free family of subsets of [n]. Let be the poset with
distinct elements a, b, c, d, a<b, c<d; i.e., the 2-dimensional Boolean
lattice. We show that where . We also prove that the largest -free
family of subsets of [n] having at most three different sizes has at most
2.20711N members.Comment: 18 pages, 2 figure
Partial Covering Arrays: Algorithms and Asymptotics
A covering array is an array with entries
in , for which every subarray contains each
-tuple of among its rows. Covering arrays find
application in interaction testing, including software and hardware testing,
advanced materials development, and biological systems. A central question is
to determine or bound , the minimum number of rows of
a . The well known bound
is not too far from being
asymptotically optimal. Sensible relaxations of the covering requirement arise
when (1) the set need only be contained among the rows
of at least of the subarrays and (2) the
rows of every subarray need only contain a (large) subset of . In this paper, using probabilistic methods, significant
improvements on the covering array upper bound are established for both
relaxations, and for the conjunction of the two. In each case, a randomized
algorithm constructs such arrays in expected polynomial time
The characterization of branching dependencies
AbstractA new type of dependencies in a relational database model is introduced. If b is an attribute, A is a set of attributes then it is said that b (p,q)-depends on A, in notation A (p,q)→ b, in a database r if there are no q + 1 rows in r such that they have at most p different values in A, but q + 1 different values in b. (1,1)-dependency is the classical functional dependency. Let I(A) denote the set{b: A(p,q)→ b. The set function I(A) is characterized if p=1, 1<q; p=2, 3<q; 2<p, p2−p−1<q. Implications among (p,q)-dependencies are also determined
Partial dependencies in relational databases and their realization
AbstractWeakening the functional dependencies introduced by Amstrong we get the notion of the partial dependencies defined on the relational databases. We show that the partial dependencies can be characterized by the closure operations of the poset formed by the partial functions on the attributes of the databases. On the other hand, we give necessary and sufficient conditions so that for such a closure operation one can find on the given set of attributes a database whose partial dependencies generate the given closure operation. We also investigate some questions about how to realize certain structures related to databases by a database of minimal number of rows, columns or elements