{"id":"n-3f18d778d359419c","revision":0,"first_index":0,"fingerprint":"f6-b8a804edad022635","name":"theta_plus_one of derivative of Square the entries of Pascal's triangle.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":-1,"palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":false,"rows":[[],["1"],["4","4"],["9","36","9"],["16","144","144","16"],["25","400","900","400","25"],["36","900","3600","3600","900","36"],["49","1764","11025","19600","11025","1764","49"],["64","3136","28224","78400","78400","28224","3136","64"],["81","5184","63504","254016","396900","254016","63504","5184","81"],["100","8100","129600","705600","1587600","1587600","705600","129600","8100","100"],["121","12100","245025","1742400","5336100","7683984","5336100","1742400","245025","12100","121"],["144","17424","435600","3920400","15681600","30735936","30735936","15681600","3920400","435600","17424","144"],["169","24336","736164","8179600","41409225","106007616","144288144","106007616","41409225","8179600","736164","24336","169"],["196","33124","1192464","16032016","100200100","324648324","577152576","577152576","324648324","100200100","16032016","1192464","33124","196"]],"degrees":[-1,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["0","1","8","54","320","1750","9072","45276","219648","1042470","4862000","22355476","101582208","457002364","2038517600"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["1"]],"recurrence":{"denominator":{"coeffs":[["-1"],["3"],["-3"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0"],["0","0"],["-1","-5"],["1","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","0"],["0","0","0"],["0","2","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":176021,"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-0dde57b3fbec03ba"]},{"id":176022,"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-0dde57b3fbec03ba"]},{"id":176023,"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-0dde57b3fbec03ba"]}],"region_exact":{},"incoming_edges":[{"id":"e-0dde57b3fbec03ba","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-3f18d778d359419c","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":"48c8b6c922c596e5323b889ab504ce6493a762793dc4119521d145330b8cf159","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-aff68976ca55ced5","role":"sequence","name":"derivative of Square the entries of Pascal's triangle.","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":[{"id":"l-4b1de5059ae00b24","kind":"fingerprint_related","node_a_id":"n-fdc03fad975441d0","node_b_id":"n-3f18d778d359419c","fingerprint":"f6-b8a804edad022635","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-b8a804edad022635"},"other_id":"n-fdc03fad975441d0","other":{"id":"n-fdc03fad975441d0","name":"Triangle T(n, k) of numbers of square lattice walks that start and end at origin after 2*n steps and contain exactly k steps to the east, possibly touching origin at intermediate stages.","first_index":0,"fingerprint":"f6-b8a804edad022635","polytool_family":null,"degree_pattern":"affine","palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","2"],["6","24","6"]],"card_rows":[["1"],["2","2"],["6","24","6"],["20","180","180","20"]],"row_sums_preview":["1","4","36","400","4900","63504","853776","11778624"],"regions":["(-inf, +inf)","(-inf, 0)","(-inf, 0]"],"region_exact":{},"oeis_ids":["A069466"],"derivation":{"root":"n-fdc03fad975441d0","steps":[],"edges":[],"text":"A069466"},"headline":"A069466: Triangle T(n, k) of numbers of square lattice walks that start and end at origin after 2*n steps and contain exactly k steps to the east, possibly touching origin at intermediate stages.","chain":null}},{"id":"l-4c6b382586db56bf","kind":"fingerprint_related","node_a_id":"n-b13531ad79e7c629","node_b_id":"n-3f18d778d359419c","fingerprint":"f6-b8a804edad022635","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-b8a804edad022635"},"other_id":"n-b13531ad79e7c629","other":{"id":"n-b13531ad79e7c629","name":"Square the entries of Pascal's triangle.","first_index":0,"fingerprint":"f6-b8a804edad022635","polytool_family":null,"degree_pattern":"affine","palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","1"],["1","4","1"]],"card_rows":[["1"],["1","1"],["1","4","1"],["1","9","9","1"]],"row_sums_preview":["1","2","6","20","70","252","924","3432"],"regions":["(-inf, +inf)","(-inf, 0)","(-inf, 0]"],"region_exact":{},"oeis_ids":["A008459"],"derivation":{"root":"n-b13531ad79e7c629","steps":[],"edges":[],"text":"A008459"},"headline":"A008459: Square the entries of Pascal's triangle.","chain":null}}],"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:  1;\n  2:  4,    4;\n  3:  9,   36,     9;\n  4: 16,  144,   144,     16;\n  5: 25,  400,   900,    400,     25;\n  6: 36,  900,  3600,   3600,    900,     36;\n  7: 49, 1764, 11025,  19600,  11025,   1764,    49;\n  8: 64, 3136, 28224,  78400,  78400,  28224,  3136,   64;\n  9: 81, 5184, 63504, 254016, 396900, 254016, 63504, 5184, 81;\n","recurrence_sentence":"The row polynomials satisfy (n^3-3*n^2+3*n-1)*P(n,x) = (n^3-n^2+(3*n^3-5*n^2)*x)*P(n-1,x) + (2*n^2*x-2*n^2*x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 1.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[((n^3 - n^2 + (3*n^3 - 5*n^2)*x)*P[n - 1, x] + (2*n^2*x - 2*n^2*x^2)*D[P[n - 1, x], x])/(n^3 - 3*n^2 + 3*n - 1)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = ((n^3 - n^2 + (3*n^3 - 5*n^2)*x)*v[i - 1] + (2*n^2*x - 2*n^2*x^2)*deriv(v[i - 1], x))/(n^3 - 3*n^2 + 3*n - 1)); 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-b13531ad79e7c629","steps":["D","\u03b8+1"],"edges":["e-be8e3a0f5d3685bc","e-0dde57b3fbec03ba"],"text":"A008459 \u2192 D \u2192 \u03b8+1"},"headline":"A008459 \u2192 D \u2192 \u03b8+1","chain":null}