{"id":"n-e182fb58f6f67370","revision":0,"first_index":0,"fingerprint":"f6-adc8add1ebe9f8d3","name":"theta_plus_one of gamma_polynomial of 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.","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"],["6","24"],["20","240"],["70","1680","1260"],["252","10080","22680"],["924","55440","249480","73920"],["3432","288288","2162160","1921920"],["12870","1441440","16216200","28828800","4504500"],["48620","7001280","110270160","326726400","153153000"],["184756","33256080","698377680","3103900800","2909907000","279351072"],["705432","155195040","4190266080","26072766720","40738698000","11732745024"],["2704156","713897184","24094029960","199891211520","468495027000","269853135552","17490481008"],["10400600","3244987200","133855722000","1427794368000","4684950270000","4497552259200","874524050400"],["40116600","14602442400","722820898800","9637611984000","42164552430000","60716955499200","23612149360800","1101441369600"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","2","30","260","3010","33012","379764","4375800","51003810","597199460","7024977388","82890376296","980540486380","11621932057400","137970174101400"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0","0"],["0","0"],["-1","0"],["0","1"],["0","1"]]},"terms":[{"coeff":{"coeffs":[["0","-16","16"],["2","48","-24"],["-4","-34","-32"],["0","2","24"],["0","4","16"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","4","-24","32"],["0","-8","36","-16"],["0","0","20","-80"],["0","0","8","-32"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":184062,"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-94ccd07edbee50aa"]},{"id":184063,"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-94ccd07edbee50aa"]},{"id":184064,"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-94ccd07edbee50aa"]}],"region_exact":{},"incoming_edges":[{"id":"e-94ccd07edbee50aa","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-e182fb58f6f67370","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":"ffa901e96a4e4f55165f4f0d8b6efea56c7b7c9084ef14292b55d9c685f49885","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-ce7f61ca1eb91390","role":"sequence","name":"gamma_polynomial of 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.","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-8a7c651c762fc7c4","kind":"fingerprint_related","node_a_id":"n-d213b8618e9a733e","node_b_id":"n-e182fb58f6f67370","fingerprint":"f6-adc8add1ebe9f8d3","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-adc8add1ebe9f8d3"},"other_id":"n-d213b8618e9a733e","other":{"id":"n-d213b8618e9a733e","name":"theta_plus_one_squared of Triangular array of Motzkin polynomial coefficients.","first_index":0,"fingerprint":"f6-adc8add1ebe9f8d3","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["1","4"]],"card_rows":[["1"],["1"],["1","4"],["1","12"]],"row_sums_preview":["1","1","5","13","43","131","411","1275"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-169bd483754ab390","steps":["(\u03b8+1)\u00b2"],"edges":["e-0a32df2da63dba25"],"text":"A055151 \u2192 (\u03b8+1)\u00b2"},"headline":"A055151 \u2192 (\u03b8+1)\u00b2","chain":null}},{"id":"l-d81a9cde2423f58d","kind":"fingerprint_related","node_a_id":"n-66e4d09f0f7c919b","node_b_id":"n-e182fb58f6f67370","fingerprint":"f6-adc8add1ebe9f8d3","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-adc8add1ebe9f8d3"},"other_id":"n-66e4d09f0f7c919b","other":{"id":"n-66e4d09f0f7c919b","name":"theta_plus_one of T(n,k) = binomial(n,2*k)*binomial(2*k,k) for 0 <= k <= n, triangle read by rows.","first_index":1,"fingerprint":"f6-adc8add1ebe9f8d3","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["1","4"]],"card_rows":[["1"],["1"],["1","4"],["1","12"]],"row_sums_preview":["1","1","5","13","43","131","411","1275"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-4b168caf0bc63f8b","steps":["\u03b8+1"],"edges":["e-1cce772a08123a6c"],"text":"A089627 \u2192 \u03b8+1"},"headline":"A089627 \u2192 \u03b8+1","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:     1;\n  1:     2;\n  2:     6,      24;\n  3:    20,     240;\n  4:    70,    1680,      1260;\n  5:   252,   10080,     22680;\n  6:   924,   55440,    249480,     73920;\n  7:  3432,  288288,   2162160,   1921920;\n  8: 12870, 1441440,  16216200,  28828800,   4504500;\n  9: 48620, 7001280, 110270160, 326726400, 153153000;\n","recurrence_sentence":"The row polynomials satisfy -(n^2-(n^4+n^3)*x)*P(n,x) = -(4*n^2-2*n-(4*n^4+2*n^3-34*n^2+48*n-16)*x-(16*n^4+24*n^3-32*n^2-24*n+16)*x^2)*P(n-1,x) - ((8*n-4)*x-(8*n^3+20*n^2+36*n-24)*x^2+(32*n^3+80*n^2+16*n-32)*x^3)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[(-(4*n^2 - 2*n - (4*n^4 + 2*n^3 - 34*n^2 + 48*n - 16)*x - (16*n^4 + 24*n^3 - 32*n^2 - 24*n + 16)*x^2)*P[n - 1, x] - ((8*n - 4)*x - (8*n^3 + 20*n^2 + 36*n - 24)*x^2 + (32*n^3 + 80*n^2 + 16*n - 32)*x^3)*D[P[n - 1, x], x])/(-n^2 + (n^4 + n^3)*x)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (-(4*n^2 - 2*n - (4*n^4 + 2*n^3 - 34*n^2 + 48*n - 16)*x - (16*n^4 + 24*n^3 - 32*n^2 - 24*n + 16)*x^2)*v[i - 1] - ((8*n - 4)*x - (8*n^3 + 20*n^2 + 36*n - 24)*x^2 + (32*n^3 + 80*n^2 + 16*n - 32)*x^3)*deriv(v[i - 1], x))/(-n^2 + (n^4 + n^3)*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-fdc03fad975441d0","steps":["\u03b3","\u03b8+1"],"edges":["e-510754e51c3ada00","e-94ccd07edbee50aa"],"text":"A069466 \u2192 \u03b3 \u2192 \u03b8+1"},"headline":"A069466 \u2192 \u03b3 \u2192 \u03b8+1","chain":null}