Combinatorial structures for multiprocessor-systems
β Scribed by Joachim Hagemann
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 290 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Chung, F., P. Diaconis and R. Graham, Universal cycles for combinatorial structures, Discrete Mathematics 110 (1992) 43-59 In this paper, we explore generalizations of de Bruijn cycles for a variety of families of combinatorial structures, including permutations, partitions and subsets of a finite
We introduce a convenient category of combinatorial objects, known as cell-sets, on which we study the properties of the appropriate free abelian group functor. We obtain a versatile generalization of the notion of incidence coalgebra, giving rise to an abundance of coalgebras, Hopf algebras, and co