{"id":"n-fd3a5e518fba692c","revision":0,"first_index":0,"fingerprint":"f6-268820d9713892ad","name":"theta_plus_one of shift_x_plus_one of Riordan array ((1+x)^3,x).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":3,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["8","24","18","4"],["8","40","54","28","5"],["8","56","114","100","40","6"],["8","72","198","252","165","54","7"],["8","88","306","516","480","252","70","8"],["8","104","438","924","1125","828","364","88","9"],["8","120","594","1508","2280","2178","1330","504","108","10"],["8","136","774","2300","4165","4914","3871","2024","675","130","11"],["8","152","978","3332","7040","9912","9604","6448","2952","880","154","12"],["8","168","1206","4636","11205","18360","21168","17424","10206","4160","1122","180","13"],["8","184","1458","6244","17000","31806","42588","41616","29808","15500","5698","1404","208","14"],["8","200","1734","8188","24805","52206","79695","90288","76626","48620","22748","7620","1729","238","15"],["8","216","2034","10500","35040","81972","140602","181368","178200","133760","76230","32436","9984","2100","270","16"],["8","232","2358","13212","48165","124020","236236","342056","382239","331760","223366","115596","45123","12852","2520","304","17"],["8","248","2706","16356","64680","181818","380926","612040","767052","756470","588302","359268","170352","61446","16290","2992","340","18"]],"degrees":[3,4,5,6,7,8,9,10,11,12,13,14,15,16,17],"row_sums":["54","135","324","756","1728","3888","8640","19008","41472","89856","193536","414720","884736","1880064","3981312"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["8","24","18","4"]],"recurrence":{"denominator":{"coeffs":[["2","4","3"],["0","2","1"]]},"terms":[{"coeff":{"coeffs":[["2","8","10","4"],["0","2","3","1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":173482,"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-aa2cd841c454b26e"]},{"id":173483,"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-aa2cd841c454b26e"]},{"id":173484,"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-aa2cd841c454b26e"]},{"id":173485,"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-aa2cd841c454b26e"]}],"region_exact":{},"incoming_edges":[{"id":"e-aa2cd841c454b26e","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-fd3a5e518fba692c","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":"0f4f3955da3eba81627f5e772ba8cbd4f8973d95ede62fc332820c54fc918b80","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-9aa9e3dd2403bca2","role":"sequence","name":"shift_x_plus_one of Riordan array ((1+x)^3,x).","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: 8,  24,   18,    4;\n  1: 8,  40,   54,   28,     5;\n  2: 8,  56,  114,  100,    40,     6;\n  3: 8,  72,  198,  252,   165,    54,     7;\n  4: 8,  88,  306,  516,   480,   252,    70,     8;\n  5: 8, 104,  438,  924,  1125,   828,   364,    88,     9;\n  6: 8, 120,  594, 1508,  2280,  2178,  1330,   504,   108,   10;\n  7: 8, 136,  774, 2300,  4165,  4914,  3871,  2024,   675,  130,   11;\n  8: 8, 152,  978, 3332,  7040,  9912,  9604,  6448,  2952,  880,  154,  12;\n  9: 8, 168, 1206, 4636, 11205, 18360, 21168, 17424, 10206, 4160, 1122, 180, 13;\n","recurrence_sentence":"The row polynomials satisfy (2+(2*n+4)*x+(n+3)*x^2)*P(n,x) = (2+(2*n+8)*x+(3*n+10)*x^2+(n+4)*x^3)*P(n-1,x) for n >= 1, with P(0,x) = 8 + 24*x + 18*x^2 + 4*x^3.","mathematica":"P[0, x_] := 8 + 24*x + 18*x^2 + 4*x^3;\nP[n_, x_] := P[n, x] = Expand[Together[((2 + (2*n + 8)*x + (3*n + 10)*x^2 + (n + 4)*x^3)*P[n - 1, x])/(2 + (2*n + 4)*x + (n + 3)*x^2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 8 + 24*x + 18*x^2 + 4*x^3; for(n = 1, N, my(i = n + 1); v[i] = ((2 + (2*n + 8)*x + (3*n + 10)*x^2 + (n + 4)*x^3)*v[i - 1])/(2 + (2*n + 4)*x + (n + 3)*x^2)); 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-f48bed27dbc29c5f","steps":["P\u2099 + P\u2099\u208a\u2081","\u03b8+1"],"edges":["e-0331d381cbbd8a41","e-aa2cd841c454b26e"],"text":"A391533 \u2192 P\u2099 + P\u2099\u208a\u2081 \u2192 \u03b8+1"},"headline":"A391533 \u2192 P\u2099 + P\u2099\u208a\u2081 \u2192 \u03b8+1","chain":null}