{"id":"n-2835967399023614","revision":0,"first_index":0,"fingerprint":"f6-1644966885f7161f","name":"shift_x_plus_one of 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"],["28","10"],["180","122"],["1320","1324","183"],["10920","14532","4155"],["100800","167328","73704","5540"],["1028160","2046240","1225080","202084"],["11491200","26671680","20247120","5304488","252605"],["139708800","370560960","341280720","123898104","13513825"],["1836172800","5479246080","5938574400","2770797216","491645540","16216590"],["25945920000","86036670720","107320973760","61362581280","15328922700","1196165886"],["392302310400","1431176947200","2020062844800","1369837909440","444831823800","57576453492","1395526867"]],"degrees":[-1,-1,0,0,1,1,2,2,3,3,4,4,5,5,6],"row_sums":["0","0","1","5","38","302","2827","29607","347372","4501564","63967093","988962409","16532652626","297191234346","5717183815999"],"nonn":true,"definitions":[{"position":0,"source":"derived:shift_x_plus_one","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"],["-7","-18","-14"],["5","12","7"],["-1","-2","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","2","6","4"],["0","-4","-10","-6"],["0","2","4","2"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["5","12"],["-6","-10"],["2","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":177079,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-41eaf56e7a4dfa4c"]},{"id":177080,"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-41eaf56e7a4dfa4c","e-5c650e8ee4f56528"]},{"id":177081,"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-41eaf56e7a4dfa4c","e-5c650e8ee4f56528"]},{"id":177082,"position":3,"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-5c650e8ee4f56528"]}],"region_exact":{},"incoming_edges":[{"id":"e-41eaf56e7a4dfa4c","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-2835967399023614","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":null,"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"certificate_hash":"f92f1e94a2d36867fef175edbec1008b5a96965ebec9be18cf37a732bbbfc99c","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}}],"premises":[{"position":0,"node_id":"n-add6df1ce75e6a78","role":"sequence","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.","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]"}]},{"id":"e-5c650e8ee4f56528","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-2835967399023614","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":"5b6262a8b26f7881cc019b16ee0767580079a0ad54bbac2b729bfe61f3f18cff","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-5d7c3f4772a9d8bb","role":"sequence","name":"shift_x_plus_one of 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":[],"oeis":[],"bfiles":[],"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:      28,      10;\n  5:     180,     122;\n  6:    1320,    1324,     183;\n  7:   10920,   14532,    4155;\n  8:  100800,  167328,   73704,   5540;\n  9: 1028160, 2046240, 1225080, 202084;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = -(n^3-5*n^2+7*n-3+(2*n^3-12*n^2+18*n-8)*x+(n^3-7*n^2+14*n-8)*x^2)*P(n-2,x) + ((2*n^2-4*n+2)*x+(4*n^2-10*n+6)*x^2+(2*n^2-6*n+4)*x^3)*d/dx P(n-2,x) + (2*n^2-6*n+5+(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[(-(n^3 - 5*n^2 + 7*n - 3 + (2*n^3 - 12*n^2 + 18*n - 8)*x + (n^3 - 7*n^2 + 14*n - 8)*x^2)*P[n - 2, x] + ((2*n^2 - 4*n + 2)*x + (4*n^2 - 10*n + 6)*x^2 + (2*n^2 - 6*n + 4)*x^3)*D[P[n - 2, x], x] + (2*n^2 - 6*n + 5 + (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] = (-(n^3 - 5*n^2 + 7*n - 3 + (2*n^3 - 12*n^2 + 18*n - 8)*x + (n^3 - 7*n^2 + 14*n - 8)*x^2)*v[i - 2] + ((2*n^2 - 4*n + 2)*x + (4*n^2 - 10*n + 6)*x^2 + (2*n^2 - 6*n + 4)*x^3)*deriv(v[i - 2], x) + (2*n^2 - 6*n + 5 + (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","x \u21a6 x+1"],"edges":["e-16125ab4d60fcfd7","e-41ca564015de7a4a","e-41eaf56e7a4dfa4c"],"text":"type_b_eulerian \u2192 \u03b3 (scale 1/4) \u2192 D \u2192 x \u21a6 x+1"},"headline":"type_b_eulerian \u2192 \u03b3 (scale 1/4) \u2192 D \u2192 x \u21a6 x+1","chain":null}