{"id":"n-68cd61e91317cdaa","revision":1,"first_index":1,"fingerprint":"f6-1e5fbd8fe1b88630","name":"derivative of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":-2,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[[],["2"],["6","12"],["12","60","60"],["20","180","420","280"],["30","420","1680","2520","1260"],["42","840","5040","12600","13860","5544"],["56","1512","12600","46200","83160","72072","24024"],["72","2520","27720","138600","360360","504504","360360","102960"],["90","3960","55440","360360","1261260","2522520","2882880","1750320","437580"],["110","5940","102960","840840","3783780","10090080","16336320","15752880","8314020","1847560"],["132","8580","180180","1801800","10090080","34306272","73513440","99768240","83140200","38798760","7759752"],["156","12012","300300","3603600","24504480","102918816","279351072","498841200","581981400","426786360","178474296","32449872"],["182","16380","480480","6806800","55135080","279351072","931170240","2095133040","3200897700","3272028760","2141691552","811246800","135207800"],["210","21840","742560","12252240","116396280","698377680","2793510720","7682154480","14724129420","19632172560","17847429600","10546208400","3650610600","561632400"]],"degrees":[-1,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["0","2","18","132","900","5910","37926","239624","1497096","9274410","57074490","349367436","2129223564","12929165886","78265638990"],"nonn":true,"definitions":[{"position":0,"source":"derived:derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["0"],["2"]],"recurrence":{"denominator":{"coeffs":[["-2"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0"],["1","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","2","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":165651,"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-ab4d580ed9bca928"]},{"id":165652,"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-ab4d580ed9bca928"]},{"id":165653,"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-ab4d580ed9bca928"]},{"id":165654,"position":3,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2","region_exact":null,"edges":["e-ab4d580ed9bca928"]}],"region_exact":{},"incoming_edges":[{"id":"e-ab4d580ed9bca928","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-68cd61e91317cdaa","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":"eaa432c1206e15f4561011ef201c63f7f3907b3e7c2840206c08f56ee0fe09e8","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-4689fb1386d440ad","role":"sequence","name":"T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.","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-35b8b1db2927a44c","kind":"fingerprint_related","node_a_id":"n-6f30da2298fd30ba","node_b_id":"n-68cd61e91317cdaa","fingerprint":"f6-1e5fbd8fe1b88630","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-1e5fbd8fe1b88630"},"other_id":"n-6f30da2298fd30ba","other":{"id":"n-6f30da2298fd30ba","name":"basis_map_A007318 of narayana","first_index":1,"fingerprint":"f6-1e5fbd8fe1b88630","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","1"],["5","5","1"]],"card_rows":[["1"],["2","1"],["5","5","1"],["14","21","9","1"]],"row_sums_preview":["1","3","11","45","197","903","4279","20793"],"regions":["(-inf, 0]","(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-2a05d8340c329b21","steps":["basis A007318"],"edges":["e-58b8cdf8af6ac600"],"text":"narayana \u2192 basis A007318"},"headline":"narayana \u2192 basis A007318","chain":null}},{"id":"l-834f3435b3e0725a","kind":"fingerprint_related","node_a_id":"n-b2e66fb8e43e7448","node_b_id":"n-68cd61e91317cdaa","fingerprint":"f6-1e5fbd8fe1b88630","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-1e5fbd8fe1b88630"},"other_id":"n-b2e66fb8e43e7448","other":{"id":"n-b2e66fb8e43e7448","name":"mobius_x_over_x_plus_one of Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).","first_index":0,"fingerprint":"f6-1e5fbd8fe1b88630","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","4"],["3","15","15"]],"card_rows":[["1"],["2","4"],["3","15","15"],["4","36","84","56"]],"row_sums_preview":["1","6","33","180","985","5418","29953","166344"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-984320118b653f6b","steps":["x \u21a6 x/(x+1)"],"edges":["e-6a8f8db3c1596aaf"],"text":"A132812 \u2192 x \u21a6 x/(x+1)"},"headline":"A132812 \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-a1eb46f23fa2f474","kind":"fingerprint_related","node_a_id":"n-57b4b14604f4c0d7","node_b_id":"n-68cd61e91317cdaa","fingerprint":"f6-1e5fbd8fe1b88630","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-1e5fbd8fe1b88630"},"other_id":"n-57b4b14604f4c0d7","other":{"id":"n-57b4b14604f4c0d7","name":"Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks at level one (n >= 1; 0 <= k <= n-1).","first_index":0,"fingerprint":"f6-1e5fbd8fe1b88630","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","1"],["5","5","1"]],"card_rows":[["1"],["2","1"],["5","5","1"],["14","21","9","1"]],"row_sums_preview":["1","3","11","45","197","903","4279","20793"],"regions":["(-inf, +inf)","(-inf, 0)","(-inf, 0]","(-inf, -1]"],"region_exact":{},"oeis_ids":["A126216"],"derivation":{"root":"n-57b4b14604f4c0d7","steps":[],"edges":[],"text":"A126216"},"headline":"A126216: Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks at level one (n >= 1; 0 <= k <= n-1).","chain":null}},{"id":"l-d1877095faa77000","kind":"fingerprint_related","node_a_id":"n-66e2c3448245b0b7","node_b_id":"n-68cd61e91317cdaa","fingerprint":"f6-1e5fbd8fe1b88630","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-1e5fbd8fe1b88630"},"other_id":"n-66e2c3448245b0b7","other":{"id":"n-66e2c3448245b0b7","name":"Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.","first_index":0,"fingerprint":"f6-1e5fbd8fe1b88630","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","2"],["1","5","5"]],"card_rows":[["1"],["1","2"],["1","5","5"],["1","9","21","14"]],"row_sums_preview":["1","3","11","45","197","903","4279","20793"],"regions":["(-inf, +inf)","(-inf, 0)","(-1, 0)","[-1, 0]","(-inf, 0]"],"region_exact":{},"oeis_ids":["A033282"],"derivation":{"root":"n-66e2c3448245b0b7","steps":[],"edges":[],"text":"A033282"},"headline":"A033282: Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.","chain":null}},{"id":"l-d9d3c9f6faa3c083","kind":"fingerprint_related","node_a_id":"n-4d61144188f12208","node_b_id":"n-68cd61e91317cdaa","fingerprint":"f6-1e5fbd8fe1b88630","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-1e5fbd8fe1b88630"},"other_id":"n-4d61144188f12208","other":{"id":"n-4d61144188f12208","name":"mobius_x_over_x_plus_one of narayana","first_index":1,"fingerprint":"f6-1e5fbd8fe1b88630","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","2"],["1","5","5"]],"card_rows":[["1"],["1","2"],["1","5","5"],["1","9","21","14"]],"row_sums_preview":["1","3","11","45","197","903","4279","20793"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-2a05d8340c329b21","steps":["x \u21a6 x/(x+1)"],"edges":["e-50c973bfb8d0ccf1"],"text":"narayana \u2192 x \u21a6 x/(x+1)"},"headline":"narayana \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-ed9bc60c828dd392","kind":"fingerprint_related","node_a_id":"n-00a555c278779f26","node_b_id":"n-68cd61e91317cdaa","fingerprint":"f6-1e5fbd8fe1b88630","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-1e5fbd8fe1b88630"},"other_id":"n-00a555c278779f26","other":{"id":"n-00a555c278779f26","name":"shift_x_plus_one of Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).","first_index":0,"fingerprint":"f6-1e5fbd8fe1b88630","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["4","2"],["15","15","3"]],"card_rows":[["1"],["4","2"],["15","15","3"],["56","84","36","4"]],"row_sums_preview":["1","6","33","180","985","5418","29953","166344"],"regions":["(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-984320118b653f6b","steps":["x \u21a6 x+1"],"edges":["e-f4ea45816c9a82eb"],"text":"A132812 \u2192 x \u21a6 x+1"},"headline":"A132812 \u2192 x \u21a6 x+1","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:  0;\n   2:  2;\n   3:  6,   12;\n   4: 12,   60,    60;\n   5: 20,  180,   420,    280;\n   6: 30,  420,  1680,   2520,    1260;\n   7: 42,  840,  5040,  12600,   13860,    5544;\n   8: 56, 1512, 12600,  46200,   83160,   72072,   24024;\n   9: 72, 2520, 27720, 138600,  360360,  504504,  360360,  102960;\n  10: 90, 3960, 55440, 360360, 1261260, 2522520, 2882880, 1750320, 437580;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = (n+2*n*x)*P(n-1,x) + (2*x+2*x^2)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 0, P(2,x) = 2.","mathematica":"P[1, x_] := 0;\nP[2, x_] := 2;\nP[n_, x_] := P[n, x] = Expand[Together[((n + 2*n*x)*P[n - 1, x] + (2*x + 2*x^2)*D[P[n - 1, x], x])/(n - 2)]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 0; v[2] = 2; for(n = 3, N, my(i = n); v[i] = ((n + 2*n*x)*v[i - 1] + (2*x + 2*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, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-4689fb1386d440ad","steps":["D"],"edges":["e-ab4d580ed9bca928"],"text":"A063007 \u2192 D"},"headline":"A063007 \u2192 D","chain":null}