{"id":"n-a0634c0b1dfcfa60","revision":0,"first_index":1,"fingerprint":"f6-a8b715cdd5f5d5e8","name":"one_plus_derivative 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.","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":[["2"],["8","4"],["32","36","6"],["112","240","96","8"],["352","1280","960","200","10"],["1024","5760","7200","2800","360","12"],["2816","22848","43680","28000","6720","588","14"],["7424","82432","225792","219520","86240","14112","896","16"],["18944","276480","1032192","1430016","846720","225792","26880","1296","18"],["47104","875520","4285440","8064000","6773760","2709504","524160","47520","1800","20"],["114688","2647040","16473600","40550400","46126080","26078976","7539840","1108800","79200","2420","22"],["274432","7704576","59473920","185856000","275996160","210760704","85865472","18817920","2178000","125840","3168","24"],["647168","21725184","203833344","789268480","1485918720","1478670336","811819008","250069248","43037280","4026880","192192","4056","26"],["1507328","59637760","668688384","3144773632","7328921600","9234441216","6596029440","2732640768","659602944","91611520","7079072","283920","5096","28"],["3473408","159989760","2113413120","11871641600","33579786240","52328500224","47271544320","25441827840","8245036800","1603201600","183639456","11924640","407680","6300","30"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["2","12","74","456","2802","17156","104666","636432","3858338","23328828","140721066","847056216","5089211922","30525222708","182814393018"],"nonn":true,"definitions":[{"position":0,"source":"derived:one_plus_derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["2"]],"recurrence":{"denominator":{"coeffs":[["0","0","0"],["-4","6","-1"],["7","-8","1"],["-4","2","0"],["1","0","0"]]},"terms":[{"coeff":{"coeffs":[["0","0","-10","2"],["-4","6","27","-5"],["6","-1","-23","3"],["-4","-8","6","0"],["2","3","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","8","-6","1"],["0","4","-22","14","-2"],["0","-8","12","-4","0"],["0","4","-2","0","0"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":179479,"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-85c6d4f6913e2555"]},{"id":179480,"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-85c6d4f6913e2555"]},{"id":179481,"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-85c6d4f6913e2555"]},{"id":179482,"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-85c6d4f6913e2555"]}],"region_exact":{},"incoming_edges":[{"id":"e-85c6d4f6913e2555","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"derivative_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-a0634c0b1dfcfa60","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":"fb1d04a9e03be14cccef3b1ddc2554f672e0e13481093053d77ef23e8be058d9","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-7f47b2246e50a89b","role":"sequence","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.","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-e6b80f24865dfbee","kind":"fingerprint_related","node_a_id":"n-1d21d78d875f8903","node_b_id":"n-a0634c0b1dfcfa60","fingerprint":"f6-a8b715cdd5f5d5e8","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-a8b715cdd5f5d5e8"},"other_id":"n-1d21d78d875f8903","other":{"id":"n-1d21d78d875f8903","name":"one_plus_derivative 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-a8b715cdd5f5d5e8","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["4","2"],["16","18","3"]],"card_rows":[["1"],["4","2"],["16","18","3"],["56","120","48","4"]],"row_sums_preview":["1","6","37","228","1401","8578","52333","318216"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["\u03b8+1","D+1"],"edges":["e-57c7b63013beaaa7","e-2c5489c2355ddbb5"],"text":"A114656 \u2192 \u03b8+1 \u2192 D+1"},"headline":"A114656 \u2192 \u03b8+1 \u2192 D+1","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:     2;\n   2:     8,      4;\n   3:    32,     36,       6;\n   4:   112,    240,      96,       8;\n   5:   352,   1280,     960,     200,      10;\n   6:  1024,   5760,    7200,    2800,     360,      12;\n   7:  2816,  22848,   43680,   28000,    6720,     588,     14;\n   8:  7424,  82432,  225792,  219520,   86240,   14112,    896,    16;\n   9: 18944, 276480, 1032192, 1430016,  846720,  225792,  26880,  1296,   18;\n  10: 47104, 875520, 4285440, 8064000, 6773760, 2709504, 524160, 47520, 1800, 20;\n","recurrence_sentence":"The row polynomials satisfy (n^4-4*n^3+7*n^2-4*n+(2*n^3-8*n^2+6*n)*x+(n^2-n)*x^2)*P(n,x) = (2*n^4-4*n^3+6*n^2-4*n+(3*n^4-8*n^3-n^2+6*n)*x+(6*n^3-23*n^2+27*n-10)*x^2+(3*n^2-5*n+2)*x^3)*P(n-1,x) + ((4*n^3-8*n^2+4*n)*x-(2*n^3-12*n^2+22*n-8)*x^2-(4*n^2-14*n+6)*x^3-(2*n-1)*x^4)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 2.","mathematica":"P[1, x_] := 2;\nP[n_, x_] := P[n, x] = Expand[Together[((2*n^4 - 4*n^3 + 6*n^2 - 4*n + (3*n^4 - 8*n^3 - n^2 + 6*n)*x + (6*n^3 - 23*n^2 + 27*n - 10)*x^2 + (3*n^2 - 5*n + 2)*x^3)*P[n - 1, x] + ((4*n^3 - 8*n^2 + 4*n)*x - (2*n^3 - 12*n^2 + 22*n - 8)*x^2 - (4*n^2 - 14*n + 6)*x^3 - (2*n - 1)*x^4)*D[P[n - 1, x], x])/(n^4 - 4*n^3 + 7*n^2 - 4*n + (2*n^3 - 8*n^2 + 6*n)*x + (n^2 - n)*x^2)]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 2; for(n = 2, N, my(i = n); v[i] = ((2*n^4 - 4*n^3 + 6*n^2 - 4*n + (3*n^4 - 8*n^3 - n^2 + 6*n)*x + (6*n^3 - 23*n^2 + 27*n - 10)*x^2 + (3*n^2 - 5*n + 2)*x^3)*v[i - 1] + ((4*n^3 - 8*n^2 + 4*n)*x - (2*n^3 - 12*n^2 + 22*n - 8)*x^2 - (4*n^2 - 14*n + 6)*x^3 - (2*n - 1)*x^4)*deriv(v[i - 1], x))/(n^4 - 4*n^3 + 7*n^2 - 4*n + (2*n^3 - 8*n^2 + 6*n)*x + (n^2 - n)*x^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":["\u03b8+1","D+1"],"edges":["e-d14d9d630db1a5b2","e-85c6d4f6913e2555"],"text":"A114655 \u2192 \u03b8+1 \u2192 D+1"},"headline":"A114655 \u2192 \u03b8+1 \u2192 D+1","chain":null}