{"id":"n-7d595f729d515f3c","revision":0,"first_index":1,"fingerprint":"f6-329fef61f047bada","name":"derivative 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 peaks (1 <= k <= n).","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","8"],["12","48","24"],["20","160","240","64"],["30","400","1200","960","160"],["42","840","4200","6720","3360","384"],["56","1568","11760","31360","31360","10752","896"],["72","2688","28224","112896","188160","129024","32256","2048"],["90","4320","60480","338688","846720","967680","483840","92160","4608"],["110","6600","118800","887040","3104640","5322240","4435200","1689600","253440","10240"],["132","9680","217800","2090880","9757440","23417856","29272320","18585600","5575680","675840","22528"],["156","13728","377520","4530240","27181440","86980608","152216064","144967680","72483840","17571840","1757184","49152"],["182","18928","624624","9161152","68708640","282686976","659602944","879470592","659602944","266506240","53301248","4472832","106496"],["210","25480","993720","17489472","160320160","824503680","2473511040","4397352960","4617220608","2798315520","932771840","156549120","11182080","229376"]],"degrees":[-1,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["0","2","14","84","484","2750","15546","87752","495368","2798586","15827910","89625756","508129452","2884263798","16390465266"],"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"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","4"],["1","-14"],["1","6"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-1","2"],["0","2","-4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":176667,"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-ecd8560322c1ba5f"]},{"id":176668,"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-ecd8560322c1ba5f"]},{"id":176669,"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-ecd8560322c1ba5f"]},{"id":176670,"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-ecd8560322c1ba5f"]}],"region_exact":{},"incoming_edges":[{"id":"e-ecd8560322c1ba5f","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-7d595f729d515f3c","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":"a08a6e874d92b7bbaad8617a3e8c4a798aec0f1d950aa62bcf2208d5f2b9a220","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-c3c79310b753c17e","role":"sequence","name":"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 peaks (1 <= k <= n).","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-9a39f3710a0b6b99","kind":"fingerprint_related","node_a_id":"n-7d595f729d515f3c","node_b_id":"n-c5e7a5a5771fdd1e","fingerprint":"f6-329fef61f047bada","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-329fef61f047bada"},"other_id":"n-c5e7a5a5771fdd1e","other":{"id":"n-c5e7a5a5771fdd1e","name":"derivative of reversal 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-329fef61f047bada","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],["4"],["12","16"]],"card_rows":[["4"],["12","16"],["24","96","48"],["40","320","480","128"]],"row_sums_preview":["0","4","28","168","968","5500","31092","175504"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-6a30765140629bd5","steps":["reverse","D"],"edges":["e-a35c7072fcaf677b","e-33f577f3c1bd4a15"],"text":"A114655 \u2192 reverse \u2192 D"},"headline":"A114655 \u2192 reverse \u2192 D","chain":null}},{"id":"l-c51051dd1380c362","kind":"fingerprint_related","node_a_id":"n-24de82dee72e2434","node_b_id":"n-7d595f729d515f3c","fingerprint":"f6-329fef61f047bada","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-329fef61f047bada"},"other_id":"n-24de82dee72e2434","other":{"id":"n-24de82dee72e2434","name":"derivative 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-329fef61f047bada","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],["2"],["6","8"]],"card_rows":[["2"],["6","8"],["12","48","24"],["20","160","240","64"]],"row_sums_preview":["0","2","14","84","484","2750","15546","87752"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-8ce61d302cec295b","steps":["D"],"edges":["e-489d879e380263ff"],"text":"A114687 \u2192 D"},"headline":"A114687 \u2192 D","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,    8;\n   4: 12,   48,    24;\n   5: 20,  160,   240,     64;\n   6: 30,  400,  1200,    960,    160;\n   7: 42,  840,  4200,   6720,   3360,    384;\n   8: 56, 1568, 11760,  31360,  31360,  10752,    896;\n   9: 72, 2688, 28224, 112896, 188160, 129024,  32256,  2048;\n  10: 90, 4320, 60480, 338688, 846720, 967680, 483840, 92160, 4608;\n","recurrence_sentence":"The row polynomials satisfy (n^2-n-2)*P(n,x) = (n^2+n+(6*n^2-14*n+4)*x)*P(n-1,x) + ((2*n-1)*x-(4*n-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 + (6*n^2 - 14*n + 4)*x)*P[n - 1, x] + ((2*n - 1)*x - (4*n - 2)*x^2)*D[P[n - 1, x], x])/(n^2 - 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 + (6*n^2 - 14*n + 4)*x)*v[i - 1] + ((2*n - 1)*x - (4*n - 2)*x^2)*deriv(v[i - 1], x))/(n^2 - 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-0d75f6272d2a2a84","steps":["reverse","D"],"edges":["e-87267df0bda73e27","e-ecd8560322c1ba5f"],"text":"A114656 \u2192 reverse \u2192 D"},"headline":"A114656 \u2192 reverse \u2192 D","chain":null}