NestedLeftTunnelPairs

Pairs of left tunnels, one strictly inside the other.

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

NestedLeftTunnelPairs(path)Pairs of left tunnels, one strictly inside the other.

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 Apply(
                                (m: list<integer>) => Sum(Map(
                                                               Function(Count(Filter(
                                                                                      Range(1, p - 1),
                                                                                      Function(_x[r] == 0 &&
                                                                                               r + m[r] <
                                                                                               Length(_x) + 1 &&
                                                                                               m[r] > m[p], r),
                                                                                    )), p),
                                                               Filter(
                                                                       Range(1, Length(_x)),
                                                                       Function(_x[p] == 0 &&
                                                                                p + m[p] <
                                                                                Length(_x) + 1, p),
                                                                     ),
                                                             )),
                                Apply(
                                       (h: list<integer>) => Map(Function(
                                                                           Max(Filter(
                                                                                       Range(1, p - 1),
                                                                                       Function(_x[q] == 1 &&
                                                                                                h[q] ==
                                                                                                h[p - 1], q),
                                                                                     )) if _x[p] == 0 else 0,
                                                                           p,
                                                                         ), Range(1, Length(_x))),
                                       Map(
                                            Function(Sum(Map(
                                                              Function(
                                                                        2 *
                                                                        _x[k] - 1,
                                                                        k,
                                                                      ),
                                                              Range(1, i),
                                                            )), i),
                                            Range(1, Length(_x)),
                                          ),
                                     ),
                              )

Examples

Basic #

the step word $UUDDUD$

live ↗

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

the step word $UDUUDD$

live ↗

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

Properties #

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

live ↗

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

Known value · FindStat St000791

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

live ↗

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

Known value · FindStat St000791

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

live ↗

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

Known value · FindStat St000791

About

Examples	5
Crosswalk	FindStat