{"id":"n-8aa50ef542759ee0","revision":0,"first_index":1,"fingerprint":"f6-9a4b425d2a954ae8","name":"derivative of basis_map_A013609 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":[[],["4"],["36","48"],["264","720","480"],["1800","7440","10080","4480"],["11820","65520","134400","120960","40320"],["75852","527520","1451520","1975680","1330560","354816"],["479248","4009824","13849920","25280640","25724160","13837824","3075072"],["2994192","29282400","121746240","278974080","380540160","309044736","138378240","26357760"],["18548820","207614880","1009451520","2784862080","4768283520","5189184000","3505582080","1344245760","224040960"],["114148980","1438992720","8011111680","25851745920","53292919680","72786954240","65868042240","38086963200","12770334720","1891901440"],["698734872","9796129200","61447145760","227095989120","547654947840","900510234624","1022522941440","791760752640","400137154560","119189790720","15891972096"],["4258447128","65722600944","458633054880","1910230882560","5276500669440","10149637994496","13873691639808","13476959907840","9118018990080","4092182814720","1096546074624","132914675712"],["25858331772","435640842000","3347577192960","15514864485120","48303427011840","106430523623424","170183156183040","198987355607040","168862136002560","101430511902720","40937720119296","9968600678400","1107622297600"],["156531277980","2858422432320","23983238522880","122423009829120","424177841767680","1053503661450240","1929623116861440","2639159941017600","2695447319685120","2030437814845440","1096546074624000","402066894028800","89717406105600","9201785241600"]],"degrees":[-1,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["0","4","84","1464","23800","373020","5715948","86256688","1287317808","19051813620","280113114820","4096705792872","59655297752232","865534994277772","12519303057689820"],"nonn":true,"definitions":[{"position":0,"source":"derived:derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["0"],["4"]],"recurrence":{"denominator":{"coeffs":[["-2"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0"],["3","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["2","6","4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":186920,"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-752d48bd38b7d7a0"]},{"id":186921,"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-752d48bd38b7d7a0"]},{"id":186922,"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-752d48bd38b7d7a0"]},{"id":186923,"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-752d48bd38b7d7a0"]}],"region_exact":{},"incoming_edges":[{"id":"e-752d48bd38b7d7a0","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-8aa50ef542759ee0","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":"639f89a8cb32419980dab3652eabb241b2a8432d26e4ad1975675b7c9c999f0b","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-dfe248045567f938","role":"sequence","name":"basis_map_A013609 of 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-158db59803a32b91","kind":"fingerprint_related","node_a_id":"n-1dd418d798e58c37","node_b_id":"n-8aa50ef542759ee0","fingerprint":"f6-9a4b425d2a954ae8","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-9a4b425d2a954ae8"},"other_id":"n-1dd418d798e58c37","other":{"id":"n-1dd418d798e58c37","name":"reversal of basis_map_A013609 of 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-9a4b425d2a954ae8","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["4","3"],["20","30","11"]],"card_rows":[["1"],["4","3"],["20","30","11"],["112","252","186","45"]],"row_sums_preview":["1","7","61","595","6217","68047","770149","8939707"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-66e2c3448245b0b7","steps":["basis A013609","reverse"],"edges":["e-4e2df72103232439","e-37243cfec5f9f025"],"text":"A033282 \u2192 basis A013609 \u2192 reverse"},"headline":"A033282 \u2192 basis A013609 \u2192 reverse","chain":null}},{"id":"l-2778c5c0497c6152","kind":"fingerprint_related","node_a_id":"n-c797a96ea6c06aee","node_b_id":"n-8aa50ef542759ee0","fingerprint":"f6-9a4b425d2a954ae8","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-9a4b425d2a954ae8"},"other_id":"n-c797a96ea6c06aee","other":{"id":"n-c797a96ea6c06aee","name":"mobius_x_over_x_plus_one of shift_x_plus_one of Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis. A weak ascent in a Schroeder path is a maximal sequence of consecutive U and H steps.","first_index":1,"fingerprint":"f6-9a4b425d2a954ae8","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["2"],["6","8"],["22","60","40"]],"card_rows":[["2"],["6","8"],["22","60","40"],["90","372","504","224"]],"row_sums_preview":["2","14","122","1190","12434","136094","1540298","17879414"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-6a30765140629bd5","steps":["x \u21a6 x+1","x \u21a6 x/(x+1)"],"edges":["e-5ebd2cd7e542e718","e-97c6c056462a8fe9"],"text":"A114655 \u2192 x \u21a6 x+1 \u2192 x \u21a6 x/(x+1)"},"headline":"A114655 \u2192 x \u21a6 x+1 \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-65bf9ed9246f887a","kind":"fingerprint_related","node_a_id":"n-a82935040c56619d","node_b_id":"n-8aa50ef542759ee0","fingerprint":"f6-9a4b425d2a954ae8","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-9a4b425d2a954ae8"},"other_id":"n-a82935040c56619d","other":{"id":"n-a82935040c56619d","name":"mobius_x_over_x_plus_one of basis_map_A007318 of Triangle read by rows: T(n,k) is the number of double rise-bicolored Dyck paths (double rises come in two colors; also called marked Dyck paths) of semilength n and having k peaks (1 <= k <= n).","first_index":1,"fingerprint":"f6-9a4b425d2a954ae8","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["3","4"],["11","30","20"]],"card_rows":[["1"],["3","4"],["11","30","20"],["45","186","252","112"]],"row_sums_preview":["1","7","61","595","6217","68047","770149","8939707"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["basis A007318","x \u21a6 x/(x+1)"],"edges":["e-38a7985c4c1aa2e3","e-6813be3d909d70de"],"text":"A114656 \u2192 basis A007318 \u2192 x \u21a6 x/(x+1)"},"headline":"A114656 \u2192 basis A007318 \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-b4756c42a0851120","kind":"fingerprint_related","node_a_id":"n-8217f7f3de935aeb","node_b_id":"n-8aa50ef542759ee0","fingerprint":"f6-9a4b425d2a954ae8","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-9a4b425d2a954ae8"},"other_id":"n-8217f7f3de935aeb","other":{"id":"n-8217f7f3de935aeb","name":"basis_map_A013609 of 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-9a4b425d2a954ae8","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["3","4"],["11","30","20"]],"card_rows":[["1"],["3","4"],["11","30","20"],["45","186","252","112"]],"row_sums_preview":["1","7","61","595","6217","68047","770149","8939707"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-66e2c3448245b0b7","steps":["basis A013609"],"edges":["e-4e2df72103232439"],"text":"A033282 \u2192 basis A013609"},"headline":"A033282 \u2192 basis A013609","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:        4;\n   3:       36,        48;\n   4:      264,       720,        480;\n   5:     1800,      7440,      10080,       4480;\n   6:    11820,     65520,     134400,     120960,      40320;\n   7:    75852,    527520,    1451520,    1975680,    1330560,     354816;\n   8:   479248,   4009824,   13849920,   25280640,   25724160,   13837824,    3075072;\n   9:  2994192,  29282400,  121746240,  278974080,  380540160,  309044736,  138378240,   26357760;\n  10: 18548820, 207614880, 1009451520, 2784862080, 4768283520, 5189184000, 3505582080, 1344245760, 224040960;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = (3*n+4*n*x)*P(n-1,x) + (2+6*x+4*x^2)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 0, P(2,x) = 4.","mathematica":"P[1, x_] := 0;\nP[2, x_] := 4;\nP[n_, x_] := P[n, x] = Expand[Together[((3*n + 4*n*x)*P[n - 1, x] + (2 + 6*x + 4*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] = 4; for(n = 3, N, my(i = n); v[i] = ((3*n + 4*n*x)*v[i - 1] + (2 + 6*x + 4*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":["basis A013609","D"],"edges":["e-7c694c7111620c7d","e-752d48bd38b7d7a0"],"text":"A063007 \u2192 basis A013609 \u2192 D"},"headline":"A063007 \u2192 basis A013609 \u2192 D","chain":null}