{"id":"n-1ff7b1d8c09df87e","revision":1,"first_index":1,"fingerprint":"f6-883c9e310e304e0b","name":"derivative of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,1) (i.e., bilateral Schroeder paths), having k D=(1,1) 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":[[],["1"],["6","2"],["30","24","3"],["140","180","60","4"],["630","1120","630","120","5"],["2772","6300","5040","1680","210","6"],["12012","33264","34650","16800","3780","336","7"],["51480","168168","216216","138600","46200","7560","504","8"],["218790","823680","1261260","1009008","450450","110880","13860","720","9"],["923780","3938220","7001280","6726720","3783780","1261260","240240","23760","990","10"],["3879876","18475600","37413090","42007680","28588560","12108096","3153150","480480","38610","1320","11"],["16224936","85357272","193993800","249420600","199536480","102918816","34306272","7207200","900900","60060","1716","12"],["67603900","389398464","981608628","1422621200","1309458150","798145920","325909584","88216128","15315300","1601600","90090","2184","13"],["280816200","1757701400","4867480800","7852869024","8180071900","5761615860","2793510720","931170240","209513304","30630600","2722720","131040","2730","14"]],"degrees":[-1,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["0","1","8","57","384","2505","16008","100849","628736","3888657","23900040","146146473","889928064","5399971161","32668236552"],"nonn":true,"definitions":[{"position":0,"source":"derived:derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["0"],["1"]],"recurrence":{"denominator":{"coeffs":[["4"],["-4"],["1"]]},"terms":[{"coeff":{"coeffs":[["12","11"],["-14","-12"],["4","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","3","3"],["0","-2","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":165670,"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-efbf4c1b988cfbc1"]},{"id":165671,"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-efbf4c1b988cfbc1"]},{"id":165672,"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-efbf4c1b988cfbc1"]},{"id":165673,"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-efbf4c1b988cfbc1"]}],"region_exact":{},"incoming_edges":[{"id":"e-efbf4c1b988cfbc1","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-1ff7b1d8c09df87e","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":"dbba48a5f2389338eb91604eae1b3b5e01263a02d5256f27190fbc86ebf07017","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-78ba05b4a3dd925d","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,1) (i.e., bilateral Schroeder paths), having k D=(1,1) 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-234ad26f05e6afb0","kind":"oeis_match","node_a_id":"n-1ff7b1d8c09df87e","node_b_id":null,"fingerprint":null,"oeis_id":"A108666","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A108666","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A108666","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-1ff7b1d8c09df87e","oeis_id":"A108666","target":"row_sums","oeis_offset":0,"first_row":1,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":24,"oeis_terms_available":24,"term_count":200,"raw_size":16257}],"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:      1;\n   3:      6,      2;\n   4:     30,     24,       3;\n   5:    140,    180,      60,       4;\n   6:    630,   1120,     630,     120,      5;\n   7:   2772,   6300,    5040,    1680,    210,      6;\n   8:  12012,  33264,   34650,   16800,   3780,    336,     7;\n   9:  51480, 168168,  216216,  138600,  46200,   7560,   504,   8;\n  10: 218790, 823680, 1261260, 1009008, 450450, 110880, 13860, 720, 9;\n","recurrence_sentence":"The row polynomials satisfy (n^2-4*n+4)*P(n,x) = (4*n^2-14*n+12+(3*n^2-12*n+11)*x)*P(n-1,x) - ((2*n-3)*x+(2*n-3)*x^2)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 0, P(2,x) = 1.","mathematica":"P[1, x_] := 0;\nP[2, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[((4*n^2 - 14*n + 12 + (3*n^2 - 12*n + 11)*x)*P[n - 1, x] - ((2*n - 3)*x + (2*n - 3)*x^2)*D[P[n - 1, x], x])/(n^2 - 4*n + 4)]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 0; v[2] = 1; for(n = 3, N, my(i = n); v[i] = ((4*n^2 - 14*n + 12 + (3*n^2 - 12*n + 11)*x)*v[i - 1] - ((2*n - 3)*x + (2*n - 3)*x^2)*deriv(v[i - 1], x))/(n^2 - 4*n + 4)); 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-78ba05b4a3dd925d","steps":["D"],"edges":["e-efbf4c1b988cfbc1"],"text":"A104684 \u2192 D"},"headline":"A104684 \u2192 D","chain":null}