Proof step
Geometric basis map (elementary)
Image under a basis map u^k -> P_k A013609
- Concludes
- basis_map_A013609 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
- 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)).
sequence: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
- 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)).
- Theorem
- polytool ?
- Checked
- polytool replayed · Lean not attempted
Technical details
- Step id
e-e4f01bd857ea1122· JSON- Operation
- Image under a basis map u^k -> P_k
{ "map": "A013609", "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-25659bf7560a9ef762146502f4f7fc7d632720bec2c399383ba70ceccec423e431f, 14,813 bytes (2,901 compressed); downloadpolytool replayed the certificate when the step was written.- Cited by
n-e874187369c42637(one_signed_coefficients)n-e874187369c42637(hadamard_kernel)n-e874187369c42637(interlacing)n-e874187369c42637(real_rooted)