{"id":"n-fa81c8524277600a","revision":0,"first_index":0,"fingerprint":"f6-575fcd749d5c4035","name":"derivative of Triangle read by rows: T(n,k) is the number of Fibonacci binary words of length n and having k 01 subwords (0 <= k <= floor(n/2)). A Fibonacci binary word is a binary word having no 00 subword.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":-2,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[[],[],["1"],["3"],["5","2"],["7","8"],["9","18","3"],["11","32","15"],["13","50","42","4"],["15","72","90","24"],["17","98","165","80","5"],["19","128","273","200","35"],["21","162","420","420","135","6"],["23","200","612","784","385","48"],["25","242","855","1344","910","210","7"]],"degrees":[-1,-1,0,0,1,1,2,2,3,3,4,4,5,5,6],"row_sums":["0","0","1","3","7","15","30","58","109","201","365","655","1164","2052","3593"],"nonn":true,"definitions":[{"position":0,"source":"derived:derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["0"],["1"]],"recurrence":{"denominator":{"coeffs":[["-10","-4"],["9","0"],["-2","1"]]},"terms":[{"coeff":{"coeffs":[["-6","-24","0"],["7","22","-6"],["-2","-3","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-3","-12","0"],["0","2","7","-4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":171214,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-933af21fe0b55c22"]},{"id":171215,"position":1,"claim":"one_signed_coefficients","from_index":0,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":0},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 0: the coefficients of P_n have one sign","region_exact":null,"edges":["e-933af21fe0b55c22"]},{"id":171216,"position":2,"claim":"hadamard_kernel","from_index":0,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":0},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-933af21fe0b55c22"]}],"region_exact":{},"incoming_edges":[{"id":"e-933af21fe0b55c22","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"derivative_polynomial\",\"coefficients\":[{\"numerator\":[\"0\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-fa81c8524277600a","premise_count":1,"theorem":"Laguerre's theorem on differential operators: if phi is a real polynomial with only real roots, then phi(D) maps every real-rooted polynomial to a real-rooted polynomial or zero (write phi(D) = C D^j prod (1 + c_i D); D preserves real-rootedness by Rolle's theorem and p + c p' is real-rooted for every real c by Rolle's theorem applied to e^(x/c) p; Polya--Schur 1914); when the coefficients of phi have one sign, coefficients of one sign stay of one sign; applied to phi(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.splits_add_C_mul_derivative_all","RealRooted.splits_C_mul_add_derivative","Polynomial.Splits.derivative"],"certificate_hash":"58647738f0b0a40e5dadebd920924c2fc26ba7ac6797808d8b41abbeb0b4c9d3","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-a5d9cd4cf05da467","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of Fibonacci binary words of length n and having k 01 subwords (0 <= k <= floor(n/2)). A Fibonacci binary word is a binary word having no 00 subword.","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]"}]}],"used_by":[],"used_by_total":0,"links":[],"oeis":[],"bfiles":[],"oeis_texts":[{"oeis_id":"","target":"node","first_row":0,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0:  0;\n  1:  0;\n  2:  1;\n  3:  3;\n  4:  5,  2;\n  5:  7,  8;\n  6:  9, 18,  3;\n  7: 11, 32, 15;\n  8: 13, 50, 42,  4;\n  9: 15, 72, 90, 24;\n","recurrence_sentence":"The row polynomials satisfy -(2*n^2-9*n+10-(n^2-4)*x)*P(n,x) = -(2*n^2-7*n+6+(3*n^2-22*n+24)*x-(2*n^2-6*n)*x^2)*P(n-1,x) + ((2*n-3)*x+(7*n-12)*x^2-4*n*x^3)*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 1.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 0;\nP[2, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[(-(2*n^2 - 7*n + 6 + (3*n^2 - 22*n + 24)*x - (2*n^2 - 6*n)*x^2)*P[n - 1, x] + ((2*n - 3)*x + (7*n - 12)*x^2 - 4*n*x^3)*D[P[n - 1, x], x])/(-2*n^2 + 9*n - 10 + (n^2 - 4)*x)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 0; v[3] = 1; for(n = 3, N, my(i = n + 1); v[i] = (-(2*n^2 - 7*n + 6 + (3*n^2 - 22*n + 24)*x - (2*n^2 - 6*n)*x^2)*v[i - 1] + ((2*n - 3)*x + (7*n - 12)*x^2 - 4*n*x^3)*deriv(v[i - 1], x))/(-2*n^2 + 9*n - 10 + (n^2 - 4)*x)); v};\nrow(n, p) = {my(c = Vecrev(p)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};\nT(9)","reading":{"first_row":0,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-a5d9cd4cf05da467","steps":["D"],"edges":["e-933af21fe0b55c22"],"text":"A129710 \u2192 D"},"headline":"A129710 \u2192 D","chain":null}