{"id":"n-ed478f839ee15fdb","revision":0,"first_index":0,"fingerprint":"f6-565949b5235e470d","name":"theta_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"],["2","2"],["5","10","3"],["17","46","27","4"],["74","240","195","56","5"],["394","1448","1440","580","100","6"],["2484","10024","11487","5740","1400","162","7"],["18108","78664","100317","58436","17850","2940","245","8"],["149904","691664","959928","628320","225645","46872","5586","352","9"],["1389456","6743952","10031220","7203920","2928450","719838","108780","9840","486","10"],["14257440","72271584","113946228","88308880","39636025","11092158","1993761","229680","16335","650","11"],["160460640","844759584","1400076612","1156963984","563467025","174989298","35976633","4950264","449955","25850","847","12"],["1965444480","10699123968","18520812648","16171368928","8437787930","2856069216","654336683","103378704","11262537","829400","39325","1080","13"],["26029779840","145992386304","262613929032","240578272480","133191488430","48490666224","12153389248","2147149576","269459190","23853830","1453452","57876","1352","14"],["370643938560","2135558486016","3975373737072","3799502732480","2215192197400","858715825968","232256495471","45029973560","6337998810","648097450","47589542","2440620","82810","1666","15"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","18","94","570","3968","31304","276568","2708280","29135952","341752752","4342120704","59420454912","871491886848","13639309597440"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","2"],["5","10","3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-8","12","-6","1"],["12","-12","3","0"],["-6","3","0","0"],["1","0","0","0"]]},"deriv_order":0,"offset":3,"sign":"none"},{"coeff":{"coeffs":[["-7","9","-3"],["9","-6","0"],["-3","0","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-3","3"],["3","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":180464,"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-73cdc02441301ff9"]},{"id":180465,"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-73cdc02441301ff9"]},{"id":180466,"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-73cdc02441301ff9"]}],"region_exact":{},"incoming_edges":[{"id":"e-73cdc02441301ff9","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-ed478f839ee15fdb","premise_count":1,"theorem":"Laguerre's theorem on multiplier sequences: if f is a real polynomial whose roots are all real and <= 0, then (f(k))_(k >= 0) is a multiplier sequence, so x^k -> f(k) x^k maps every real-rooted polynomial to a real-rooted polynomial or zero (Laguerre; see T. Craven and G. Csordas, Multiplier sequences for fields, Illinois J. Math. 21 (1977); Polya--Schur, Theorem 40 of P. Branden, arXiv:1410.6601: sum_k f(k) x^k / k! = f(theta) e^x = C e^x x^m prod (1 + x/a_j), a_j > 0); f(k) has one sign for k >= 0, so coefficients of one sign stay of one sign; applied to f(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.isMultiplierSequence_eval_of_roots_nonpos","RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos","RealRooted.isMultiplierSequence_iff_preserves"],"certificate_hash":"9bce960228c97f47a14a86e05d165dd3d3f8f65529cef97b51bbd39f28a9ebe7","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-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]"}]}],"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:       1;\n  1:       2,       2;\n  2:       5,      10,        3;\n  3:      17,      46,       27,       4;\n  4:      74,     240,      195,      56,       5;\n  5:     394,    1448,     1440,     580,     100,      6;\n  6:    2484,   10024,    11487,    5740,    1400,    162,      7;\n  7:   18108,   78664,   100317,   58436,   17850,   2940,    245,    8;\n  8:  149904,  691664,   959928,  628320,  225645,  46872,   5586,  352,   9;\n  9: 1389456, 6743952, 10031220, 7203920, 2928450, 719838, 108780, 9840, 486, 10;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (n^3-6*n^2+12*n-8+(3*n^2-12*n+12)*x+(3*n-6)*x^2+x^3)*P(n-3,x) - (3*n^2-9*n+7+(6*n-9)*x+3*x^2)*P(n-2,x) + (3*n-3+3*x)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 2 + 2*x, P(2,x) = 5 + 10*x + 3*x^2.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 2*x;\nP[2, x_] := 5 + 10*x + 3*x^2;\nP[n_, x_] := P[n, x] = Expand[(n^3 - 6*n^2 + 12*n - 8 + (3*n^2 - 12*n + 12)*x + (3*n - 6)*x^2 + x^3)*P[n - 3, x] - (3*n^2 - 9*n + 7 + (6*n - 9)*x + 3*x^2)*P[n - 2, x] + (3*n - 3 + 3*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 + 2*x; v[3] = 5 + 10*x + 3*x^2; for(n = 3, N, my(i = n + 1); v[i] = (n^3 - 6*n^2 + 12*n - 8 + (3*n^2 - 12*n + 12)*x + (3*n - 6)*x^2 + x^3)*v[i - 3] - (3*n^2 - 9*n + 7 + (6*n - 9)*x + 3*x^2)*v[i - 2] + (3*n - 3 + 3*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","\u03b8+1"],"edges":["e-d9ba82797b30d77a","e-73cdc02441301ff9"],"text":"A130534 \u2192 D+1 \u2192 \u03b8+1"},"headline":"A130534 \u2192 D+1 \u2192 \u03b8+1","chain":null}