{"id":"n-10ec39f7d62c2576","revision":0,"first_index":0,"fingerprint":"f6-c40d4ba195f863cb","name":"theta_plus_one_squared of Triangle of coefficients in expansion of (x+1)*(x+3)*...*(x + 2n - 1) in rising powers of x.","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"],["1","4"],["3","16","9"],["15","92","81","16"],["105","704","774","256","25"],["945","6756","8550","3680","625","36"],["10395","78096","109251","55680","12625","1296","49"],["135135","1056828","1595979","918064","251125","35028","2401","64"],["2027025","16392960","26317548","16608256","5201350","887040","83692","4096","81"],["34459425","286788420","484282476","329127104","114373350","22569624","2630124","178944","6561","100"],["654729075","5586817680","9846640989","7114361600","2687354750","593520480","80692122","6835200","351135","10000","121"],["13749310575","119942087580","219349800549","166906733136","67550639750","16333720920","2502381882","248932992","16024635","643500","14641","144"],["316234143225","2813665256640","5314915109682","4228810063104","1814456484775","472948502400","79786792316","8993875968","683622423","34584000","1115378","20736","169"],["7905853580625","71606567988900","139203624569490","115168989550368","51968927842975","14436529898076","2638405269500","329058219776","28473434847","1708578300","69731090","1845792","28561","196"],["213458046676875","1965000750022800","3919612641351255","3357035828205696","1583112597932775","464621563341936","90886663526659","12330652285952","1185247050273","81284002800","3950119173","132822144","2937389","38416","225"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","28","204","1864","20592","267392","3994624","67522048","1274416128","26571313152","606600290304","15050529570816","403288210538496","11607329360314368"],"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"],["1","4"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-9","12","9"],["12","-8","0"],["-4","0","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0","-12","4"],["0","0","8","0"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-4","4"],["4","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":182723,"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-2c7db02d817711d5"]},{"id":182724,"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-2c7db02d817711d5"]},{"id":182725,"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-2c7db02d817711d5"]},{"id":182726,"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-2c7db02d817711d5"]}],"region_exact":{},"incoming_edges":[{"id":"e-2c7db02d817711d5","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-10ec39f7d62c2576","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":"aa68aaa7eaef27737c70347ffcf5d8cadc3c9b668cec2fef772579b67232b116","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-4f6e747b794bcc2e","role":"sequence","name":"Triangle of coefficients in expansion of (x+1)*(x+3)*...*(x + 2n - 1) in rising powers of x.","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-26cca37247563546","kind":"fingerprint_related","node_a_id":"n-10ec39f7d62c2576","node_b_id":"n-5bbcb263521f680c","fingerprint":"f6-c40d4ba195f863cb","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c40d4ba195f863cb"},"other_id":"n-5bbcb263521f680c","other":{"id":"n-5bbcb263521f680c","name":"theta_plus_one_squared of basis_map_A007318 of Triangle T(n,k) giving number of degree-2n permutations which decompose into exactly k cycles of even length, k=0..n.","first_index":0,"fingerprint":"f6-c40d4ba195f863cb","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","4"],["9","48","27"]],"card_rows":[["1"],["1","4"],["9","48","27"],["225","1380","1215","240"]],"row_sums_preview":["1","5","84","3060","195720","19459440","2779539840","539813514240"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-1336d058dca9979e","steps":["basis A007318","(\u03b8+1)\u00b2"],"edges":["e-857dad5fd144a15f","e-89f33808371f09d3"],"text":"A204420 \u2192 basis A007318 \u2192 (\u03b8+1)\u00b2"},"headline":"A204420 \u2192 basis A007318 \u2192 (\u03b8+1)\u00b2","chain":null}},{"id":"l-ae44fbae9af07116","kind":"fingerprint_related","node_a_id":"n-10ec39f7d62c2576","node_b_id":"n-148240ce05e5ebe4","fingerprint":"f6-c40d4ba195f863cb","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c40d4ba195f863cb"},"other_id":"n-148240ce05e5ebe4","other":{"id":"n-148240ce05e5ebe4","name":"theta_plus_one_squared of basis_map_A013609 of Triangle read by rows: T(n, k) is the Sheffer triangle ((1 - 4*x)^(-1/4), (-1/4)*log(1 - 4*x)). A generalized Stirling1 triangle.","first_index":0,"fingerprint":"f6-c40d4ba195f863cb","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","8"],["12","64","36"]],"card_rows":[["1"],["2","8"],["12","64","36"],["120","736","648","128"]],"row_sums_preview":["1","10","112","1632","29824","658944","17113088","511311872"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-4172472abe953cea","steps":["basis A013609","(\u03b8+1)\u00b2"],"edges":["e-294a6ed01a588998","e-f4a51c0ba7a20a55"],"text":"A290319 \u2192 basis A013609 \u2192 (\u03b8+1)\u00b2"},"headline":"A290319 \u2192 basis A013609 \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:        1,         4;\n  2:        3,        16,         9;\n  3:       15,        92,        81,        16;\n  4:      105,       704,       774,       256,        25;\n  5:      945,      6756,      8550,      3680,       625,       36;\n  6:    10395,     78096,    109251,     55680,     12625,     1296,      49;\n  7:   135135,   1056828,   1595979,    918064,    251125,    35028,    2401,     64;\n  8:  2027025,  16392960,  26317548,  16608256,   5201350,   887040,   83692,   4096,   81;\n  9: 34459425, 286788420, 484282476, 329127104, 114373350, 22569624, 2630124, 178944, 6561, 100;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(4*n^2-12*n+9+(8*n-12)*x-9*x^2)*P(n-2,x) + ((8*n-12)*x^2+4*x^3)*d/dx P(n-2,x) + (4*n-4+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) = 1 + 4*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + 4*x;\nP[n_, x_] := P[n, x] = Expand[-(4*n^2 - 12*n + 9 + (8*n - 12)*x - 9*x^2)*P[n - 2, x] + ((8*n - 12)*x^2 + 4*x^3)*D[P[n - 2, x], x] + (4*n - 4 + 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] = 1 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = -(4*n^2 - 12*n + 9 + (8*n - 12)*x - 9*x^2)*v[i - 2] + ((8*n - 12)*x^2 + 4*x^3)*deriv(v[i - 2], x) + (4*n - 4 + 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-4f6e747b794bcc2e","steps":["(\u03b8+1)\u00b2"],"edges":["e-2c7db02d817711d5"],"text":"A028338 \u2192 (\u03b8+1)\u00b2"},"headline":"A028338 \u2192 (\u03b8+1)\u00b2","chain":null}