{"id":"n-236a5c827b0706e7","revision":0,"first_index":0,"fingerprint":"f6-c5faa49c64af63fa","name":"derivative of Delannoy paths counted by number of weak peaks.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["8","8"],["18","72","24"],["32","288","384","64"],["50","800","2400","1600","160"],["72","1800","9600","14400","5760","384"],["98","3528","29400","78400","70560","18816","896"],["128","6272","75264","313600","501760","301056","57344","2048"],["162","10368","169344","1016064","2540160","2709504","1161216","165888","4608"],["200","16200","345600","2822400","10160640","16934400","12902400","4147200","460800","10240"],["242","24200","653400","6969600","34151040","81962496","97574400","55756800","13939200","1239040","22528"],["288","34848","1161600","15681600","100362240","327849984","562028544","501811200","223027200","44605440","3244032","49152"],["338","48672","1963104","32718400","265019040","1130747904","2638411776","3392243712","2355724800","837591040","137060352","8306688","106496"],["392","66248","3179904","64128064","641280640","3462915456","10553647104","18468882432","18468882432","10260490240","2984869888","407027712","20873216","229376"],["450","88200","4968600","119246400","1442881440","9619209600","37102665600","84806092800","115430515200","92344412160","41974732800","10175692800","1174118400","51609600","491520"],["512","115200","7526400","211993600","3052707840","24625176576","117262745600","339224371200","603065548800","656671375360","429821263872","162811084800","33397145600","3303014400","125829120","1048576"]],"degrees":[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15],"row_sums":["16","114","768","5010","32016","201698","1257472","7777314","47800080","292292946","1779856128","10799942322","65336473104","394246725570","2373580947456"],"nonn":true,"definitions":[{"position":0,"source":"derived:derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["8","8"]],"recurrence":{"denominator":{"coeffs":[["1"],["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["4","4"],["4","12"],["1","6"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","3","-6"],["0","2","-4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":183332,"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-f75fd743a43c1d65"]},{"id":183333,"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-f75fd743a43c1d65"]},{"id":183334,"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-f75fd743a43c1d65"]},{"id":183335,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-f75fd743a43c1d65"]}],"region_exact":{},"incoming_edges":[{"id":"e-f75fd743a43c1d65","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-236a5c827b0706e7","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":"0ccd0e6f60c6263f1cebe7f3f49dddc5e350de2e71322d2673a82c1ef5541b9f","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-b31aa1a3fd93d174","role":"sequence","name":"Delannoy paths counted by number of weak peaks.","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-7146bdfa65682629","kind":"fingerprint_related","node_a_id":"n-7f47b2246e50a89b","node_b_id":"n-236a5c827b0706e7","fingerprint":"f6-c5faa49c64af63fa","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c5faa49c64af63fa"},"other_id":"n-7f47b2246e50a89b","other":{"id":"n-7f47b2246e50a89b","name":"theta_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-c5faa49c64af63fa","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["2"],["4","4"],["8","24","6"]],"card_rows":[["2"],["4","4"],["8","24","6"],["16","96","72","8"]],"row_sums_preview":["2","8","38","192","1002","5336","28814","157184"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-6a30765140629bd5","steps":["\u03b8+1"],"edges":["e-d14d9d630db1a5b2"],"text":"A114655 \u2192 \u03b8+1"},"headline":"A114655 \u2192 \u03b8+1","chain":null}},{"id":"l-7810b6a940760a07","kind":"fingerprint_related","node_a_id":"n-78c1f32e7d3584ec","node_b_id":"n-236a5c827b0706e7","fingerprint":"f6-c5faa49c64af63fa","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c5faa49c64af63fa"},"other_id":"n-78c1f32e7d3584ec","other":{"id":"n-78c1f32e7d3584ec","name":"reversal of theta_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-c5faa49c64af63fa","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["2"],["4","4"],["6","24","8"]],"card_rows":[["2"],["4","4"],["6","24","8"],["8","72","96","16"]],"row_sums_preview":["2","8","38","192","1002","5336","28814","157184"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-6a30765140629bd5","steps":["\u03b8+1","reverse"],"edges":["e-d14d9d630db1a5b2","e-09fa0d29f4904372"],"text":"A114655 \u2192 \u03b8+1 \u2192 reverse"},"headline":"A114655 \u2192 \u03b8+1 \u2192 reverse","chain":null}},{"id":"l-7ac98e48bfbeb476","kind":"fingerprint_related","node_a_id":"n-7e8d73671f213694","node_b_id":"n-236a5c827b0706e7","fingerprint":"f6-c5faa49c64af63fa","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c5faa49c64af63fa"},"other_id":"n-7e8d73671f213694","other":{"id":"n-7e8d73671f213694","name":"theta_plus_one of reversal 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 double rises (0 <= k <= n-1).","first_index":0,"fingerprint":"f6-c5faa49c64af63fa","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","2"],["4","12","3"]],"card_rows":[["1"],["2","2"],["4","12","3"],["8","48","36","4"]],"row_sums_preview":["1","4","19","96","501","2668","14407","78592"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-8ce61d302cec295b","steps":["reverse","\u03b8+1"],"edges":["e-0ad5e2ffb4ffd4ba","e-ef0d0424646f90c4"],"text":"A114687 \u2192 reverse \u2192 \u03b8+1"},"headline":"A114687 \u2192 reverse \u2192 \u03b8+1","chain":null}},{"id":"l-e0ee780a281ae5e2","kind":"fingerprint_related","node_a_id":"n-69ce0ad43c657483","node_b_id":"n-236a5c827b0706e7","fingerprint":"f6-c5faa49c64af63fa","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c5faa49c64af63fa"},"other_id":"n-69ce0ad43c657483","other":{"id":"n-69ce0ad43c657483","name":"reversal of theta_plus_one 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-c5faa49c64af63fa","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","2"],["3","12","4"]],"card_rows":[["1"],["2","2"],["3","12","4"],["4","36","48","8"]],"row_sums_preview":["1","4","19","96","501","2668","14407","78592"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["\u03b8+1","reverse"],"edges":["e-57c7b63013beaaa7","e-8523f428ac45163c"],"text":"A114656 \u2192 \u03b8+1 \u2192 reverse"},"headline":"A114656 \u2192 \u03b8+1 \u2192 reverse","chain":null}},{"id":"l-e253d93341f95ce5","kind":"fingerprint_related","node_a_id":"n-9d80e1b19273e824","node_b_id":"n-236a5c827b0706e7","fingerprint":"f6-c5faa49c64af63fa","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c5faa49c64af63fa"},"other_id":"n-9d80e1b19273e824","other":{"id":"n-9d80e1b19273e824","name":"theta_plus_one 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-c5faa49c64af63fa","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","2"],["4","12","3"]],"card_rows":[["1"],["2","2"],["4","12","3"],["8","48","36","4"]],"row_sums_preview":["1","4","19","96","501","2668","14407","78592"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["\u03b8+1"],"edges":["e-57c7b63013beaaa7"],"text":"A114656 \u2192 \u03b8+1"},"headline":"A114656 \u2192 \u03b8+1","chain":null}}],"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:   8,     8;\n  1:  18,    72,     24;\n  2:  32,   288,    384,      64;\n  3:  50,   800,   2400,    1600,      160;\n  4:  72,  1800,   9600,   14400,     5760,      384;\n  5:  98,  3528,  29400,   78400,    70560,    18816,      896;\n  6: 128,  6272,  75264,  313600,   501760,   301056,    57344,     2048;\n  7: 162, 10368, 169344, 1016064,  2540160,  2709504,  1161216,   165888,     4608;\n  8: 200, 16200, 345600, 2822400, 10160640, 16934400, 12902400,  4147200,   460800,   10240;\n  9: 242, 24200, 653400, 6969600, 34151040, 81962496, 97574400, 55756800, 13939200, 1239040, 22528;\n","recurrence_sentence":"The row polynomials satisfy (n^2+2*n+1)*P(n,x) = (n^2+4*n+4+(6*n^2+12*n+4)*x)*P(n-1,x) + ((2*n+3)*x-(4*n+6)*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 8 + 8*x.","mathematica":"P[0, x_] := 8 + 8*x;\nP[n_, x_] := P[n, x] = Expand[Together[((n^2 + 4*n + 4 + (6*n^2 + 12*n + 4)*x)*P[n - 1, x] + ((2*n + 3)*x - (4*n + 6)*x^2)*D[P[n - 1, x], x])/(n^2 + 2*n + 1)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 8 + 8*x; for(n = 1, N, my(i = n + 1); v[i] = ((n^2 + 4*n + 4 + (6*n^2 + 12*n + 4)*x)*v[i - 1] + ((2*n + 3)*x - (4*n + 6)*x^2)*deriv(v[i - 1], x))/(n^2 + 2*n + 1)); 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-b31aa1a3fd93d174","steps":["D"],"edges":["e-f75fd743a43c1d65"],"text":"A133214 \u2192 D"},"headline":"A133214 \u2192 D","chain":null}