{"id":"n-fc4868f5abe13716","revision":1,"first_index":0,"fingerprint":"f6-a8a568dbe8d79931","name":"theta_plus_one of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials.","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"],["1"],["1","2"],["1","4"],["1","6","3"],["1","8","9"],["1","10","18","4"],["1","12","30","16"],["1","14","45","40","5"],["1","16","63","80","25"],["1","18","84","140","75","6"],["1","20","108","224","175","36"],["1","22","135","336","350","126","7"],["1","24","165","480","630","336","49"],["1","26","198","660","1050","756","196","8"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","3","5","10","18","33","59","105","185","324","564","977","1685","2895"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0","0"],["1","0"],["0","1"]]},"terms":[{"coeff":{"coeffs":[["0","-4","-4"],["1","4","2"],["0","1","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-1","-6","-8"],["0","0","-1","-4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":160826,"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-9f2b3396d0c866b1"]},{"id":160827,"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-9f2b3396d0c866b1"]},{"id":160828,"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-9f2b3396d0c866b1"]}],"region_exact":{},"incoming_edges":[{"id":"e-9f2b3396d0c866b1","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-fc4868f5abe13716","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":"6502180c6ec61909fbe4188333939335a2501616b92f23c67f5b4510e14b330c","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-75ccd0453a9b6cec","role":"sequence","name":"Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one version of) Fibonacci polynomials.","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":[{"id":"l-3a29988efdd10e52","kind":"fingerprint_related","node_a_id":"n-fc4868f5abe13716","node_b_id":"n-4ff9b4e81f5b0120","fingerprint":"f6-a8a568dbe8d79931","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-a8a568dbe8d79931"},"other_id":"n-4ff9b4e81f5b0120","other":{"id":"n-4ff9b4e81f5b0120","name":"theta_plus_one of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.","first_index":1,"fingerprint":"f6-a8a568dbe8d79931","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["1","2"]],"card_rows":[["1"],["1"],["1","2"],["1","4"]],"row_sums_preview":["1","1","3","5","10","18","33","59"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-c8b3f39d03de798f","steps":["\u03b8+1"],"edges":["e-2f2b497ea65d3c56"],"text":"A052553 \u2192 \u03b8+1"},"headline":"A052553 \u2192 \u03b8+1","chain":null}},{"id":"l-8182ae550c584d91","kind":"fingerprint_related","node_a_id":"n-fc4868f5abe13716","node_b_id":"n-4cc831acec19953c","fingerprint":"f6-a8a568dbe8d79931","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-a8a568dbe8d79931"},"other_id":"n-4cc831acec19953c","other":{"id":"n-4cc831acec19953c","name":"theta_plus_one of Triangle read by rows: T(n,k) = binomial(n+1-k,k) (n >= 0, 0 <= k <= n).","first_index":0,"fingerprint":"f6-a8a568dbe8d79931","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","2"],["1","4"]],"card_rows":[["1"],["1","2"],["1","4"],["1","6","3"]],"row_sums_preview":["1","3","5","10","18","33","59","105"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-569a801b809b6abd","steps":["\u03b8+1"],"edges":["e-fdcd1c9a322f2427"],"text":"A169803 \u2192 \u03b8+1"},"headline":"A169803 \u2192 \u03b8+1","chain":null}},{"id":"l-03ba3edad6bb1f5c","kind":"oeis_match","node_a_id":"n-fc4868f5abe13716","node_b_id":null,"fingerprint":null,"oeis_id":"A010049","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A010049","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A010049","relation":"match_row_sums"}],"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,  4;\n  4: 1,  6,  3;\n  5: 1,  8,  9;\n  6: 1, 10, 18,  4;\n  7: 1, 12, 30, 16;\n  8: 1, 14, 45, 40,  5;\n  9: 1, 16, 63, 80, 25;\n","recurrence_sentence":"The row polynomials satisfy (n+n^2*x)*P(n,x) = (n+(n^2+4*n-4)*x+(2*n^2+2*n-4)*x^2)*P(n-1,x) - (x+(n+6)*x^2+(4*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[((n + (n^2 + 4*n - 4)*x + (2*n^2 + 2*n - 4)*x^2)*P[n - 1, x] - (x + (n + 6)*x^2 + (4*n + 8)*x^3)*D[P[n - 1, x], x])/(n + 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] = ((n + (n^2 + 4*n - 4)*x + (2*n^2 + 2*n - 4)*x^2)*v[i - 1] - (x + (n + 6)*x^2 + (4*n + 8)*x^3)*deriv(v[i - 1], x))/(n + 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-75ccd0453a9b6cec","steps":["\u03b8+1"],"edges":["e-9f2b3396d0c866b1"],"text":"A011973 \u2192 \u03b8+1"},"headline":"A011973 \u2192 \u03b8+1","chain":null}