Real-rooted atlas

Proof step

Geometric basis map (elementary)

Image under a basis map u^k -> P_k A013611

Concludes
basis_map_A013611 of Triangle read by rows: T(n,k) is the number of circular binary words of length n having k occurrences of 01 (0 <= k <= floor(n/2)).
Premises
Theorem
polytool ?
Checked
polytool replayed · Lean not attempted
Technical details
Step id
e-559b37c74aed8722 · JSON
Operation
Image under a basis map u^k -> P_k
{
  "map": "A013611",
  "operation": "basis_map"
}
Claims
{
  "claim": "real_rooted",
  "from_index": 0,
  "region": {
    "upper": {
      "closed": true,
      "value": "0"
    }
  }
}
{
  "claim": "interlacing",
  "from_index": 2,
  "kind": "weak",
  "orientation": "unordered"
}
Certificate
basis_map, SHA-256 28b48ba2eb0279a5324cde0ff6e3b0b2bd1916ee8002a59f3c825dffaf6958aa, 14,813 bytes (2,901 compressed); download
polytool replayed the certificate when the step was written.
Cited by