{"id":"n-575dd72d8f53d782","revision":0,"first_index":0,"fingerprint":"f6-df2988d198a0a402","name":"one_plus_derivative of veronese_section_2_0 of Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["2"],["4","1"],["10","6"],["23","20","1"],["46","60","10"],["82","165","48","1"],["134","406","182","14"],["205","896","602","88","1"],["298","1800","1764","408","18"],["416","3345","4620","1590","140","1"],["562","5830","10956","5412","770","22"],["739","9636","23859","16368","3465","204","1"],["950","15236","48334","44616","13442","1300","26"],["1198","23205","92092","111111","46046","6643","280","1"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","2","5","16","44","116","296","736","1792","4288","10112","23552","54272","123904","280576"],"nonn":true,"definitions":[{"position":0,"source":"derived:one_plus_derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2"],["4","1"],["10","6"],["23","20","1"],["46","60","10"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","3","-3","1"]]},"deriv_order":0,"offset":6,"sign":"none"},{"coeff":{"coeffs":[["6","-12","6"]]},"deriv_order":0,"offset":5,"sign":"none"},{"coeff":{"coeffs":[["-15","18","-3"]]},"deriv_order":0,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["20","-12"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-15","3"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["6"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":172806,"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-6b3df26dd2b67f15"]},{"id":172807,"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-6b3df26dd2b67f15"]},{"id":172808,"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-6b3df26dd2b67f15"]}],"region_exact":{},"incoming_edges":[{"id":"e-6b3df26dd2b67f15","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"derivative_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-575dd72d8f53d782","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":"faa400578074d0c5a934efd7120929f6e639d40fcbeea2bebda1bbdbe17f18fb","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-e7e87c6a9f61cef2","role":"sequence","name":"veronese_section_2_0 of Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.","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:   1;\n  1:   2;\n  2:   4,    1;\n  3:  10,    6;\n  4:  23,   20,    1;\n  5:  46,   60,   10;\n  6:  82,  165,   48,   1;\n  7: 134,  406,  182,  14;\n  8: 205,  896,  602,  88,  1;\n  9: 298, 1800, 1764, 408, 18;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(1-3*x+3*x^2-x^3)*P(n-6,x) + (6-12*x+6*x^2)*P(n-5,x) - (15-18*x+3*x^2)*P(n-4,x) + (20-12*x)*P(n-3,x) - (15-3*x)*P(n-2,x) + 6*P(n-1,x) for n >= 6, with P(0,x) = 1, P(1,x) = 2, P(2,x) = 4 + x, P(3,x) = 10 + 6*x, P(4,x) = 23 + 20*x + x^2, P(5,x) = 46 + 60*x + 10*x^2.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2;\nP[2, x_] := 4 + x;\nP[3, x_] := 10 + 6*x;\nP[4, x_] := 23 + 20*x + x^2;\nP[5, x_] := 46 + 60*x + 10*x^2;\nP[n_, x_] := P[n, x] = Expand[-(1 - 3*x + 3*x^2 - x^3)*P[n - 6, x] + (6 - 12*x + 6*x^2)*P[n - 5, x] - (15 - 18*x + 3*x^2)*P[n - 4, x] + (20 - 12*x)*P[n - 3, x] - (15 - 3*x)*P[n - 2, x] + 6*P[n - 1, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2; v[3] = 4 + x; v[4] = 10 + 6*x; v[5] = 23 + 20*x + x^2; v[6] = 46 + 60*x + 10*x^2; for(n = 6, N, my(i = n + 1); v[i] = -(1 - 3*x + 3*x^2 - x^3)*v[i - 6] + (6 - 12*x + 6*x^2)*v[i - 5] - (15 - 18*x + 3*x^2)*v[i - 4] + (20 - 12*x)*v[i - 3] - (15 - 3*x)*v[i - 2] + 6*v[i - 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-f24dc5f77f658331","steps":["Veronese 2","D+1"],"edges":["e-582e2f23d54a43e5","e-6b3df26dd2b67f15"],"text":"A093375 \u2192 Veronese 2 \u2192 D+1"},"headline":"A093375 \u2192 Veronese 2 \u2192 D+1","chain":null}