SymmetricBorderLength
The length of the longest prefix whose reverse is a suffix.
✓ checked against that system · ! checked, with disagreements (hover a chip)FindStat
St000296via BinaryWord✓SymmetricBorderLength(word)The length of the longest prefix whose reverse is a suffix.Typed signatures
| Type | Package | Applies |
|---|---|---|
(binary_word) -> number | combinatorics | always |
Details
- Defined over
BinaryWordas an expression in_x, evaluated by compute-engine — the definition IS the implementation. - Takes a
BinaryWordand 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. - FindStat's St000296. The longest prefix that is a suffix read backwards is the run of leading positions i with w(i) = w(n + 1 - i).
Definition
Epsil, as the implementation runs it.
on BinaryWord, over _x
0 if Length(_x) < 1 else Fold(
Function([
a[1] * (1 if _x[b] == _x[Length(_x) +
1 - b] else 0),
a[2] + a[1] *
(1 if _x[b] == _x[Length(_x) +
1 - b] else 0),
], a, b),
[1, 0],
Range(1, Length(_x)),
)[2]Examples
Properties #
About
| Examples | 4 |
|---|---|
| Crosswalk | FindStat |