2000 character limit reached
Realizations of Hopf algebras of graphs by alphabets
Published 24 May 2019 in math.RA | (1905.10203v1)
Abstract: We here give polynomial realizations of various Hopf algebras or bialgebras on Feynman graphs, graphs, posets or quasi-posets, that it to say injections of these objects into polynomial algebras generated by an alphabet. The alphabet here considered are totally quasi-ordered. The coproducts are given by doubling the alphabets; a second coproduct is defined by squaring the alphabets, and we obtain cointeracting bialgebras in the commutative case.
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.