NeighboringNumber

The smallest |p(i+1) - p(i)|, the wrap-around gap |p(1) - p(n)| included.

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

NeighboringNumber(p)The smallest |p(i+1) - p(i)|, the wrap-around gap |p(1) - p(n)| included.

Typed signatures

Type	Package	Applies
(list<integer> | permutation) -> number	combinatorics	always

Domain: Permutation statistics

Details

• Defined over Permutation as an expression in _x, evaluated by compute-engine — the definition IS the implementation.
• Takes a Permutation, and also a bare list of integers: this reading compares entries with each other rather than with their positions, so it stands on any sequence.

Definition

Epsil, as the implementation runs it.

on Permutation, over _x

0 if Length(_x) < 2 else Min(Join(Map(
                                       Function(Abs(_x[i + 1] - _x[i]), i),
                                       Range(1, Length(_x) - 1, 1),
                                     ), [Abs(_x[Length(_x)] - _x[1])]))

Examples

Basic #

the one-line word $312$

live ↗

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

the one-line word $312$, as a plain list

live ↗

In$\mathrm{NeighboringNumber}(\bigl\lbrack3, 1, 2\bigr\rbrack)$Out$1$

the one-line word $2413$

live ↗

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

Properties #

FindStat's value for [1,2]

live ↗

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

Known value · FindStat St001344

FindStat's value for [2,1]

live ↗

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

Known value · FindStat St001344

FindStat's value for [1,2,3]

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{Permutation}}([1, 2, 3]), \text{NeighboringNumber})$Out$1$

Known value · FindStat St001344

About

Examples	6
Crosswalk	FindStat