Effective approach of the tridendriform Schroeder tree algebra

TL;DR

This paper details a method to computationally generate and verify primitive elements in a Hopf algebra based on Schroeder trees within the free tridendriform algebra.

Contribution

It introduces a computational approach for implementing Schroeder trees and their algebraic operations to identify primitive elements.

Findings

Successfully implemented tools to generate Schroeder trees.

Numerical verification of primitive elements.

Clarified the mathematical structure for computer implementation.

Abstract

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.