{"id":"n-d2a742e29229862a","revision":0,"first_index":1,"fingerprint":"f6-6adf5f7f3d4b57cd","name":"one_plus_derivative 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.","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","2"],["38","20","2"],["192","162","36","2"],["1002","1192","436","56","2"],["5336","8290","4360","940","80","2"],["28814","55596","38790","12200","1770","108","2"],["157184","363650","319116","134750","28840","3038","140","2"],["864146","2336144","2483432","1332240","386428","60592","4872","176","2"],["4780008","14806530","18547920","12155640","4515840","966924","116592","7416","216","2"],["26572086","92870340","134234250","104406000","47718300","13173720","2182740","209520","10830","260","2"],["148321344","577711266","947702580","855658650","466950000","159533220","34271160","4544100","356400","15290","308","2"],["830764794","3569761080","6558766236","6755650440","4302089550","1764108720","471336360","81409680","8859510","579480","20988","360","2"],["4666890936","21936827874","44655106392","51745164900","37763785488","18153010590","5847434736","1261531128","179558808","16359486","907192","28132","416","2"],["26283115038","134185765980","299917655310","386538810840","318623975670","176235775716","66815506758","17446647504","3113264154","372279908","28854826","1375192","36946","476","2"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["2","10","60","392","2688","19008","137280","1006720","7468032","55897088","421378048","3195064320","24343347200","186226606080","1429563064320"],"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":[["1","-4","1"],["0","-2","1"],["0","2","0"],["1","0","0"]]},"terms":[{"coeff":{"coeffs":[["2","5","8","-3"],["-3","-22","-10","3"],["0","6","6","0"],["5","3","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","-4","3","4","-2"],["1","4","-1","-4","0"],["2","0","-2","0","0"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":180524,"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-1186c3004246a6be"]},{"id":180525,"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-1186c3004246a6be"]},{"id":180526,"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-1186c3004246a6be"]}],"region_exact":{},"incoming_edges":[{"id":"e-1186c3004246a6be","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-d2a742e29229862a","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":"529edb12607e3f446ebb509cb1054f7ea0d631a7f5fac3978839741035e60ff7","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-25065a706ad43d32","role":"sequence","name":"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.","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-39d7d1291ac64506","kind":"fingerprint_related","node_a_id":"n-feead5d907e2db53","node_b_id":"n-d2a742e29229862a","fingerprint":"f6-6adf5f7f3d4b57cd","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-6adf5f7f3d4b57cd"},"other_id":"n-feead5d907e2db53","other":{"id":"n-feead5d907e2db53","name":"one_plus_derivative 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-6adf5f7f3d4b57cd","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["4","1"],["19","10","1"]],"card_rows":[["1"],["4","1"],["19","10","1"],["96","81","18","1"]],"row_sums_preview":["1","5","30","196","1344","9504","68640","503360"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["basis A007318","D+1"],"edges":["e-38a7985c4c1aa2e3","e-b16c8f8d7cefd20b"],"text":"A114656 \u2192 basis A007318 \u2192 D+1"},"headline":"A114656 \u2192 basis A007318 \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,        2;\n   3:      38,       20,        2;\n   4:     192,      162,       36,        2;\n   5:    1002,     1192,      436,       56,       2;\n   6:    5336,     8290,     4360,      940,      80,      2;\n   7:   28814,    55596,    38790,    12200,    1770,    108,      2;\n   8:  157184,   363650,   319116,   134750,   28840,   3038,    140,    2;\n   9:  864146,  2336144,  2483432,  1332240,  386428,  60592,   4872,  176,   2;\n  10: 4780008, 14806530, 18547920, 12155640, 4515840, 966924, 116592, 7416, 216, 2;\n","recurrence_sentence":"The row polynomials satisfy (n^3+1+(2*n^2-2*n-4)*x+(n+1)*x^2)*P(n,x) = (5*n^3-3*n+2+(3*n^3+6*n^2-22*n+5)*x+(6*n^2-10*n+8)*x^2+(3*n-3)*x^3)*P(n-1,x) + (2*n^2+n-1+(4*n-4)*x-(2*n^2+n-3)*x^2-(4*n-4)*x^3-2*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[((5*n^3 - 3*n + 2 + (3*n^3 + 6*n^2 - 22*n + 5)*x + (6*n^2 - 10*n + 8)*x^2 + (3*n - 3)*x^3)*P[n - 1, x] + (2*n^2 + n - 1 + (4*n - 4)*x - (2*n^2 + n - 3)*x^2 - (4*n - 4)*x^3 - 2*x^4)*D[P[n - 1, x], x])/(n^3 + 1 + (2*n^2 - 2*n - 4)*x + (n + 1)*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] = ((5*n^3 - 3*n + 2 + (3*n^3 + 6*n^2 - 22*n + 5)*x + (6*n^2 - 10*n + 8)*x^2 + (3*n - 3)*x^3)*v[i - 1] + (2*n^2 + n - 1 + (4*n - 4)*x - (2*n^2 + n - 3)*x^2 - (4*n - 4)*x^3 - 2*x^4)*deriv(v[i - 1], x))/(n^3 + 1 + (2*n^2 - 2*n - 4)*x + (n + 1)*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":["x \u21a6 x+1","D+1"],"edges":["e-5ebd2cd7e542e718","e-1186c3004246a6be"],"text":"A114655 \u2192 x \u21a6 x+1 \u2192 D+1"},"headline":"A114655 \u2192 x \u21a6 x+1 \u2192 D+1","chain":null}