{"id":"n-fb40e29cda26e7b9","revision":1,"first_index":0,"fingerprint":"f6-9dfcd5dbd8ed9f8f","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.","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"],["2","1"],["5","5","1"],["17","23","9","1"],["74","120","65","14","1"],["394","724","480","145","20","1"],["2484","5012","3829","1435","280","27","1"],["18108","39332","33439","14609","3570","490","35","1"],["149904","345832","319976","157080","45129","7812","798","44","1"],["1389456","3371976","3343740","1800980","585690","119973","15540","1230","54","1"],["14257440","36135792","37982076","22077220","7927205","1848693","284823","28710","1815","65","1"],["160460640","422379792","466692204","289240996","112693405","29164883","5139519","618783","49995","2585","77","1"],["1965444480","5349561984","6173604216","4042842232","1687557586","476011536","93476669","12922338","1251393","82940","3575","90","1"],["26029779840","72996193152","87537976344","60144568120","26638297686","8081777704","1736198464","268393697","29939910","2385383","132132","4823","104","1"],["370643938560","1067779243008","1325124579024","949875683120","443038439480","143119304328","33179499353","5628746695","704222090","64809745","4326322","203385","6370","119","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","3","11","50","274","1764","13068","109584","1026576","10628640","120543840","1486442880","19802759040","283465647360","4339163001600"],"nonn":true,"definitions":[{"position":0,"source":"derived:one_plus_derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","2","-1"],["2","-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":165614,"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-d9ba82797b30d77a"]},{"id":165615,"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-d9ba82797b30d77a"]},{"id":165616,"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-d9ba82797b30d77a"]},{"id":165617,"position":3,"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-d9ba82797b30d77a"]}],"region_exact":{},"incoming_edges":[{"id":"e-d9ba82797b30d77a","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-fb40e29cda26e7b9","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":"eb61c60a8fda0114a3238df39257d85981bccfd9064bcb2f653741ca0df088a3","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-efe23a76953cf69d","role":"sequence","name":"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]"}]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-f88c6eee53ae4af6","kind":"oeis_match","node_a_id":"n-fb40e29cda26e7b9","node_b_id":null,"fingerprint":null,"oeis_id":"A000254","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A000254","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A000254","relation":"match_row_sums"}],"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:       2,       1;\n  2:       5,       5,       1;\n  3:      17,      23,       9,       1;\n  4:      74,     120,      65,      14,      1;\n  5:     394,     724,     480,     145,     20,      1;\n  6:    2484,    5012,    3829,    1435,    280,     27,     1;\n  7:   18108,   39332,   33439,   14609,   3570,    490,    35,    1;\n  8:  149904,  345832,  319976,  157080,  45129,   7812,   798,   44,  1;\n  9: 1389456, 3371976, 3343740, 1800980, 585690, 119973, 15540, 1230, 54, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n^2-2*n+1+(2*n-2)*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) = 2 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + x;\nP[n_, x_] := P[n, x] = Expand[-(n^2 - 2*n + 1 + (2*n - 2)*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] = 2 + x; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 - 2*n + 1 + (2*n - 2)*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-efe23a76953cf69d","steps":["D+1"],"edges":["e-d9ba82797b30d77a"],"text":"A130534 \u2192 D+1"},"headline":"A130534 \u2192 D+1","chain":null}