{"id":"n-98f16fdd4b44e5ec","revision":0,"first_index":0,"fingerprint":"f6-31c7f065f4c4bbdd","name":"theta_plus_one of shift_x_plus_one of Riordan array (1-x,x/(1-x)).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":2,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1","4","3"],["2","10","12","4"],["4","24","39","24","5"],["8","56","114","100","40","6"],["16","128","312","352","205","60","7"],["32","288","816","1120","850","366","84","8"],["64","640","2064","3328","3100","1752","595","112","9"],["128","1408","5088","9408","10360","7224","3234","904","144","10"],["256","3072","12288","25600","32480","26880","14896","5504","1305","180","11"],["512","6656","29184","67584","96960","92736","61152","28032","8802","1810","220","12"],["1024","14336","68352","174080","278400","301824","230496","125952","49140","13400","2431","264","13"],["2048","30720","158208","439296","774400","937728","813120","515328","239976","81400","19602","3180","312","14"],["4096","65536","362496","1089536","2097920","2804736","2720256","1959936","1059696","429440","128744","27744","4069","364","15"],["8192","139264","823296","2662400","5557760","8126976","8712704","7028736","4324320","2036320","729872","195936","38194","5110","420","16"],["16384","294912","1855488","6422528","14443520","22923264","26906880","24014848","16555968","8877440","3699696","1188096","288652","51352","6315","480","17"]],"degrees":[2,3,4,5,6,7,8,9,10,11,12,13,14,15,16],"row_sums":["8","28","96","324","1080","3564","11664","37908","122472","393660","1259712","4015332","12754584","40389516","127545840"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1","4","3"]],"recurrence":{"denominator":{"coeffs":[["2","6","2"],["0","1","1"]]},"terms":[{"coeff":{"coeffs":[["4","16","13","3"],["0","2","3","1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":174471,"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-48bf1625bd6f46af"]},{"id":174472,"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-48bf1625bd6f46af"]},{"id":174473,"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-48bf1625bd6f46af"]},{"id":174474,"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-48bf1625bd6f46af"]}],"region_exact":{},"incoming_edges":[{"id":"e-48bf1625bd6f46af","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-98f16fdd4b44e5ec","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":"4c89de1490ccbb80a6c95382536badf05cba7c2aa7e356e576694777d79ceca1","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-21d2f90cb223c8f5","role":"sequence","name":"shift_x_plus_one of Riordan array (1-x,x/(1-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:   1,    4,     3;\n  1:   2,   10,    12,     4;\n  2:   4,   24,    39,    24,     5;\n  3:   8,   56,   114,   100,    40,     6;\n  4:  16,  128,   312,   352,   205,    60,     7;\n  5:  32,  288,   816,  1120,   850,   366,    84,     8;\n  6:  64,  640,  2064,  3328,  3100,  1752,   595,   112,    9;\n  7: 128, 1408,  5088,  9408, 10360,  7224,  3234,   904,  144,   10;\n  8: 256, 3072, 12288, 25600, 32480, 26880, 14896,  5504, 1305,  180,  11;\n  9: 512, 6656, 29184, 67584, 96960, 92736, 61152, 28032, 8802, 1810, 220, 12;\n","recurrence_sentence":"The row polynomials satisfy (2+(n+6)*x+(n+2)*x^2)*P(n,x) = (4+(2*n+16)*x+(3*n+13)*x^2+(n+3)*x^3)*P(n-1,x) for n >= 1, with P(0,x) = 1 + 4*x + 3*x^2.","mathematica":"P[0, x_] := 1 + 4*x + 3*x^2;\nP[n_, x_] := P[n, x] = Expand[Together[((4 + (2*n + 16)*x + (3*n + 13)*x^2 + (n + 3)*x^3)*P[n - 1, x])/(2 + (n + 6)*x + (n + 2)*x^2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1 + 4*x + 3*x^2; for(n = 1, N, my(i = n + 1); v[i] = ((4 + (2*n + 16)*x + (3*n + 13)*x^2 + (n + 3)*x^3)*v[i - 1])/(2 + (n + 6)*x + (n + 2)*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-7717563017cb9e5f","steps":["x \u21a6 x+1","\u03b8+1"],"edges":["e-34caf7309ed0b453","e-48bf1625bd6f46af"],"text":"A159854 \u2192 x \u21a6 x+1 \u2192 \u03b8+1"},"headline":"A159854 \u2192 x \u21a6 x+1 \u2192 \u03b8+1","chain":null}