{"id":"n-add6df1ce75e6a78","revision":1,"first_index":0,"fingerprint":"f6-9bba25034ade8934","name":"derivative of Triangle read by rows: T(n,k) is the number of permutations of [n] with k increasing runs of length at least 2.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":-2,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[[],[],["1"],["5"],["18","10"],["58","122"],["179","958","183"],["543","6222","4155"],["1636","36540","57084","5540"],["4916","202332","618828","202084"],["14757","1080484","5849286","4294068","252605"],["44281","5638532","50669358","69842804","13513825"],["132854","28989718","413890092","966380956","410562590","16216590"],["398574","147605670","3245107260","12008549340","9348093270","1196165886"],["1195735","746796978","24708427365","138364611820","177882459345","49203292290","1395526867"]],"degrees":[-1,-1,0,0,1,1,2,2,3,3,4,4,5,5,6],"row_sums":["0","0","1","5","28","180","1320","10920","100800","1028160","11491200","139708800","1836172800","25945920000","392302310400"],"nonn":true,"definitions":[{"position":0,"source":"derived:derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["0"],["1"]],"recurrence":{"denominator":{"coeffs":[["-2"],["1"]]},"terms":[{"coeff":{"coeffs":[["3","-8","8"],["-3","10","-14"],["0","-2","7"],["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","2","-6","4"],["0","-2","8","-6"],["0","0","-2","2"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-7","12"],["4","-10"],["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-4","4"],["0","2","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":164727,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-6301aab0e71cd09e"]},{"id":164728,"position":1,"claim":"one_signed_coefficients","from_index":0,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":0},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 0: the coefficients of P_n have one sign","region_exact":null,"edges":["e-6301aab0e71cd09e"]},{"id":164729,"position":2,"claim":"hadamard_kernel","from_index":0,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":0},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-6301aab0e71cd09e"]}],"region_exact":{},"incoming_edges":[{"id":"e-6301aab0e71cd09e","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-add6df1ce75e6a78","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":"20ed7de72512ed6a656cc427176d7456504e8d3bcac8919f4664e4bd6add9388","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-5e3f8ad0b0a35d3e","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of permutations of [n] with k increasing runs of length at least 2.","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]"}]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-159e6812a41807c1","kind":"oeis_match","node_a_id":"n-add6df1ce75e6a78","node_b_id":null,"fingerprint":null,"oeis_id":"A006157","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":2,"low_zeros_dropped":false,"oeis_offset":2,"oeis_term_position":0,"target":"row_sums","terms_compared":13},"in_catalog":false,"oeis_id":"A006157","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A006157","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-add6df1ce75e6a78","oeis_id":"A006157","target":"row_sums","oeis_offset":2,"first_row":2,"rows_used":200,"terms_matched":13,"oeis_terms_agreeing":20,"oeis_terms_available":20,"term_count":200,"raw_size":35098}],"oeis_texts":[{"oeis_id":"","target":"node","first_row":0,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0:    0;\n  1:    0;\n  2:    1;\n  3:    5;\n  4:   18,     10;\n  5:   58,    122;\n  6:  179,    958,    183;\n  7:  543,   6222,   4155;\n  8: 1636,  36540,  57084,   5540;\n  9: 4916, 202332, 618828, 202084;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = -(3*n-3+(2*n^2-10*n+8)*x+(n^3-7*n^2+14*n-8)*x^2)*P(n-2,x) - ((2*n-2)*x+(2*n^2-8*n+6)*x^2-(2*n^2-6*n+4)*x^3)*d/dx P(n-2,x) + (4*n-7+(2*n^2-10*n+12)*x)*P(n-1,x) + ((2*n-4)*x-(2*n-4)*x^2)*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 1.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 0;\nP[2, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[(-(3*n - 3 + (2*n^2 - 10*n + 8)*x + (n^3 - 7*n^2 + 14*n - 8)*x^2)*P[n - 2, x] - ((2*n - 2)*x + (2*n^2 - 8*n + 6)*x^2 - (2*n^2 - 6*n + 4)*x^3)*D[P[n - 2, x], x] + (4*n - 7 + (2*n^2 - 10*n + 12)*x)*P[n - 1, x] + ((2*n - 4)*x - (2*n - 4)*x^2)*D[P[n - 1, x], x])/(n - 2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 0; v[3] = 1; for(n = 3, N, my(i = n + 1); v[i] = (-(3*n - 3 + (2*n^2 - 10*n + 8)*x + (n^3 - 7*n^2 + 14*n - 8)*x^2)*v[i - 2] - ((2*n - 2)*x + (2*n^2 - 8*n + 6)*x^2 - (2*n^2 - 6*n + 4)*x^3)*deriv(v[i - 2], x) + (4*n - 7 + (2*n^2 - 10*n + 12)*x)*v[i - 1] + ((2*n - 4)*x - (2*n - 4)*x^2)*deriv(v[i - 1], x))/(n - 2)); v};\nrow(n, p) = {my(c = Vecrev(p)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};\nT(9)","reading":{"first_row":0,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-d8312bb744732845","steps":["\u03b3 (scale 1/4)","D"],"edges":["e-4c46966ead0b055f","e-6301aab0e71cd09e"],"text":"type_b_eulerian \u2192 \u03b3 (scale 1/4) \u2192 D"},"headline":"type_b_eulerian \u2192 \u03b3 (scale 1/4) \u2192 D","chain":null}