SmallerBeforeCloserPairs

Pairs a < b in different blocks with b the greatest element of its block.

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

SmallerBeforeCloserPairs(partition)Pairs a < b in different blocks with b the greatest element of its block.

Typed signatures

Type	Package	Applies
(set_partition) -> number	combinatorics	always

Domain: Set partition statistics

Details

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

0 if Length(Flatten(_x)) < 2 else Sum(Map(Function(Count(Filter(
                                                                 Range(
                                                                        a + 1,
                                                                        Length(Flatten(_x)),
                                                                      ),
                                                                 Function(Abs(Sum(Map(
                                                                                       Function(q if Contains(_x[q], a) else 0, q),
                                                                                       Range(1, Length(_x)),
                                                                                     )) -
                                                                              Sum(Map(
                                                                                       Function(q if Contains(_x[q], b) else 0, q),
                                                                                       Range(1, Length(_x)),
                                                                                     ))) >
                                                                          0 &&
                                                                          Contains(Map(
                                                                                        Function(Last(b), b),
                                                                                        _x,
                                                                                      ), b), b),
                                                               )), a), Range(
                                                                             1,
                                                                             Length(Flatten(_x)) -
                                                                             1,
                                                                           )))

Examples

Basic #

the partition $\{1,3\} \mid \{2\}$

live ↗

In$\mathrm{SmallerBeforeCloserPairs}({\operatorname{SetPartition}}([[1, 3], [2]]))$Out$2$

the partition $\{1\} \mid \{2,4\} \mid \{3\}$

live ↗

In$\mathrm{SmallerBeforeCloserPairs}({\operatorname{SetPartition}}([[1], [2, 4], [3]]))$Out$4$

Properties #

FindStat's value for {{1,2}}

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{SetPartition}}([[1, 2]]), \text{SmallerBeforeCloserPairs})$Out$0$

Known value · FindStat St000579

FindStat's value for {{1,2,3}}

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{SetPartition}}([[1, 2, 3]]), \text{SmallerBeforeCloserPairs})$Out$0$

Known value · FindStat St000579

FindStat's value for {{1},{2}}

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{SetPartition}}([[1], [2]]), \text{SmallerBeforeCloserPairs})$Out$1$

Known value · FindStat St000579

About

Examples	5
Crosswalk	FindStat