{"id":"n-936054a41761ef4d","revision":1,"first_index":1,"fingerprint":"f6-ac6fb8a68b5815f1","name":"derivative 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.","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"],["12","4"],["48","48","6"],["160","320","120","8"],["480","1600","1200","240","10"],["1344","6720","8400","3360","420","12"],["3584","25088","47040","31360","7840","672","14"],["9216","86016","225792","225792","94080","16128","1008","16"],["23040","276480","967680","1354752","846720","241920","30240","1440","18"],["56320","844800","3801600","7096320","6209280","2661120","554400","52800","1980","20"],["135168","2478080","13939200","33454080","39029760","23417856","7318080","1161600","87120","2640","22"],["319488","7028736","48322560","144967680","217451520","173961216","76108032","18120960","2265120","137280","3432","24"],["745472","19382272","159903744","586313728","1099338240","1130747904","659602944","219867648","41225184","4164160","208208","4368","26"],["1720320","52183040","508784640","2238652416","5130245120","6596029440","4947022080","2198676480","577152576","87447360","7287280","305760","5460","28"]],"degrees":[-1,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["0","2","16","102","608","3530","20256","115598","658048","3742290","21278640","121023606","688686048","3921503898","22345512000"],"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","2"],["2","-7"],["2","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-2","1"],["0","4","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":165451,"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-d11937e4427f3a96"]},{"id":165452,"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-d11937e4427f3a96"]},{"id":165453,"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-d11937e4427f3a96"]},{"id":165454,"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-d11937e4427f3a96"]}],"region_exact":{},"incoming_edges":[{"id":"e-d11937e4427f3a96","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-936054a41761ef4d","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":"e658109fd69a9d05f29ccdf2355fcf1516ff530d6bbc990dc960ff238babb067","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-6a30765140629bd5","role":"sequence","name":"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.","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-44597d3ea3d27a5a","kind":"fingerprint_related","node_a_id":"n-df1927dc8d50fdaa","node_b_id":"n-936054a41761ef4d","fingerprint":"f6-ac6fb8a68b5815f1","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-ac6fb8a68b5815f1"},"other_id":"n-df1927dc8d50fdaa","other":{"id":"n-df1927dc8d50fdaa","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 peaks (1 <= k <= n).","first_index":1,"fingerprint":"f6-ac6fb8a68b5815f1","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],["1"],["6","2"]],"card_rows":[["1"],["6","2"],["24","24","3"],["80","160","60","4"]],"row_sums_preview":["0","1","8","51","304","1765","10128","57799"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["D"],"edges":["e-6d239f40755a17ae"],"text":"A114656 \u2192 D"},"headline":"A114656 \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:    12,      4;\n   4:    48,     48,      6;\n   5:   160,    320,    120,       8;\n   6:   480,   1600,   1200,     240,     10;\n   7:  1344,   6720,   8400,    3360,    420,     12;\n   8:  3584,  25088,  47040,   31360,   7840,    672,    14;\n   9:  9216,  86016, 225792,  225792,  94080,  16128,  1008,   16;\n  10: 23040, 276480, 967680, 1354752, 846720, 241920, 30240, 1440, 18;\n","recurrence_sentence":"The row polynomials satisfy (n^2-n-2)*P(n,x) = (2*n^2+2*n+(3*n^2-7*n+2)*x)*P(n-1,x) + ((4*n-2)*x-(2*n-1)*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[((2*n^2 + 2*n + (3*n^2 - 7*n + 2)*x)*P[n - 1, x] + ((4*n - 2)*x - (2*n - 1)*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] = ((2*n^2 + 2*n + (3*n^2 - 7*n + 2)*x)*v[i - 1] + ((4*n - 2)*x - (2*n - 1)*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-6a30765140629bd5","steps":["D"],"edges":["e-d11937e4427f3a96"],"text":"A114655 \u2192 D"},"headline":"A114655 \u2192 D","chain":null}