{"id":"n-2325eb5e7ff58a07","revision":0,"first_index":1,"fingerprint":"f6-e7b59fe1fe5a68eb","name":"one_plus_derivative of basis_map_A008277 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.","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":[["1"],["1"],["3","1"],["5","2"],["11","8","1"],["21","19","3"],["43","54","15","1"],["85","132","46","4"],["171","337","160","24","1"],["341","818","476","90","5"],["683","2000","1453","370","35","1"],["1365","4795","4175","1296","155","6"],["2731","11478","11987","4599","735","48","1"],["5461","27228","33482","15254","2961","245","7"],["10923","64393","92908","50236","11970","1316","63","1"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","4","7","20","43","113","267","693","1730","4542","11792","31579","84638","231810"],"nonn":true,"definitions":[{"position":0,"source":"derived:one_plus_derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["2","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":172215,"position":0,"claim":"real_rooted","from_index":1,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-449effc81125afea"]},{"id":172216,"position":1,"claim":"one_signed_coefficients","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":1},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 1: the coefficients of P_n have one sign","region_exact":null,"edges":["e-449effc81125afea"]},{"id":172217,"position":2,"claim":"hadamard_kernel","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":1},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 1, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-449effc81125afea"]}],"region_exact":{},"incoming_edges":[{"id":"e-449effc81125afea","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"derivative_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-2325eb5e7ff58a07","premise_count":1,"theorem":"Laguerre's theorem on differential operators: if phi is a real polynomial with only real roots, then phi(D) maps every real-rooted polynomial to a real-rooted polynomial or zero (write phi(D) = C D^j prod (1 + c_i D); D preserves real-rootedness by Rolle's theorem and p + c p' is real-rooted for every real c by Rolle's theorem applied to e^(x/c) p; Polya--Schur 1914); when the coefficients of phi have one sign, coefficients of one sign stay of one sign; applied to phi(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.splits_add_C_mul_derivative_all","RealRooted.splits_C_mul_add_derivative","Polynomial.Splits.derivative"],"certificate_hash":"470d756914af3f7506af3635cf9efde0683ae32bf67cbfe41438f3724ef3fe9d","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-a4df05e4bf9e978a","role":"sequence","name":"basis_map_A008277 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.","uses":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]"}]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-07abd3312082a8e2","kind":"fingerprint_related","node_a_id":"n-4ed537afd257f87c","node_b_id":"n-2325eb5e7ff58a07","fingerprint":"f6-e7b59fe1fe5a68eb","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-e7b59fe1fe5a68eb"},"other_id":"n-4ed537afd257f87c","other":{"id":"n-4ed537afd257f87c","name":"basis_map_A008277 of Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pieces of 1 X 2 tiles (0 <= k <= floor(n/2)).","first_index":0,"fingerprint":"f6-e7b59fe1fe5a68eb","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["3","1"]],"card_rows":[["1"],["1"],["3","1"],["5","2"]],"row_sums_preview":["1","1","4","7","20","43","113","267"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-7d332fcb7bf9a0f7","steps":["basis A008277"],"edges":["e-25afb8ab03a3f3dd"],"text":"A128100 \u2192 basis A008277"},"headline":"A128100 \u2192 basis A008277","chain":null}}],"oeis":[],"bfiles":[],"oeis_texts":[{"oeis_id":"","target":"node","first_row":1,"oeis_offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1:   1;\n   2:   1;\n   3:   3,   1;\n   4:   5,   2;\n   5:  11,   8,   1;\n   6:  21,  19,   3;\n   7:  43,  54,  15,  1;\n   8:  85, 132,  46,  4;\n   9: 171, 337, 160, 24, 1;\n  10: 341, 818, 476, 90, 5;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2+x)*P(n-2,x) + x*d/dx P(n-2,x) + P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 1.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(2 + x)*P[n - 2, x] + x*D[P[n - 2, x], x] + P[n - 1, x]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1; for(n = 3, N, my(i = n); v[i] = (2 + x)*v[i - 2] + x*deriv(v[i - 2], x) + v[i - 1]); v};\nrow(n, p) = {my(c = Vecrev(p)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-c8b3f39d03de798f","steps":["basis A008277","D+1"],"edges":["e-658de443ccafc3cd","e-449effc81125afea"],"text":"A052553 \u2192 basis A008277 \u2192 D+1"},"headline":"A052553 \u2192 basis A008277 \u2192 D+1","chain":null}