We present some results on the freeness or non freeness of some tridendriform algebras. In particular, we give a combinatorial proof of the freeness of WQSym, an algebra based on packed words, result already known with an algebraic proof. Then, we prove the non-freeness of an another tridendriform algebra, PQSym, a conjecture remained open. The method of these proofs is generalizable, in particular it has been used to prove the freeness of the dendriform algebra FQSym and the quadrialgebra of 2-permutations.

Source : oai:HAL:hal-02166325v1

Volume: DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)

Published on: April 22, 2020

Submitted on: July 4, 2016

Keywords: Combinatorics,[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

This page has been seen 11 times.

This article's PDF has been downloaded 21 times.