matrix M and A a set of its columns. We say that A implies a iff M contains no two rows equal i n A but different i n a. It is easy IO see that if Y,~,(A) denotes . the columns implied by A, than :/,,,(A) is a closure operation. We say that M represents this closure operation.
Minimum matrix representation of Sperner systems
β Scribed by F.E. Bennett; L. Wu
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 483 KB
- Volume
- 81
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
β¦ Synopsis
Let X be an n-element set and 2' be the family of subsets of X. If&C c 2' such that for any K. K_ F .%'" K. f K_ it-dim K. ct K. then Wr is ca!!pd a Sn~rtwr wstem Let _M be 8~ ,+_ x g __l'__L-~" '__I , __' ____=__ __ __I i __' _ .
π SIMILAR VOLUMES
A program for the simulation of the steady-state behavior of an enzyme by matrix manipulation of the appropriate algebraic equations is described. This permits the calculation of the reaction velocity and of the distribution of the enzyme among its several complex forms. Provision is made for conven
A family F of subsets of a finite set X shatters a set D X, if the intersections of the members of F with D coincide with the power set of D. The maximum size of a set shattered by F is the VC-dimension (or density) of the system. P. Frankl (1983, J. Combin. Theory Ser. A 34, 41 45) investigates the