Error correcting codes are used to describe explicit collections Fk of subsets of {1, 2,... n}, with IFkl > 2 ckn (ck > 0), such that for any selections A, B of kl and k 2 of members of Fk with kl + k2 = k, there are elements in all the members of A and not in the members of B. This settles a proble
Construction of matroidal families by partly closed sets
β Scribed by Manfred Walter
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 868 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract It is well known that in Bishopβstyle constructive mathematics, the closure of the union of two subsets of β is βnotβ the union of their closures. The dual situation, involving the complement of the closure of the union, is investigated constructively, using completeness of the ambient
By M. ROCHOWSKI of Katowice (Eingegangen am 5 . 12. 1973) 1. Introduction. I n this paper a generalization (theorem C,) of theorem Ci proved in [3] shall be formulated and as a consequence of it we prove MENOER'S n-Beinsatz (see [l], [2], [4]). The proof of theorem C, shall be published separately i
## Dedicated to E. Corominas Kleitman, Shearer et Sturtevant ont 6tudi6 le probl~me de trouver l'entier maximum m pour lequel il existe une famille de m ensembles A1,..., Am, tous ~ k 616ments, satisfaisant la propri6t6 d'intersection d'Erd6s: A v f3 Aq Β’ AT d~s que p, q, r sont distincts. Nous do