2000 character limit reached
Combinatorial Semigroup Bialgebras
Published 20 Nov 2012 in math.CO | (1211.4710v2)
Abstract: This paper is devoted to the presentation of combinatorial bialgebras whose coproduct is defined with the help of a commutative semigroup. We consider this setting in order to give a general framework which admits as special cases the shuffle and stuffle algebras. We also consider the problem of constructing pairs of bases in duality and present Sch\"utzenberger's factorisations as an application.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.