{"id":"n-58281abfb06e824f","revision":1,"first_index":0,"fingerprint":"f6-7cabb77b45806852","name":"theta_plus_one 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"],["3","12"],["3","24","36"],["3","36","108","96"],["3","48","216","384","240"],["3","60","360","960","1200","576"],["3","72","540","1920","3600","3456","1344"],["3","84","756","3360","8400","12096","9408","3072"],["3","96","1008","5376","16800","32256","37632","24576","6912"],["3","108","1296","8064","30240","72576","112896","110592","62208","15360"],["3","120","1620","11520","50400","145152","282240","368640","311040","153600","33792"],["3","132","1980","15840","79200","266112","620928","1013760","1140480","844800","371712","73728"],["3","144","2376","21120","118800","456192","1241856","2433024","3421440","3379200","2230272","884736","159744"],["3","156","2808","27456","171600","741312","2306304","5271552","8895744","10982400","9664512","5750784","2076672","344064"],["3","168","3276","34944","240240","1153152","4036032","10543104","20756736","30750720","33825792","26836992","14536704","4816896","737280"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["3","15","63","243","891","3159","10935","37179","124659","413343","1358127","4428675","14348907","46235367","148272039"],"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":[["1","0"],["0","2"]]},"terms":[{"coeff":{"coeffs":[["1","4","4"],["0","2","4"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":164135,"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-8d945ebe18ee4c8a"]},{"id":164136,"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-8d945ebe18ee4c8a"]},{"id":164137,"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-8d945ebe18ee4c8a"]},{"id":164138,"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-8d945ebe18ee4c8a"]}],"region_exact":{},"incoming_edges":[{"id":"e-8d945ebe18ee4c8a","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-58281abfb06e824f","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":"bb5b9cb4d5d38b1458b39f7fb6a37add85dcdea9cc5030a7392f2e2ca98d0d13","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-765f9e2b013b3c68","role":"sequence","name":"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-75ae8f92a0c20fde","kind":"fingerprint_related","node_a_id":"n-f38c68e75ec69849","node_b_id":"n-58281abfb06e824f","fingerprint":"f6-7cabb77b45806852","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-7cabb77b45806852"},"other_id":"n-f38c68e75ec69849","other":{"id":"n-f38c68e75ec69849","name":"theta_plus_one of Triangle of coefficients in expansion of (1+2*x)^n.","first_index":0,"fingerprint":"f6-7cabb77b45806852","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["1","4"],["1","8","12"]],"card_rows":[["1"],["1","4"],["1","8","12"],["1","12","36","32"]],"row_sums_preview":["1","5","21","81","297","1053","3645","12393"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-71965e79e47a4526","steps":["\u03b8+1"],"edges":["e-1108847626c3577f"],"text":"A013609 \u2192 \u03b8+1"},"headline":"A013609 \u2192 \u03b8+1","chain":null}},{"id":"l-7b8c011230aabf19","kind":"fingerprint_related","node_a_id":"n-a492dc7276777329","node_b_id":"n-58281abfb06e824f","fingerprint":"f6-7cabb77b45806852","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-7cabb77b45806852"},"other_id":"n-a492dc7276777329","other":{"id":"n-a492dc7276777329","name":"mobius_x_over_x_plus_one of Triangle, row sums = number of edges in n-dimensional hypercubes.","first_index":0,"fingerprint":"f6-7cabb77b45806852","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["1","4"],["1","8","12"]],"card_rows":[["1"],["1","4"],["1","8","12"],["1","12","36","32"]],"row_sums_preview":["1","5","21","81","297","1053","3645","12393"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-c8c19eba9d68881f","steps":["2\u03b8+1","x \u21a6 x/(x+1)"],"edges":["e-c4ea45619bc7f60a","e-c033b30f4e233ccb"],"text":"A007318 \u2192 2\u03b8+1 \u2192 x \u21a6 x/(x+1)"},"headline":"A007318 \u2192 2\u03b8+1 \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-33025ab1451bd509","kind":"oeis_match","node_a_id":"n-58281abfb06e824f","node_b_id":null,"fingerprint":null,"oeis_id":"A229277","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A229277","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A229277","relation":"match_row_sums"}],"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: 3,  12;\n  2: 3,  24,   36;\n  3: 3,  36,  108,   96;\n  4: 3,  48,  216,  384,   240;\n  5: 3,  60,  360,  960,  1200,   576;\n  6: 3,  72,  540, 1920,  3600,  3456,   1344;\n  7: 3,  84,  756, 3360,  8400, 12096,   9408,   3072;\n  8: 3,  96, 1008, 5376, 16800, 32256,  37632,  24576,  6912;\n  9: 3, 108, 1296, 8064, 30240, 72576, 112896, 110592, 62208, 15360;\n","recurrence_sentence":"The row polynomials satisfy (1+2*n*x)*P(n,x) = (1+(2*n+4)*x+(4*n+4)*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[((1 + (2*n + 4)*x + (4*n + 4)*x^2)*P[n - 1, x])/(1 + 2*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] = ((1 + (2*n + 4)*x + (4*n + 4)*x^2)*v[i - 1])/(1 + 2*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-765f9e2b013b3c68","steps":["\u03b8+1"],"edges":["e-8d945ebe18ee4c8a"],"text":"A120909 \u2192 \u03b8+1"},"headline":"A120909 \u2192 \u03b8+1","chain":null}