{"id":"n-6d8f246bcb836a95","revision":0,"first_index":0,"fingerprint":"f6-42f458d827ed1a04","name":"shift_x_plus_one of one_plus_derivative of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers of x. T(n,k) is also the unsigned Stirling number |s(n+1, k+1)|, denoting the number of permutations on n+1 elements that contain exactly k+1 cycles.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["3","1"],["11","7","1"],["50","44","12","1"],["274","296","113","18","1"],["1764","2204","1045","235","25","1"],["13068","18236","10099","2845","430","33","1"],["109584","166984","104132","34524","6580","721","42","1"],["1026576","1681704","1153032","433272","97769","13580","1134","52","1"],["10628640","18507312","13721028","5700428","1465611","242193","25746","1698","63","1"],["120543840","221208912","175192356","79081500","22583315","4270623","542283","45690","2445","75","1"],["1486442880","2855677824","2393808120","1159137496","361109870","76141736","11104632","1121373","76890","3410","88","1"],["19802759040","39617695872","34899301656","17952492184","6020876026","1389712368","226732253","26378814","2174073","123860","4631","102","1"],["283465647360","588026239488","541228897872","293526966512","104909686024","26148038488","4683717753","611318279","58202859","3995563","192335","6149","117","1"],["4339163001600","9300146595840","8902329149232","5059253214288","1911774043816","509191843160","98751547895","14187202601","1519062116","120747627","7019012","289471","8008","133","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","19","107","702","5274","44712","422568","4407120","50292720","623471040","8344624320","119938250880","1842662908800","30136443724800"],"nonn":true,"definitions":[{"position":0,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","0","-1"],["0","-2","0"],["-1","0","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1","2"],["2","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":180470,"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-2b994f1b5983fb7a"]},{"id":180471,"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-2b994f1b5983fb7a","e-8a12e531f6b24710"]},{"id":180472,"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-2b994f1b5983fb7a","e-8a12e531f6b24710"]},{"id":180473,"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-8a12e531f6b24710"]},{"id":180474,"position":4,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-8a12e531f6b24710"]}],"region_exact":{},"incoming_edges":[{"id":"e-2b994f1b5983fb7a","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-6d8f246bcb836a95","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":"47c68225ae9f1049ae1f4cefb31277857c2782952622e1e860823af349a9d835","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-fb40e29cda26e7b9","role":"sequence","name":"one_plus_derivative of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers of x. T(n,k) is also the unsigned Stirling number |s(n+1, k+1)|, denoting the number of permutations on n+1 elements that contain exactly k+1 cycles.","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-8a12e531f6b24710","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-6d8f246bcb836a95","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":"2425fd036f1c2030efc72521ecfea42def7ea541405ab88e78580d89d7c037c6","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-914700b1060feeb2","role":"sequence","name":"Triangle read by rows: T(n,k) = (-1)^(n+k)*Sum_{j=1..k} s(n,j), where s(n,j) are the signed Stirling numbers of the first kind (n >= 2; 1 <= k <= n-1; s(n,j) = A008275(n,j)).","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-b6a52e06a65ade29","kind":"fingerprint_related","node_a_id":"n-6d8f246bcb836a95","node_b_id":"n-2ad86c1cd40b71c4","fingerprint":"f6-42f458d827ed1a04","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-42f458d827ed1a04"},"other_id":"n-2ad86c1cd40b71c4","other":{"id":"n-2ad86c1cd40b71c4","name":"one_plus_derivative of Unsigned 2-Stirling numbers of the first kind.","first_index":0,"fingerprint":"f6-42f458d827ed1a04","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["11","7","1"],["50","44","12","1"],["274","296","113","18","1"]],"card_rows":[["11","7","1"],["50","44","12","1"],["274","296","113","18","1"],["1764","2204","1045","235","25","1"]],"row_sums_preview":["19","107","702","5274","44712","422568","4407120","50292720"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-c237629cf5fdbb07","steps":["D+1"],"edges":["e-81cc947f5354265f"],"text":"A143491 \u2192 D+1"},"headline":"A143491 \u2192 D+1","chain":null}}],"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:        1;\n  1:        3,        1;\n  2:       11,        7,        1;\n  3:       50,       44,       12,       1;\n  4:      274,      296,      113,      18,       1;\n  5:     1764,     2204,     1045,     235,      25,      1;\n  6:    13068,    18236,    10099,    2845,     430,     33,     1;\n  7:   109584,   166984,   104132,   34524,    6580,    721,    42,    1;\n  8:  1026576,  1681704,  1153032,  433272,   97769,  13580,  1134,   52,  1;\n  9: 10628640, 18507312, 13721028, 5700428, 1465611, 242193, 25746, 1698, 63, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n^2+2*n*x+x^2)*P(n-2,x) + (2*n+1+2*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3 + x;\nP[n_, x_] := P[n, x] = Expand[-(n^2 + 2*n*x + x^2)*P[n - 2, x] + (2*n + 1 + 2*x)*P[n - 1, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 3 + x; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 + 2*n*x + x^2)*v[i - 2] + (2*n + 1 + 2*x)*v[i - 1]); 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-914700b1060feeb2","steps":["D+1"],"edges":["e-8a12e531f6b24710"],"text":"A136124 \u2192 D+1"},"headline":"A136124 \u2192 D+1","chain":null}
