{"id":"n-fce00c81894c6066","revision":0,"first_index":0,"fingerprint":"f6-505ab518d44a108d","name":"theta_plus_one_squared 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","4"],["6","20","9"],["24","104","81","16"],["120","616","639","224","25"],["720","4176","5220","2480","500","36"],["5040","32112","45936","26640","7375","972","49"],["40320","277056","439740","294784","100625","18396","1715","64"],["362880","2654784","4581036","3434816","1366225","310464","40474","2816","81"],["3628800","27999360","51783624","42492224","19029150","5072004","827316","81024","4374","100"],["39916800","322508160","632618424","559474240","275714750","83194020","16004037","1971840","150660","6500","121"],["479001600","4029765120","8317064448","7838345856","4182755500","1395357480","305284749","44565312","4303530","264000","9317","144"],["6227020800","54302952960","117188809344","116684388480","66623236900","24162815160","5867938307","978088320","112348863","8745000","440561","12960","169"],["87178291200","785149424640","1762824974976","1841917099776","1115044673600","434216873376","115039412488","21357482432","2810777112","261132300","16749304","705744","17576","196"],["1307674368000","12125954534400","28208960830080","30762667563264","19603665572400","8118917430624","2316608598304","470617795648","69192220383","7387079700","567209643","30519216","1091909","23324","225"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","35","225","1624","13132","118124","1172700","12753576","150917976","1931559552","26596717056","392156797824","6165817614720","102992244837120"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one_squared","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","0","9"],["0","-4","0"],["-1","0","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0","0","4"],["0","0","4","0"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1","4"],["2","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":180877,"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-6d19d39e3b41d919"]},{"id":180878,"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-6d19d39e3b41d919"]},{"id":180879,"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-6d19d39e3b41d919"]},{"id":180880,"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-6d19d39e3b41d919"]}],"region_exact":{},"incoming_edges":[{"id":"e-6d19d39e3b41d919","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"2\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-fce00c81894c6066","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":"2d4cc70fc0b5020063ad192b08de4c8bece51c88bcd5c87596b1fe8aeaa8a762","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-118df561f851b6e5","kind":"fingerprint_related","node_a_id":"n-fce00c81894c6066","node_b_id":"n-c391da7eb58bddf2","fingerprint":"f6-505ab518d44a108d","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-505ab518d44a108d"},"other_id":"n-c391da7eb58bddf2","other":{"id":"n-c391da7eb58bddf2","name":"theta_plus_one_squared of Unsigned 2-Stirling numbers of the first kind.","first_index":0,"fingerprint":"f6-505ab518d44a108d","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["6","20","9"],["24","104","81","16"],["120","616","639","224","25"]],"card_rows":[["6","20","9"],["24","104","81","16"],["120","616","639","224","25"],["720","4176","5220","2480","500","36"]],"row_sums_preview":["35","225","1624","13132","118124","1172700","12753576","150917976"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-c237629cf5fdbb07","steps":["(\u03b8+1)\u00b2"],"edges":["e-4d5a72d2d46158b1"],"text":"A143491 \u2192 (\u03b8+1)\u00b2"},"headline":"A143491 \u2192 (\u03b8+1)\u00b2","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,        4;\n  2:       6,       20,        9;\n  3:      24,      104,       81,       16;\n  4:     120,      616,      639,      224,       25;\n  5:     720,     4176,     5220,     2480,      500,      36;\n  6:    5040,    32112,    45936,    26640,     7375,     972,     49;\n  7:   40320,   277056,   439740,   294784,   100625,   18396,   1715,    64;\n  8:  362880,  2654784,  4581036,  3434816,  1366225,  310464,  40474,  2816,   81;\n  9: 3628800, 27999360, 51783624, 42492224, 19029150, 5072004, 827316, 81024, 4374, 100;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n^2+4*n*x-9*x^2)*P(n-2,x) + (4*n*x^2+4*x^3)*d/dx P(n-2,x) + (2*n+1+4*x)*P(n-1,x) - 4*x^2*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 4*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 4*x;\nP[n_, x_] := P[n, x] = Expand[-(n^2 + 4*n*x - 9*x^2)*P[n - 2, x] + (4*n*x^2 + 4*x^3)*D[P[n - 2, x], x] + (2*n + 1 + 4*x)*P[n - 1, x] - 4*x^2*D[P[n - 1, x], 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 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 + 4*n*x - 9*x^2)*v[i - 2] + (4*n*x^2 + 4*x^3)*deriv(v[i - 2], x) + (2*n + 1 + 4*x)*v[i - 1] - 4*x^2*deriv(v[i - 1], x)); 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)\u00b2"],"edges":["e-6d19d39e3b41d919"],"text":"A136124 \u2192 (\u03b8+1)\u00b2"},"headline":"A136124 \u2192 (\u03b8+1)\u00b2","chain":null}