EarlyCloserPairCount

Pairs whose larger point is at most n + 1, for a matching of 2n points.

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

EarlyCloserPairCount(partition)Pairs whose larger point is at most n + 1, for a matching of 2n points.

Typed signatures

Type	Package	Applies
(perfect_matching) -> number	combinatorics	always

Domain: Perfect matching statistics

Details

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

Count(Filter(_x, Function(Last(b) <= Length(_x) + 1, b)))

Examples

Basic #

the matching $\{1,4\} \mid \{2,3\} \mid \{5,6\}$

live ↗

In$\mathrm{EarlyCloserPairCount}({\operatorname{PerfectMatching}}([[1, 4], [2, 3], [5, 6]]))$Out$2$

Properties #

FindStat's value for [(1,2)]

live ↗

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

Known value · FindStat St001044

FindStat's value for [(1,2),(3,4)]

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{PerfectMatching}}([[1, 2], [3, 4]]), \text{EarlyCloserPairCount})$Out$1$

Known value · FindStat St001044

FindStat's value for [(1,3),(2,4)]

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{PerfectMatching}}([[1, 3], [2, 4]]), \text{EarlyCloserPairCount})$Out$1$

Known value · FindStat St001044

About

Examples	4
Crosswalk	FindStat