{"id":"n-7bf477095dcafb9b","revision":1,"first_index":0,"fingerprint":"f6-a00ae2a40a838ac6","name":"theta_plus_one of Triangle of increasing mobiles (circular rooted trees) with n nodes and k leaves.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"irregular","degree_slope":null,"degree_intercept":null,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["1","2"],["1","8","6"],["1","22","54","24"],["1","52","294","384","120"],["1","114","1272","3496","3000","720"],["1","240","4842","24160","41220","25920","5040"],["1","494","17046","141832","417500","501768","246960","40320"],["1","1004","57066","749152","3505820","7018608","6411888","2580480","362880"],["1","2026","184752","3681400","25957060","79974504","118578600","86594688","29393280","3628800"],["1","4072","584646","17188960","175802800","791331744","1763086080","2047941504","1238729760","362880000","39916800"],["1","8166","1821126","77330648","1115362200","7068587424","22497026608","38548042752","36491843952","18768830400","4829932800","479001600"],["1","16356","5610366","338460608","6736770720","58472740224","256439410192","616914992640","848825172720","674246223360","300877822080","68976230400","6227020800"],["1","32738","17150040","1451088776","39183838480","455930064576","2681912431408","8745276892544","16661808321840","19003270284000","12951377036928","5094709332480","1052366515200","87178291200"]],"degrees":[0,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["1","1","3","15","101","851","8603","101423","1365921","20686899","347995111","6437466367","129877787677","2838060470467","66774481280211"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","0","-2"],["0","0","3"],["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0","1"],["0","0","-1"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1","-2"],["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":165380,"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-9df2a8c8eaf90245"]},{"id":165381,"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-9df2a8c8eaf90245"]},{"id":165382,"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-9df2a8c8eaf90245"]},{"id":165383,"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-9df2a8c8eaf90245"]}],"region_exact":{},"incoming_edges":[{"id":"e-9df2a8c8eaf90245","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-7bf477095dcafb9b","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":"c101b9c8b60197df94a46346df03e809c5b8819a989fb2ca8aefca20cfd3e11e","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-50226352e9cd0ce4","role":"sequence","name":"Triangle of increasing mobiles (circular rooted trees) with n nodes and k leaves.","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: 1;\n  2: 1,    2;\n  3: 1,    8,     6;\n  4: 1,   22,    54,     24;\n  5: 1,   52,   294,    384,     120;\n  6: 1,  114,  1272,   3496,    3000,     720;\n  7: 1,  240,  4842,  24160,   41220,   25920,    5040;\n  8: 1,  494, 17046, 141832,  417500,  501768,  246960,   40320;\n  9: 1, 1004, 57066, 749152, 3505820, 7018608, 6411888, 2580480, 362880;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n^2-3*n+2)*x^2*P(n-2,x) - (n-1)*x^2*d/dx P(n-2,x) + (1+(2*n-2)*x)*P(n-1,x) + x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[-(n^2 - 3*n + 2)*x^2*P[n - 2, x] - (n - 1)*x^2*D[P[n - 2, x], x] + (1 + (2*n - 2)*x)*P[n - 1, x] + x*D[P[n - 1, x], x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 - 3*n + 2)*x^2*v[i - 2] - (n - 1)*x^2*deriv(v[i - 2], x) + (1 + (2*n - 2)*x)*v[i - 1] + x*deriv(v[i - 1], 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-50226352e9cd0ce4","steps":["\u03b8+1"],"edges":["e-9df2a8c8eaf90245"],"text":"A055356 \u2192 \u03b8+1"},"headline":"A055356 \u2192 \u03b8+1","chain":null}