{"id":"n-4c77cf1836e24da4","revision":1,"first_index":0,"fingerprint":"f6-eccca8d515312e3b","name":"derivative of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).","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":[[],[],["1"],["3"],["6","6"],["10","30"],["15","90","45"],["21","210","315"],["28","420","1260","420"],["36","756","3780","3780"],["45","1260","9450","18900","4725"],["55","1980","20790","69300","51975"],["66","2970","41580","207900","311850","62370"],["78","4290","77220","540540","1351350","810810"],["91","6006","135135","1261260","4729725","5675670","945945"]],"degrees":[-1,-1,0,0,1,1,2,2,3,3,4,4,5,5,6],"row_sums":["0","0","1","3","12","40","150","546","2128","8352","34380","144100","626736","2784288","12753832"],"nonn":true,"definitions":[{"position":0,"source":"derived:derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["0"],["1"]],"recurrence":{"denominator":{"coeffs":[["-2"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0"],["1","-3"],["0","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","0"],["0","0","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":161449,"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-409924954694eb46"]},{"id":161450,"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-409924954694eb46"]},{"id":161451,"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-409924954694eb46"]}],"region_exact":{},"incoming_edges":[{"id":"e-409924954694eb46","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-4c77cf1836e24da4","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":"4cf983c6fffdf734be616353f6c1cc9c27e30b485b09bbce6ac51de034328374","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-97b51734d39ede6c","role":"sequence","name":"Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).","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-93f0f8c1756f597d","kind":"fingerprint_related","node_a_id":"n-f6268da8d9636534","node_b_id":"n-4c77cf1836e24da4","fingerprint":"f6-eccca8d515312e3b","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-eccca8d515312e3b"},"other_id":"n-f6268da8d9636534","other":{"id":"n-f6268da8d9636534","name":"Exponential Riordan array (1, x(1+x/2)).","first_index":0,"fingerprint":"f6-eccca8d515312e3b","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["0","1"],["0","1","1"]],"card_rows":[["1"],["0","1"],["0","1","1"],["0","0","3","1"]],"row_sums_preview":["1","1","2","4","10","26","76","232"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A122848"],"derivation":{"root":"n-97b51734d39ede6c","steps":["reverse"],"edges":["e-01d50252f4aaa594"],"text":"A100861 \u2192 reverse"},"headline":"A122848: Exponential Riordan array (1, x(1+x/2)).","chain":"A100861 \u2192 reverse"}},{"id":"l-a18a3827f7d1361b","kind":"fingerprint_related","node_a_id":"n-97b51734d39ede6c","node_b_id":"n-4c77cf1836e24da4","fingerprint":"f6-eccca8d515312e3b","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-eccca8d515312e3b"},"other_id":"n-97b51734d39ede6c","other":{"id":"n-97b51734d39ede6c","name":"Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).","first_index":0,"fingerprint":"f6-eccca8d515312e3b","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["1","1"]],"card_rows":[["1"],["1"],["1","1"],["1","3"]],"row_sums_preview":["1","1","2","4","10","26","76","232"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A100861","A144299"],"derivation":{"root":"n-97b51734d39ede6c","steps":[],"edges":[],"text":"A100861"},"headline":"A100861: Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).","chain":null}},{"id":"l-aa282d5ffce2da81","kind":"oeis_match","node_a_id":"n-4c77cf1836e24da4","node_b_id":null,"fingerprint":null,"oeis_id":"A162970","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":0,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A162970","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A162970","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-4c77cf1836e24da4","oeis_id":"A162970","target":"row_sums","oeis_offset":1,"first_row":1,"rows_used":200,"terms_matched":14,"oeis_terms_agreeing":24,"oeis_terms_available":24,"term_count":200,"raw_size":18657}],"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:  1;\n  3:  3;\n  4:  6,   6;\n  5: 10,  30;\n  6: 15,  90,   45;\n  7: 21, 210,  315;\n  8: 28, 420, 1260,  420;\n  9: 36, 756, 3780, 3780;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = (n+(n^2-3*n)*x)*P(n-1,x) - 2*n*x^2*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 1.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 0;\nP[2, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[((n + (n^2 - 3*n)*x)*P[n - 1, x] - 2*n*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] = 1; for(n = 3, N, my(i = n + 1); v[i] = ((n + (n^2 - 3*n)*x)*v[i - 1] - 2*n*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-97b51734d39ede6c","steps":["D"],"edges":["e-409924954694eb46"],"text":"A100861 \u2192 D"},"headline":"A100861 \u2192 D","chain":null}