LongestAlternatingFactor

The length of the longest factor in which every two neighboring letters differ.

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

LongestAlternatingFactor(word)The length of the longest factor in which every two neighboring letters differ.

Typed signatures

Type	Package	Applies
(binary_word) -> number	combinatorics	always

Domain: Binary word statistics

Details

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

Fold(Function([
                b,
                1 if b == a[1] else a[2] + 1,
                Max(a[3], 1 if b == a[1] else a[2] + 1),
              ], a, b), [-1, 0, 0], _x)[3]

Examples

Basic #

the word $110100111$

live ↗

In$\mathrm{LongestAlternatingFactor}({\operatorname{BinaryWord}}([1, 1, 0, 1, 0, 0, 1, 1, 1]))$Out$4$

Properties #

FindStat's value for 0

live ↗

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

Known value · FindStat St000983

FindStat's value for 1

live ↗

In$\mathrm{CombinatorialStat}({\operatorname{BinaryWord}}([1]), \text{LongestAlternatingFactor})$Out$1$

Known value · FindStat St000983

FindStat's value for 00

live ↗

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

Known value · FindStat St000983

About

Examples	4
Crosswalk	FindStat