TrunkLength

The edges from the root to the first vertex that does not have exactly one child.

✓ checked against that system · ! checked, with disagreements (hover a chip)FindStatSt000974via OrderedTree✓↗

TrunkLength(tree)The edges from the root to the first vertex that does not have exactly one child.

Typed signatures

Type	Package	Applies
(ordered_tree) -> number	combinatorics	always

Domain: Tree statistics

Details

• Defined over OrderedTree as an expression in _x, evaluated by compute-engine — the definition IS the implementation.
• Takes a OrderedTree and nothing else — it reads values against their positions, or walks the orbits, so it needs the bijection. Applying it to a bare list is a type error, not a wrong answer.

Definition

Epsil, as the implementation runs it.

on OrderedTree, over _x

Apply(
       Function(1 + self(self, t[1]) if Length(t) == 1 else 0, self, t),
       Function(1 + self(self, t[1]) if Length(t) == 1 else 0, self, t),
       _x,
     )

Examples

Basic #

the ordered tree $[[],[[]],[]]$

live ↗

In$\mathrm{TrunkLength}({\operatorname{OrderedTree}}(\bigl\lbrack\bigl\lbrack\bigr\rbrack, \bigl\lbrack\bigl\lbrack\bigr\rbrack\bigr\rbrack, \bigl\lbrack\bigr\rbrack\bigr\rbrack))$Out$0$

Properties #

FindStat's value for [[]]

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{OrderedTree}}(\bigl\lbrack\bigl\lbrack\bigr\rbrack\bigr\rbrack), \text{TrunkLength})$Out$1$

Known value · FindStat St000974

FindStat's value for [[[]]]

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{OrderedTree}}(\bigl\lbrack\bigl\lbrack\bigl\lbrack\bigr\rbrack\bigr\rbrack\bigr\rbrack), \text{TrunkLength})$Out$2$

Known value · FindStat St000974

FindStat's value for [[],[]]

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{OrderedTree}}(\bigl\lbrack\bigl\lbrack\bigr\rbrack, \bigl\lbrack\bigr\rbrack\bigr\rbrack), \text{TrunkLength})$Out$0$

Known value · FindStat St000974

About

Examples	4
Crosswalk	FindStat