Partitioning a power set into union-free classes
โ Scribed by Martin Aigner; Dwight Duffus; Daniel J. Kleitman
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 353 KB
- Volume
- 88
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
Aigner, M., D. Duffus and D.J. Kleitman, Partitioning a power set into union-free classes, Discrete Mathematics 88 (1991) 113-119.
Two problems involving union-free colorings of the set of all subsets of an n-set are considered, with bounds obtained for minimum colorings.
any integer n let g(n) be the minimum number of colors necessary to color 2" so that each color &.ss is (completely) union-free.
That is, for all k no class has distinct sets AO, AI, . . . , Ak such that AO= ,j.i.
i=l
Here is what we know about f and g.
๐ SIMILAR VOLUMES
For I G t < k CI u. let S(t, k, u) denote a Steiner system and let Pr, (u) be the set of all k-subsets of theset {i,2,..., u}. We partition PJ 13) into 55 mutually disjoint S(2.4, 13)'s (projective planes). This is the first known example of a complete partition of Pk(u) into disjoint S(t, k, u)'s f
A partition u of [k] = {1, 2, . . . , k} is contained in another partition v of [l] if [l] has a k-subset on which v induces u. We are interested in counting partitions v not containing a given partition u or a given set of partitions R. This concept is related to that of forbidden permutations. A s
The new analytical method presented in this paper extends the principle of the equivalent small parameter method (ESP, an improved perturbation technique) to analyse and design Class E power ampli"ers. Using this method the analytical expression for the output voltage (or current), containing the fu