๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Combinatorial Models for Coalgebraic Structures

โœ Scribed by Nigel Ray; William Schmitt

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
624 KB
Volume
138
Category
Article
ISSN
0001-8708

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 comodules, all of whose structure constants are positive integers with respect to certain preferred bases. Our category unifies and extends existing constructions in algebraic combinatorics, providing proper functorial descriptions; it is inspired in part by the notion of CW-complex, and is also geared to future applications in algebraic topology and the theory of formal group laws.

๐Ÿ“œ SIMILAR VOLUMES

Combinatorial Models for Weyl Characters
Combinatorial Models for Weyl Characters
โœ John R. Stembridge ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 248 KB

We present a set of axioms for combinatorial objects closely related to those for Kashiwara's crystals. We show that any model for the axioms, such as Littelmann's path model, has a character-a nonnegative sum of irreducible characters for a semisimple Lie group or algebra, or more generally, a symm

Universal cycles for combinatorial struc
Universal cycles for combinatorial structures
โœ Fan Chung; Persi Diaconis; Ron Graham ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 836 KB

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

Computer Algebra Libraries for Combinato
Computer Algebra Libraries for Combinatorial Structures
โœ Philippe Flajolet; Bruno Salvy ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 652 KB

This paper introduces the framework of decomposable combinatorial structures and their traversal algorithms. A combinatorial type is decomposable if it admits a specification in terms of unions, products, sequences, sets, and cycles, either in the labelled or in the unlabelled context. Many properti