{"id":"n-feead5d907e2db53","revision":0,"first_index":1,"fingerprint":"f6-6adf5f7f3d4b57cd","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).","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":[["1"],["4","1"],["19","10","1"],["96","81","18","1"],["501","596","218","28","1"],["2668","4145","2180","470","40","1"],["14407","27798","19395","6100","885","54","1"],["78592","181825","159558","67375","14420","1519","70","1"],["432073","1168072","1241716","666120","193214","30296","2436","88","1"],["2390004","7403265","9273960","6077820","2257920","483462","58296","3708","108","1"],["13286043","46435170","67117125","52203000","23859150","6586860","1091370","104760","5415","130","1"],["74160672","288855633","473851290","427829325","233475000","79766610","17135580","2272050","178200","7645","154","1"],["415382397","1784880540","3279383118","3377825220","2151044775","882054360","235668180","40704840","4429755","289740","10494","180","1"],["2333445468","10968413937","22327553196","25872582450","18881892744","9076505295","2923717368","630765564","89779404","8179743","453596","14066","208","1"],["13141557519","67092882990","149958827655","193269405420","159311987835","88117887858","33407753379","8723323752","1556632077","186139954","14427413","687596","18473","238","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","30","196","1344","9504","68640","503360","3734016","27948544","210689024","1597532160","12171673600","93113303040","714781532160"],"nonn":true,"definitions":[{"position":0,"source":"derived:one_plus_derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"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":180048,"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-b16c8f8d7cefd20b"]},{"id":180049,"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-b16c8f8d7cefd20b"]},{"id":180050,"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-b16c8f8d7cefd20b"]},{"id":180051,"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-b16c8f8d7cefd20b"]}],"region_exact":{},"incoming_edges":[{"id":"e-b16c8f8d7cefd20b","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-feead5d907e2db53","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":"5702cfffb8ac3d6ebe658c68e8a43fd9d02d50a1e577aeb098da0858383314a8","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-6ad396ce174787e3","role":"sequence","name":"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).","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-d2a742e29229862a","other":{"id":"n-d2a742e29229862a","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.","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":[["2"],["8","2"],["38","20","2"]],"card_rows":[["2"],["8","2"],["38","20","2"],["192","162","36","2"]],"row_sums_preview":["2","10","60","392","2688","19008","137280","1006720"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"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}}],"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:       1;\n   2:       4,       1;\n   3:      19,      10,       1;\n   4:      96,      81,      18,       1;\n   5:     501,     596,     218,      28,       1;\n   6:    2668,    4145,    2180,     470,      40,      1;\n   7:   14407,   27798,   19395,    6100,     885,     54,     1;\n   8:   78592,  181825,  159558,   67375,   14420,   1519,    70,    1;\n   9:  432073, 1168072, 1241716,  666120,  193214,  30296,  2436,   88,   1;\n  10: 2390004, 7403265, 9273960, 6077820, 2257920, 483462, 58296, 3708, 108, 1;\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) = 1.","mathematica":"P[1, x_] := 1;\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] = 1; 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-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}