Proof step

Liu–Wang theorem for three-term recurrences

Theorem check of the sequence's own rule liu wang three term

Concludes: Triangle read by rows: T(n,k) is the number of binary words of length n with k strictly increasing runs, for 0<=k<=n.
Premises: none: a direct theorem check
Theorem: [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ?
Lean: RealRooted RealRooted.MaWang.strictInterl_of_interlaces_evalCoeff_nonpos
Checked: polytool replayed · Lean not attempted

Technical details

Step id

e-6ec8133a57dfcfe3 · JSON

Operation

Theorem check of the sequence's own rule

{
  "operation": "theorem_check",
  "theorem": "liu_wang_three_term"
}

Claims

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

Certificate

theorem_check, SHA-256 d5728f6f4543c3abebcaa422f7a774d820a7958c8bfdf9f3e61079a350b7c5c0, 5,421 bytes (1,601 compressed); download

polytool replayed the certificate when the step was written.

Cited by

References

[LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003