A J(4) system is a family ~9 of k distinct sets which have pairwise the same intersection A weak 3 (k ) system is a family 9 of k distinct sets such that j b n G i = t for some non-negative integer I and all F. G E 9. Fr' G. In this paper we study some functrons related to these j -systems In partic
On finite Δ-systems
✍ Scribed by H.L. Abbott; D. Hanson
- Publisher
- Elsevier Science
- Year
- 1974
- Tongue
- English
- Weight
- 995 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
This paper is motivated by the theory of sequential dynamical systems, developed as a basis for a theory of computer simulation. We study finite dynamical systems on binary strings, that is, iterates of functions from 0 1 n to itself. We introduce several equivalence relations on systems and study t
A collection of sets is called a weak A-system if sizes of all pairwise intersections of these sets coincide. We prove a new upper bound on the function ./~,.(n), the maximal size of a collection of n-element sets no three of which form a weak A-system. Namely, we prove that, for every 6 > 0. L,(n)