{"id":"n-f762457cfc7e31aa","revision":1,"first_index":0,"fingerprint":"f6-e1337d43fda52a72","name":"theta_plus_one_squared of Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A level is a pair of identical consecutive letters.","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":[["3"],["6","12"],["12","48","27"],["24","144","162","48"],["48","384","648","384","75"],["96","960","2160","1920","750","108"],["192","2304","6480","7680","4500","1296","147"],["384","5376","18144","26880","21000","9072","2058","192"],["768","12288","48384","86016","84000","48384","16464","3072","243"],["1536","27648","124416","258048","302400","217728","98784","27648","4374","300"],["3072","61440","311040","737280","1008000","870912","493920","184320","43740","6000","363"],["6144","135168","760320","2027520","3168000","3193344","2173248","1013760","320760","66000","7986","432"],["12288","294912","1824768","5406720","9504000","10948608","8692992","4866048","1924560","528000","95832","10368","507"],["24576","638976","4313088","14057472","27456000","35582976","32288256","21086208","10007712","3432000","830544","134784","13182","588"],["49152","1376256","10063872","35782656","76876800","110702592","113008896","84344832","46702656","19219200","5813808","1257984","184548","16464","675"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["3","18","87","378","1539","5994","22599","83106","299619","1062882","3720087","12872682","44109603","149866362","505400391"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one_squared","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["3"]],"recurrence":{"denominator":{"coeffs":[["4","-2","0"],["0","6","0"],["0","0","1"]]},"terms":[{"coeff":{"coeffs":[["8","12","6","1"],["0","12","10","2"],["0","0","2","1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":164120,"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-2333b9a5b7cd307a"]},{"id":164121,"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-2333b9a5b7cd307a"]},{"id":164122,"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-2333b9a5b7cd307a"]},{"id":164123,"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-2333b9a5b7cd307a"]}],"region_exact":{},"incoming_edges":[{"id":"e-2333b9a5b7cd307a","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-f762457cfc7e31aa","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":"3de68e22975936dafb3d3cc97551f2d1c9e0da3df830556a623a4c7bcebed7e8","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-51b4f5e7901c2b50","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A level is a pair of identical consecutive letters.","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-9dd2e7369e151db3","kind":"fingerprint_related","node_a_id":"n-259bf3a4424727d0","node_b_id":"n-f762457cfc7e31aa","fingerprint":"f6-e1337d43fda52a72","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-e1337d43fda52a72"},"other_id":"n-259bf3a4424727d0","other":{"id":"n-259bf3a4424727d0","name":"theta_plus_one_squared of Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).","first_index":0,"fingerprint":"f6-e1337d43fda52a72","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","4"],["4","16","9"]],"card_rows":[["1"],["2","4"],["4","16","9"],["8","48","54","16"]],"row_sums_preview":["1","6","29","126","513","1998","7533","27702"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-af754f07daf65b5e","steps":["(\u03b8+1)\u00b2"],"edges":["e-ff9aa724b47c3a92"],"text":"A038207 \u2192 (\u03b8+1)\u00b2"},"headline":"A038207 \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:    3;\n  1:    6,    12;\n  2:   12,    48,     27;\n  3:   24,   144,    162,     48;\n  4:   48,   384,    648,    384,     75;\n  5:   96,   960,   2160,   1920,    750,    108;\n  6:  192,  2304,   6480,   7680,   4500,   1296,   147;\n  7:  384,  5376,  18144,  26880,  21000,   9072,  2058,   192;\n  8:  768, 12288,  48384,  86016,  84000,  48384, 16464,  3072,  243;\n  9: 1536, 27648, 124416, 258048, 302400, 217728, 98784, 27648, 4374, 300;\n","recurrence_sentence":"The row polynomials satisfy (4+(6*n-2)*x+n^2*x^2)*P(n,x) = (8+(12*n+12)*x+(2*n^2+10*n+6)*x^2+(n^2+2*n+1)*x^3)*P(n-1,x) for n >= 1, with P(0,x) = 3.","mathematica":"P[0, x_] := 3;\nP[n_, x_] := P[n, x] = Expand[Together[((8 + (12*n + 12)*x + (2*n^2 + 10*n + 6)*x^2 + (n^2 + 2*n + 1)*x^3)*P[n - 1, x])/(4 + (6*n - 2)*x + n^2*x^2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 3; for(n = 1, N, my(i = n + 1); v[i] = ((8 + (12*n + 12)*x + (2*n^2 + 10*n + 6)*x^2 + (n^2 + 2*n + 1)*x^3)*v[i - 1])/(4 + (6*n - 2)*x + n^2*x^2)); 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-51b4f5e7901c2b50","steps":["(\u03b8+1)\u00b2"],"edges":["e-2333b9a5b7cd307a"],"text":"A120910 \u2192 (\u03b8+1)\u00b2"},"headline":"A120910 \u2192 (\u03b8+1)\u00b2","chain":null}