Effective approach of the tridendriform Schroeder tree algebra
This work addresses a computational challenge in algebraic combinatorics, but it is incremental as it focuses on implementing an existing complex method for a specific mathematical structure.
The authors tackled the problem of computing primitive elements in a free tridendriform algebra based on Schröder trees by developing tools to implement the algebra and its multiplications on a computer, and they numerically verified that all generated elements are primitive.
We introduce a primitive computation problem in the free tridendriform algebra generated by one element which is a Hopf algebra based on Schroeder trees. We know a complex way to generate all of them. To understand it clearer, we want to implement this method on a computer. However, we need to create some tools to implement Schroeder trees and the multiplications over this algebra to be able to compute the primitive elements. We also checked numerically that they are all primitive elements. In this paper, we detail how we made the problem mathematically understandable for a computer and how we implement it.