{"id":"n-ef1f2f213ef4dbf2","revision":1,"first_index":0,"fingerprint":"f6-814a2de3509dad73","name":"theta_plus_one of A Riordan array of coordination sequences.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["2","2"],["2","8","3"],["2","16","18","4"],["2","24","54","32","5"],["2","32","114","128","50","6"],["2","40","198","352","250","72","7"],["2","48","306","768","850","432","98","8"],["2","56","438","1440","2250","1752","686","128","9"],["2","64","594","2432","5010","5472","3234","1024","162","10"],["2","72","774","3808","9850","14184","11662","5504","1458","200","11"],["2","80","978","5632","17650","32016","34594","22528","8802","2000","242","12"],["2","88","1206","7968","29450","65016","88494","75392","40338","13400","2662","288","13"],["2","96","1458","10880","46450","121536","201698","216064","150498","68000","19602","3456","338","14"],["2","104","1734","14432","70010","212616","419342","547712","478386","280040","109142","27744","4394","392","15"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","13","40","117","332","921","2512","6761","18004","47525","124536","324317","840092","2166065"],"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","1","-1","-1"],["-1","5","5","-1"],["0","-2","2","0"]]},"terms":[{"coeff":{"coeffs":[["0","0","-8","-6","-2"],["1","13","23","5","-2"],["-1","-3","11","9","0"],["0","-2","-6","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-1","-7","-7","-1"],["0","1","8","12","-4","-1"],["0","0","2","12","2","0"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":163369,"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-ef030cea3fd1d83e"]},{"id":163370,"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-ef030cea3fd1d83e"]},{"id":163371,"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-ef030cea3fd1d83e"]},{"id":163372,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-ef030cea3fd1d83e"]}],"region_exact":{},"incoming_edges":[{"id":"e-ef030cea3fd1d83e","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-ef1f2f213ef4dbf2","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":"92712dd67af815889e6244af7a401d4e6dc12fab57b8ab88132871886011008f","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-ec35d1145e9a1211","role":"sequence","name":"A Riordan array of coordination sequences.","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-9c804ebc2ead9eee","kind":"fingerprint_related","node_a_id":"n-429ee328c2642962","node_b_id":"n-ef1f2f213ef4dbf2","fingerprint":"f6-814a2de3509dad73","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-814a2de3509dad73"},"other_id":"n-429ee328c2642962","other":{"id":"n-429ee328c2642962","name":"derivative of Triangle T(n,k), 0 <= k <= n, read by rows, given by [0, 2, -1, 0, 0, 0, 0, 0, ...] DELTA [1, 0, 0, 0, 0, 0, 0, 0, ...] where DELTA is the operator defined in A084938.","first_index":1,"fingerprint":"f6-814a2de3509dad73","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],["1"],["2","2"]],"card_rows":[["1"],["2","2"],["2","8","3"],["2","16","18","4"]],"row_sums_preview":["0","1","4","13","40","117","332","921"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b0fc620949fb5990","steps":["D"],"edges":["e-a631bbcd56a33e16"],"text":"A122542 \u2192 D"},"headline":"A122542 \u2192 D","chain":null}},{"id":"l-e9deb2f38ebc545d","kind":"oeis_match","node_a_id":"n-ef1f2f213ef4dbf2","node_b_id":null,"fingerprint":null,"oeis_id":"A119915","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A119915","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A119915","relation":"match_row_sums"}],"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,  2;\n  2: 2,  8,   3;\n  3: 2, 16,  18,    4;\n  4: 2, 24,  54,   32,    5;\n  5: 2, 32, 114,  128,   50,    6;\n  6: 2, 40, 198,  352,  250,   72,    7;\n  7: 2, 48, 306,  768,  850,  432,   98,    8;\n  8: 2, 56, 438, 1440, 2250, 1752,  686,  128,   9;\n  9: 2, 64, 594, 2432, 5010, 5472, 3234, 1024, 162, 10;\n","recurrence_sentence":"The row polynomials satisfy -(n^2-n+(2*n^3-5*n^2-n)*x-(2*n^3+5*n^2-n)*x^2+(n^2+n)*x^3)*P(n,x) = -(n^2-n+(2*n^3+3*n^2-13*n)*x+(6*n^3-11*n^2-23*n+8)*x^2-(9*n^2+5*n-6)*x^3+(2*n+2)*x^4)*P(n-1,x) + (n*x+(2*n^2+8*n-1)*x^2+(12*n^2+12*n-7)*x^3+(2*n^2-4*n-7)*x^4-(n+1)*x^5)*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[(-(n^2 - n + (2*n^3 + 3*n^2 - 13*n)*x + (6*n^3 - 11*n^2 - 23*n + 8)*x^2 - (9*n^2 + 5*n - 6)*x^3 + (2*n + 2)*x^4)*P[n - 1, x] + (n*x + (2*n^2 + 8*n - 1)*x^2 + (12*n^2 + 12*n - 7)*x^3 + (2*n^2 - 4*n - 7)*x^4 - (n + 1)*x^5)*D[P[n - 1, x], x])/(-n^2 + n - (2*n^3 - 5*n^2 - n)*x + (2*n^3 + 5*n^2 - n)*x^2 - (n^2 + n)*x^3)]];\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] = (-(n^2 - n + (2*n^3 + 3*n^2 - 13*n)*x + (6*n^3 - 11*n^2 - 23*n + 8)*x^2 - (9*n^2 + 5*n - 6)*x^3 + (2*n + 2)*x^4)*v[i - 1] + (n*x + (2*n^2 + 8*n - 1)*x^2 + (12*n^2 + 12*n - 7)*x^3 + (2*n^2 - 4*n - 7)*x^4 - (n + 1)*x^5)*deriv(v[i - 1], x))/(-n^2 + n - (2*n^3 - 5*n^2 - n)*x + (2*n^3 + 5*n^2 - n)*x^2 - (n^2 + n)*x^3)); 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-ec35d1145e9a1211","steps":["\u03b8+1"],"edges":["e-ef030cea3fd1d83e"],"text":"A113413 \u2192 \u03b8+1"},"headline":"A113413 \u2192 \u03b8+1","chain":null}