Wolfram Function Repository
Instant-use add-on functions for the Wolfram Language
Function Repository Resource:
List all irreducible binary compositions for a set of chosen symbols and a chosen simplification rule
returns a rules-irreducible subset of all possible binary compositions of symbols listed in sym whose proper leaf count (terminal nodes only) equals n.
assumes compositions of only two formal variables, a and b.
Generate binary compositions where a never appears as a left argument:
Use more than one rule to allow for quantitatively different reduction paths:
For some choices of rule binary compositions are totally reducible:
The following count of irreducible compositions is related to the super-Catalan numbers (OEIS A001003):
Plot irreducible expressions as trees for a choice of leaf count equals three:
A sequence that does not appear in the OEIS:
This work is licensed under a Creative Commons Attribution 4.0 International License