Proof step e-1a05d30902084644

basis_map A013611 → concludes about basis_map_A013609 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal length) of identical let… JSON

Theorem

Geometric basis map (elementary) polytool ?

Operation

Image under a basis map u^k -> P_k

{
  "map": "A013611",
  "operation": "basis_map"
}

Premises

• Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A level is a pair of iden… (sequence)
  uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]

Claims

• { "claim": "real_rooted", "from_index": 0, "region": { "upper": { "closed": true, "value": "0" } } }

Verification and certificate

• polytool: replayed (the certificate replayed when the step was written)
• Lean: not attempted
• certificate: basis_map, SHA-256 011cba589666828f77016027afb2f5a93074a86d5011a6509ea47138200b0e4e, 6,855 bytes (1,392 compressed); download JSON

Cited by

• n-4a6fce4b90b6e934 (real_rooted)
• n-4a6fce4b90b6e934 (one_signed_coefficients)
• n-4a6fce4b90b6e934 (hadamard_kernel)