InteriorReturns

Returns to height 0 strictly before the end.

InteriorReturns(path)Returns to height 0 strictly before the end.

Typed signatures

Type	Package	Applies
(dyck_path) -> number	combinatorics	always

Domain: Dyck path statistics

Details

• Defined over DyckPath as an expression in _x, evaluated by compute-engine — the definition IS the implementation.
• Takes a DyckPath 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 DyckPath, over _x

0 if Length(_x) < 1 else Count(Filter(
                                       Range(1, Length(_x)),
                                       Function(
                                                 Sum(Map(
                                                          Function(
                                                                    2 * _x[k] -
                                                                    1,
                                                                    k,
                                                                  ),
                                                          Range(1, i),
                                                        )) == 0 && i < Length(_x),
                                                 i,
                                               ),
                                     ))

Examples

Basic #

the step word $UUDDUD$

live ↗

In$\mathrm{InteriorReturns}({\operatorname{DyckPath}}([1, 1, 0, 0, 1, 0]))$Out$1$

the step word $UDUUDD$

live ↗

In$\mathrm{InteriorReturns}({\operatorname{DyckPath}}([1, 0, 1, 1, 0, 0]))$Out$1$

About

Examples	2