{"id":"n-420806a6897f85cc","revision":0,"first_index":0,"fingerprint":"f6-e87c7ae0c114eab6","name":"theta_plus_one of basis_map_A013609 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal length) of identical letters (1 <= k <= n).","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":true,"rows":[["3"],["9","24"],["27","144","144"],["81","648","1296","768"],["243","2592","7776","9216","3840"],["729","9720","38880","69120","57600","18432"],["2187","34992","174960","414720","518400","331776","86016"],["6561","122472","734832","2177280","3628800","3483648","1806336","393216"],["19683","419904","2939328","10450944","21772800","27869184","21676032","9437184","1769472"],["59049","1417176","11337408","47029248","117573120","188116992","195084288","127401984","47775744","7864320"],["177147","4723920","42515280","201553920","587865600","1128701952","1463132160","1274019840","716636160","235929600","34603008"],["531441","15588936","155889360","831409920","2771366400","6207860736","9656672256","10510663680","7882997760","3892838400","1141899264","150994944"],["1594323","51018336","561201696","3325639680","12471148800","31926140928","57940033536","75676778496","70946979840","46714060800","20554186752","5435817984","654311424"],["4782969","165809592","1989715104","12969994752","54041644800","155639937024","322808758272","491899060224","553386442752","455462092800","267204427776","105998450688","25518145536","2818572288"],["14348907","535692528","6964002864","49521798144","226974908160","726319706112","1694745980928","2951394361344","3873705099264","3825881579520","2805646491648","1483978309632","535881056256","118380036096","12079595520"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["3","33","315","2793","23667","194481","1563051","12353145","96354531","743659329","5689858587","43218713097","326258912595","2449907834577","18312022966923"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["3"]],"recurrence":{"denominator":{"coeffs":[["3","0"],["0","4"]]},"terms":[{"coeff":{"coeffs":[["9","24","16"],["0","12","16"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":183533,"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-cc290c0929de99ac"]},{"id":183534,"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-cc290c0929de99ac"]},{"id":183535,"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-cc290c0929de99ac"]},{"id":183536,"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-cc290c0929de99ac"]}],"region_exact":{},"incoming_edges":[{"id":"e-cc290c0929de99ac","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-420806a6897f85cc","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":"1277d93d58f80e54a016c89b12929cd183ceb5a7eee071137a65c3d75a8a0f5b","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-4a6fce4b90b6e934","role":"sequence","name":"basis_map_A013609 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal length) of identical letters (1 <= k <= n).","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-a9a66f1898b1aedd","kind":"fingerprint_related","node_a_id":"n-fdf5a9fb32acbd5a","node_b_id":"n-420806a6897f85cc","fingerprint":"f6-e87c7ae0c114eab6","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-e87c7ae0c114eab6"},"other_id":"n-fdf5a9fb32acbd5a","other":{"id":"n-fdf5a9fb32acbd5a","name":"theta_plus_one of basis_map_A013609 of Triangle of coefficients in expansion of (1+2*x)^n.","first_index":0,"fingerprint":"f6-e87c7ae0c114eab6","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["3","8"],["9","48","48"]],"card_rows":[["1"],["3","8"],["9","48","48"],["27","216","432","256"]],"row_sums_preview":["1","11","105","931","7889","64827","521017","4117715"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-71965e79e47a4526","steps":["basis A013609","\u03b8+1"],"edges":["e-95924f9cf72f1e84","e-f8e0963cf0e664f0"],"text":"A013609 \u2192 basis A013609 \u2192 \u03b8+1"},"headline":"A013609 \u2192 basis A013609 \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:     3;\n  1:     9,      24;\n  2:    27,     144,      144;\n  3:    81,     648,     1296,      768;\n  4:   243,    2592,     7776,     9216,      3840;\n  5:   729,    9720,    38880,    69120,     57600,     18432;\n  6:  2187,   34992,   174960,   414720,    518400,    331776,     86016;\n  7:  6561,  122472,   734832,  2177280,   3628800,   3483648,   1806336,    393216;\n  8: 19683,  419904,  2939328, 10450944,  21772800,  27869184,  21676032,   9437184,  1769472;\n  9: 59049, 1417176, 11337408, 47029248, 117573120, 188116992, 195084288, 127401984, 47775744, 7864320;\n","recurrence_sentence":"The row polynomials satisfy (3+4*n*x)*P(n,x) = (9+(12*n+24)*x+(16*n+16)*x^2)*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[((9 + (12*n + 24)*x + (16*n + 16)*x^2)*P[n - 1, x])/(3 + 4*n*x)]];\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] = ((9 + (12*n + 24)*x + (16*n + 16)*x^2)*v[i - 1])/(3 + 4*n*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-51b4f5e7901c2b50","steps":["basis A013611","\u03b8+1"],"edges":["e-1a05d30902084644","e-cc290c0929de99ac"],"text":"A120910 \u2192 basis A013611 \u2192 \u03b8+1"},"headline":"A120910 \u2192 basis A013611 \u2192 \u03b8+1","chain":null}