{"id":"n-7872228541dd86d5","revision":0,"first_index":0,"fingerprint":"f6-60e5382a5ccf99ce","name":"theta_plus_one_squared of Triangular array of the number of binary, rooted, leaf-labeled tree topologies with n leaves and k cherries, n >= 2, 1 <= k <= floor(n/2).","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"],["3"],["12","12"],["60","180"],["360","2160","405"],["2520","25200","14175"],["20160","302400","340200","25200"],["181440","3810240","7144200","1587600"],["1814400","50803200","142884000","63504000","2480625"],["19958400","718502400","2829103200","2095632000","245581875"],["239500800","10777536000","56582064000","62868960000","14734912500","353637900"],["3113510400","171243072000","1155890736000","1798052256000","702364162500","50570219700"],["43589145600","2876883609600","24273705456000","50345463168000","29499294825000","4247898454800","68831687925"],["653837184000","50999300352000","525930284880000","1402480759680000","1150472498175000","276113399562000","13422179145375"],["10461394944000","951986939904000","11780838381312000","39269461271040000","42950973265200000","15462350375472000","1503284064282000","17531009496000"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","3","24","240","2925","41895","687960","12723480","261486225","5908777875","145556611200","3881233956600","111355666346925","3420072258978375","111946886701650000"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one_squared","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0","0"],["-4","0"],["0","1"],["0","1"]]},"terms":[{"coeff":{"coeffs":[["0","16","-4"],["-8","-8","-4"],["-4","-6","3"],["0","3","4"],["0","1","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-16","24","-8"],["0","-8","24","-16"],["0","0","10","-10"],["0","0","2","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":184703,"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-effad78b2cfc94f2"]},{"id":184704,"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-effad78b2cfc94f2"]},{"id":184705,"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-effad78b2cfc94f2"]}],"region_exact":{},"incoming_edges":[{"id":"e-effad78b2cfc94f2","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"2\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-7872228541dd86d5","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":"fb174e77d6cfa2f8cc9ad88021a884e448b315ba5eebc7a5fd196e8562af659b","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-3951e6b9a140d595","role":"sequence","name":"Triangular array of the number of binary, rooted, leaf-labeled tree topologies with n leaves and k cherries, n >= 2, 1 <= k <= floor(n/2).","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:        3;\n  2:       12,        12;\n  3:       60,       180;\n  4:      360,      2160,        405;\n  5:     2520,     25200,      14175;\n  6:    20160,    302400,     340200,      25200;\n  7:   181440,   3810240,    7144200,    1587600;\n  8:  1814400,  50803200,  142884000,   63504000,   2480625;\n  9: 19958400, 718502400, 2829103200, 2095632000, 245581875;\n","recurrence_sentence":"The row polynomials satisfy -(4*n-(n^3+n^2)*x)*P(n,x) = -(4*n^2+8*n-(n^4+3*n^3-6*n^2-8*n+16)*x-(n^4+4*n^3+3*n^2-4*n-4)*x^2)*P(n-1,x) - ((8*n+16)*x-(2*n^3+10*n^2+24*n+24)*x^2+(2*n^3+10*n^2+16*n+8)*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 + 8*n - (n^4 + 3*n^3 - 6*n^2 - 8*n + 16)*x - (n^4 + 4*n^3 + 3*n^2 - 4*n - 4)*x^2)*P[n - 1, x] - ((8*n + 16)*x - (2*n^3 + 10*n^2 + 24*n + 24)*x^2 + (2*n^3 + 10*n^2 + 16*n + 8)*x^3)*D[P[n - 1, x], x])/(-4*n + (n^3 + n^2)*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 + 8*n - (n^4 + 3*n^3 - 6*n^2 - 8*n + 16)*x - (n^4 + 4*n^3 + 3*n^2 - 4*n - 4)*x^2)*v[i - 1] - ((8*n + 16)*x - (2*n^3 + 10*n^2 + 24*n + 24)*x^2 + (2*n^3 + 10*n^2 + 16*n + 8)*x^3)*deriv(v[i - 1], x))/(-4*n + (n^3 + n^2)*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-3951e6b9a140d595","steps":["(\u03b8+1)\u00b2"],"edges":["e-effad78b2cfc94f2"],"text":"A306364 \u2192 (\u03b8+1)\u00b2"},"headline":"A306364 \u2192 (\u03b8+1)\u00b2","chain":null}