WQSym的全本原元基
Basis of totally primitive elements of WQSym
摘要:
通过Foissy的工作,字拟对称函数霍普夫代数(WQSym)的双凸结构意味着它与它的对偶同构.然而,唯一已知的显式同构不尊重bidendriform结构。这种结构完全由所谓的完全本原元(两个半余积为0的元)决定。在本文中,我们构造了一个基础上的一个新的组合家庭称为双平面森林双射与包装字索引。在此基础上,本原元用双平面树索引,全部本原元用树的某个子集索引。从而得到了WQSym的全本原元的第一个显式基.
英文摘要:
By Foissy's work, the bidendriform structure of the Word Quasisymmetric Functions Hopf algebra (WQSym) implies that it is isomorphic to its dual. However, the only known explicit isomorphism does not respect the bidendriform structure. This structure is entirely determined by so-called totally primitive elements (elements such that the two half-coproducts are 0). In this paper, we construct a basis indexed by a new combinatorial family called biplane forests in bijection with packed words. In this basis, primitive elements are indexed by biplane trees and totally primitive elements by a certain subset of trees. Thus we obtain the first explicit basis for the totally primitive elements of WQSym.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。