{"id":"n-c86aa45832718393","revision":0,"first_index":0,"fingerprint":"f6-13dd874d79e2c744","name":"theta_plus_one of 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)).","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"],["6","10","3"],["24","52","27","4"],["120","308","213","56","5"],["720","2088","1740","620","100","6"],["5040","16056","15312","6660","1475","162","7"],["40320","138528","146580","73696","20125","3066","245","8"],["362880","1327392","1527012","858704","273245","51744","5782","352","9"],["3628800","13999680","17261208","10623056","3805830","845334","118188","10128","486","10"],["39916800","161254080","210872808","139868560","55142950","13865670","2286291","246480","16740","650","11"],["479001600","2014882560","2772354816","1959586464","836551100","232559580","43612107","5570664","478170","26400","847","12"],["6227020800","27151476480","39062936448","29171097120","13324647380","4027135860","838276901","122261040","12483207","874500","40051","1080","13"],["87178291200","392574712320","587608324992","460479274944","223008934720","72369478896","16434201784","2669685304","312308568","26113230","1522664","58812","1352","14"],["1307674368000","6062977267200","9402986943360","7690666890816","3920733114480","1353152905104","330944085472","58827224456","7688024487","738707970","51564513","2543268","83993","1666","15"]],"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:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","2"]],"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":180873,"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-1b1363c1ca11a711"]},{"id":180874,"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-1b1363c1ca11a711"]},{"id":180875,"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-1b1363c1ca11a711"]},{"id":180876,"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-1b1363c1ca11a711"]}],"region_exact":{},"incoming_edges":[{"id":"e-1b1363c1ca11a711","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-c86aa45832718393","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":"1504b08f1bf4a5f2260d5b1a374f6e4f536cab6ef7980a1d455f897f0924f187","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-c129339213720078","kind":"fingerprint_related","node_a_id":"n-c86aa45832718393","node_b_id":"n-c71dcd281e71f7f9","fingerprint":"f6-13dd874d79e2c744","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-13dd874d79e2c744"},"other_id":"n-c71dcd281e71f7f9","other":{"id":"n-c71dcd281e71f7f9","name":"theta_plus_one of Unsigned 2-Stirling numbers of the first kind.","first_index":0,"fingerprint":"f6-13dd874d79e2c744","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["6","10","3"],["24","52","27","4"],["120","308","213","56","5"]],"card_rows":[["6","10","3"],["24","52","27","4"],["120","308","213","56","5"],["720","2088","1740","620","100","6"]],"row_sums_preview":["19","107","702","5274","44712","422568","4407120","50292720"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-c237629cf5fdbb07","steps":["\u03b8+1"],"edges":["e-bdb1a66c313058e3"],"text":"A143491 \u2192 \u03b8+1"},"headline":"A143491 \u2192 \u03b8+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:       2,        2;\n  2:       6,       10,        3;\n  3:      24,       52,       27,        4;\n  4:     120,      308,      213,       56,       5;\n  5:     720,     2088,     1740,      620,     100,      6;\n  6:    5040,    16056,    15312,     6660,    1475,    162,      7;\n  7:   40320,   138528,   146580,    73696,   20125,   3066,    245,     8;\n  8:  362880,  1327392,  1527012,   858704,  273245,  51744,   5782,   352,   9;\n  9: 3628800, 13999680, 17261208, 10623056, 3805830, 845334, 118188, 10128, 486, 10;\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) = 2 + 2*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 2*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] = 2 + 2*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":["\u03b8+1"],"edges":["e-1b1363c1ca11a711"],"text":"A136124 \u2192 \u03b8+1"},"headline":"A136124 \u2192 \u03b8+1","chain":null}