{"id":"n-c0bc993b102aee3c","revision":0,"first_index":0,"fingerprint":"f6-52e6545ce093df69","name":"theta_plus_one of veronese_section_2_1 of Triangle, row sums = number of edges in n-dimensional hypercubes.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":-1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[[],["3"],["6"],["9","14"],["12","56"],["15","140","33"],["18","280","198"],["21","490","693","60"],["24","784","1848","480"],["27","1176","4158","2160","95"],["30","1680","8316","7200","950"],["33","2310","15246","19800","5225","138"],["36","3080","26136","47520","20900","1656"],["39","4004","42471","102960","67925","10764","189"],["42","5096","66066","205920","190190","50232","2646"]],"degrees":[-1,0,0,1,1,2,2,3,3,4,4,5,5,6,6],"row_sums":["0","3","6","23","68","188","496","1264","3136","7616","18176","42752","99328","228352","520192"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["3"],["6"],["9","14"],["12","56"],["15","140","33"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","3","-3","1"]]},"deriv_order":0,"offset":6,"sign":"none"},{"coeff":{"coeffs":[["6","-12","6"]]},"deriv_order":0,"offset":5,"sign":"none"},{"coeff":{"coeffs":[["-15","18","-3"]]},"deriv_order":0,"offset":4,"sign":"none"},{"coeff":{"coeffs":[["20","-12"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-15","3"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["6"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":173243,"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-835a27cb20553cd0"]},{"id":173244,"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-835a27cb20553cd0"]},{"id":173245,"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-835a27cb20553cd0"]}],"region_exact":{},"incoming_edges":[{"id":"e-835a27cb20553cd0","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-c0bc993b102aee3c","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":"65f23d093a74fa69db21c0dfd629e09fc6688baaf1181267776e0b07ffdbbc61","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-12574b7265731dfe","role":"sequence","name":"veronese_section_2_1 of Triangle, row sums = number of edges in n-dimensional hypercubes.","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:  0;\n  1:  3;\n  2:  6;\n  3:  9,   14;\n  4: 12,   56;\n  5: 15,  140,   33;\n  6: 18,  280,  198;\n  7: 21,  490,  693,   60;\n  8: 24,  784, 1848,  480;\n  9: 27, 1176, 4158, 2160, 95;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(1-3*x+3*x^2-x^3)*P(n-6,x) + (6-12*x+6*x^2)*P(n-5,x) - (15-18*x+3*x^2)*P(n-4,x) + (20-12*x)*P(n-3,x) - (15-3*x)*P(n-2,x) + 6*P(n-1,x) for n >= 6, with P(0,x) = 0, P(1,x) = 3, P(2,x) = 6, P(3,x) = 9 + 14*x, P(4,x) = 12 + 56*x, P(5,x) = 15 + 140*x + 33*x^2.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 3;\nP[2, x_] := 6;\nP[3, x_] := 9 + 14*x;\nP[4, x_] := 12 + 56*x;\nP[5, x_] := 15 + 140*x + 33*x^2;\nP[n_, x_] := P[n, x] = Expand[-(1 - 3*x + 3*x^2 - x^3)*P[n - 6, x] + (6 - 12*x + 6*x^2)*P[n - 5, x] - (15 - 18*x + 3*x^2)*P[n - 4, x] + (20 - 12*x)*P[n - 3, x] - (15 - 3*x)*P[n - 2, x] + 6*P[n - 1, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 3; v[3] = 6; v[4] = 9 + 14*x; v[5] = 12 + 56*x; v[6] = 15 + 140*x + 33*x^2; for(n = 6, N, my(i = n + 1); v[i] = -(1 - 3*x + 3*x^2 - x^3)*v[i - 6] + (6 - 12*x + 6*x^2)*v[i - 5] - (15 - 18*x + 3*x^2)*v[i - 4] + (20 - 12*x)*v[i - 3] - (15 - 3*x)*v[i - 2] + 6*v[i - 1]); 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-6202e291a2627bce","steps":["Veronese 2 (j=1)","\u03b8+1"],"edges":["e-1c825decf3e66eda","e-835a27cb20553cd0"],"text":"A116666 \u2192 Veronese 2 (j=1) \u2192 \u03b8+1"},"headline":"A116666 \u2192 Veronese 2 (j=1) \u2192 \u03b8+1","chain":null}