{"id":"n-690aa6621c858645","revision":0,"first_index":1,"fingerprint":"f6-c0a660a4b8bcbb34","name":"theta_plus_one of basis_map_A008277 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":-1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["2","2"],["3","4"],["5","12","3"],["8","26","9"],["13","60","36","4"],["21","128","102","16"],["34","274","300","80","5"],["55","572","798","280","25"],["89","1188","2109","1000","150","6"],["144","2442","5361","3184","625","36"],["233","4996","13470","9996","2625","252","7"],["377","10168","33216","29880","9730","1218","49"],["610","20626","81120","87824","35350","5880","392","8"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","4","7","20","43","113","267","693","1730","4542","11792","31579","84638","231810"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["1"],["2","2"],["3","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","0","-1"]]},"deriv_order":0,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["0","0","-1"]]},"deriv_order":1,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["-1","-2"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["0","-1"]]},"deriv_order":1,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["0","2"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":172218,"position":0,"claim":"real_rooted","from_index":1,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-29cd7cca06adbe26"]},{"id":172219,"position":1,"claim":"one_signed_coefficients","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":1},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 1: the coefficients of P_n have one sign","region_exact":null,"edges":["e-29cd7cca06adbe26"]},{"id":172220,"position":2,"claim":"hadamard_kernel","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":1},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 1, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-29cd7cca06adbe26"]}],"region_exact":{},"incoming_edges":[{"id":"e-29cd7cca06adbe26","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-690aa6621c858645","premise_count":1,"theorem":"Laguerre's theorem on multiplier sequences: if f is a real polynomial whose roots are all real and <= 0, then (f(k))_(k >= 0) is a multiplier sequence, so x^k -> f(k) x^k maps every real-rooted polynomial to a real-rooted polynomial or zero (Laguerre; see T. Craven and G. Csordas, Multiplier sequences for fields, Illinois J. Math. 21 (1977); Polya--Schur, Theorem 40 of P. Branden, arXiv:1410.6601: sum_k f(k) x^k / k! = f(theta) e^x = C e^x x^m prod (1 + x/a_j), a_j > 0); f(k) has one sign for k >= 0, so coefficients of one sign stay of one sign; applied to f(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.isMultiplierSequence_eval_of_roots_nonpos","RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos","RealRooted.isMultiplierSequence_iff_preserves"],"certificate_hash":"436bbe226242077f5d76d4151a3e1748a6da3c48ae8367af89fb30e24a5a6da0","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-a4df05e4bf9e978a","role":"sequence","name":"basis_map_A008277 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.","uses":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]"}]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-7297477278dc3132","kind":"fingerprint_related","node_a_id":"n-690aa6621c858645","node_b_id":"n-c48077ab30935f20","fingerprint":"f6-c0a660a4b8bcbb34","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c0a660a4b8bcbb34"},"other_id":"n-c48077ab30935f20","other":{"id":"n-c48077ab30935f20","name":"theta_plus_one of basis_map_A008277 of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials.","first_index":0,"fingerprint":"f6-c0a660a4b8bcbb34","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["2","2"]],"card_rows":[["1"],["1"],["2","2"],["3","4"]],"row_sums_preview":["1","1","4","7","20","43","113","267"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-75ccd0453a9b6cec","steps":["basis A008277","\u03b8+1"],"edges":["e-67e9a817b66ff47d","e-d5950f251b77eb0c"],"text":"A011973 \u2192 basis A008277 \u2192 \u03b8+1"},"headline":"A011973 \u2192 basis A008277 \u2192 \u03b8+1","chain":null}}],"oeis":[],"bfiles":[],"oeis_texts":[{"oeis_id":"","target":"node","first_row":1,"oeis_offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1:  1;\n   2:  1;\n   3:  2,   2;\n   4:  3,   4;\n   5:  5,  12,   3;\n   6:  8,  26,   9;\n   7: 13,  60,  36,   4;\n   8: 21, 128, 102,  16;\n   9: 34, 274, 300,  80,  5;\n  10: 55, 572, 798, 280, 25;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -x^2*P(n-4,x) - x^2*d/dx P(n-4,x) - (1+2*x)*P(n-3,x) - x*d/dx P(n-3,x) + 2*x*P(n-2,x) + x*d/dx P(n-2,x) + 2*P(n-1,x) for n >= 5, with P(1,x) = 1, P(2,x) = 1, P(3,x) = 2 + 2*x, P(4,x) = 3 + 4*x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 1;\nP[3, x_] := 2 + 2*x;\nP[4, x_] := 3 + 4*x;\nP[n_, x_] := P[n, x] = Expand[-x^2*P[n - 4, x] - x^2*D[P[n - 4, x], x] - (1 + 2*x)*P[n - 3, x] - x*D[P[n - 3, x], x] + 2*x*P[n - 2, x] + x*D[P[n - 2, x], x] + 2*P[n - 1, x]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1; v[3] = 2 + 2*x; v[4] = 3 + 4*x; for(n = 5, N, my(i = n); v[i] = -x^2*v[i - 4] - x^2*deriv(v[i - 4], x) - (1 + 2*x)*v[i - 3] - x*deriv(v[i - 3], x) + 2*x*v[i - 2] + x*deriv(v[i - 2], x) + 2*v[i - 1]); v};\nrow(n, p) = {my(c = Vecrev(p)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-c8b3f39d03de798f","steps":["basis A008277","\u03b8+1"],"edges":["e-658de443ccafc3cd","e-29cd7cca06adbe26"],"text":"A052553 \u2192 basis A008277 \u2192 \u03b8+1"},"headline":"A052553 \u2192 basis A008277 \u2192 \u03b8+1","chain":null}