PrimitiveFactorCount

The distinct nonempty factors that are not a power of a shorter word.

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

PrimitiveFactorCount(word)The distinct nonempty factors that are not a power of a shorter word.

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.
• FindStat's St001838.

Definition

Epsil, as the implementation runs it.

on BinaryWord, over _x

0 if Length(_x) < 1 else Max(Sum(Map(Function(Max(Sum(Map(
                                                           Function(
                                                                     1 if n > 0 else 0,
                                                                     n,
                                                                   ),
                                                           Unique(Map(Function(Max(
                                                                                    Sum(Map(Function((_x[i +
                                                                                                         (m - 1)] +
                                                                                                      1) *
                                                                                                     3 ^
                                                                                                     (l - m), m), Range(1, l, 1))),
                                                                                    0,
                                                                                  ) if Max(Sum(Map(
                                                                                                   Function(((1 if Max(Sum(Map(Function((_x[i +
                                                                                                                                            (m - 1)] +
                                                                                                                                         1) *
                                                                                                                                        3 ^
                                                                                                                                        (l - d -
                                                                                                                                         m), m), Range(1, l - d, 1))), 0) ==
                                                                                                                   Max(Sum(Map(Function((_x[i + d +
                                                                                                                                            (m - 1)] +
                                                                                                                                         1) *
                                                                                                                                        3 ^
                                                                                                                                        (l - d -
                                                                                                                                         m), m), Range(1, l - d, 1))), 0) else 0) if l % d ==
                                                                                                                               0 else 0) if d < l else 0, d),
                                                                                                   Range(1, l, 1),
                                                                                                 )), 0) ==
                                                                                      0 else 0, i), Range(1, Length(_x) - l +
                                                                                                            1, 1))),
                                                         )), 0), l), Range(
                                                                           1,
                                                                           Length(_x),
                                                                         ))), 0)

Examples

Basic #

the word $110100111$

live ↗

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

Properties #

FindStat's value for 0

live ↗

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

Known value · FindStat St001838

FindStat's value for 1

live ↗

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

Known value · FindStat St001838

FindStat's value for 00

live ↗

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

Known value · FindStat St001838

About

Examples	4
Crosswalk	FindStat