{"id":"n-6a10c7a80c231fbf","revision":0,"first_index":0,"fingerprint":"f6-ba0dd714702bb20c","name":"derivative of basis_map_A013610 of Triangle read by rows: T(n,k) is the number of ways to tile a 3 X n rectangle with k pieces of 2 X 2 tiles and 3n-4k pieces of 1 X 1 tiles (0 <= k <= floor(n/2)).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":-2,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[[],[],["6"],["12"],["42","72"],["96","216"],["246","864","648"],["564","2448","2592"],["1314","7128","11664","5184"],["2952","18792","38880","25920"],["6606","48816","126360","129600","38880"],["14556","121824","373248","492480","233280"],["31866","298728","1065312","1762560","1283040","279936"],["69168","717048","2908224","5733504","5443200","1959552"],["149286","1696896","7727400","17781120","21228480","11757312","1959552"]],"degrees":[-1,-1,0,0,1,1,2,2,3,3,4,4,5,5,6],"row_sums":["0","0","6","12","114","312","1758","5604","25290","86544","350262","1235388","4721442","16830696","62300046"],"nonn":true,"definitions":[{"position":0,"source":"derived:derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["0"],["6"]],"recurrence":{"denominator":{"coeffs":[["-2"],["1"]]},"terms":[{"coeff":{"coeffs":[["-13","-36"],["5","12"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-3","-17","-24"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":174437,"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-f1e2166d5cda988e"]},{"id":174438,"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-f1e2166d5cda988e"]},{"id":174439,"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-f1e2166d5cda988e"]}],"region_exact":{},"incoming_edges":[{"id":"e-f1e2166d5cda988e","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"derivative_polynomial\",\"coefficients\":[{\"numerator\":[\"0\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-6a10c7a80c231fbf","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":"1504f0b2ee74de6bf18df343b153d469e1638326fba6908b0dbd3bc97d2e1474","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-f8135e42b21d6fe3","role":"sequence","name":"basis_map_A013610 of Triangle read by rows: T(n,k) is the number of ways to tile a 3 X n rectangle with k pieces of 2 X 2 tiles and 3n-4k pieces of 1 X 1 tiles (0 <= 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:    0;\n  1:    0;\n  2:    6;\n  3:   12;\n  4:   42,    72;\n  5:   96,   216;\n  6:  246,   864,   648;\n  7:  564,  2448,  2592;\n  8: 1314,  7128, 11664,  5184;\n  9: 2952, 18792, 38880, 25920;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = (5*n-13+(12*n-36)*x)*P(n-1,x) - (3+17*x+24*x^2)*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 6.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 0;\nP[2, x_] := 6;\nP[n_, x_] := P[n, x] = Expand[Together[((5*n - 13 + (12*n - 36)*x)*P[n - 1, x] - (3 + 17*x + 24*x^2)*D[P[n - 1, x], x])/(n - 2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 0; v[3] = 6; for(n = 3, N, my(i = n + 1); v[i] = ((5*n - 13 + (12*n - 36)*x)*v[i - 1] - (3 + 17*x + 24*x^2)*deriv(v[i - 1], x))/(n - 2)); 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-e3d901814302c059","steps":["basis A013610","D"],"edges":["e-114dd09068d0c756","e-f1e2166d5cda988e"],"text":"A128099 \u2192 basis A013610 \u2192 D"},"headline":"A128099 \u2192 basis A013610 \u2192 D","chain":null}