{"id":"n-5bbc9a303e54ec16","revision":1,"first_index":0,"fingerprint":"f6-4a9146a6908256f6","name":"theta_plus_one of Triangle read by rows: T(n,k) is the number of ternary words of length n having degree of asymmetry equal to k (n>=0; 0<=k<=n/2).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":true,"rows":[["1"],["3"],["3","12"],["9","36"],["9","72","108"],["27","216","324"],["27","324","972","864"],["81","972","2916","2592"],["81","1296","5832","10368","6480"],["243","3888","17496","31104","19440"],["243","4860","29160","77760","97200","46656"],["729","14580","87480","233280","291600","139968"],["729","17496","131220","466560","874800","839808","326592"],["2187","52488","393660","1399680","2624400","2519424","979776"],["2187","61236","551124","2449440","6123600","8817984","6858432","2239488"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","3","15","45","189","567","2187","6561","24057","72171","255879","767637","2657205","7971615","27103491"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["2","3","0"],["0","2","1"],["0","0","1"]]},"terms":[{"coeff":{"coeffs":[["10","3","-12","-4"],["-4","18","9","-2"],["0","-6","11","4"],["0","0","-2","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["2","2","-12","-20","-8"],["0","4","4","-14","-12"],["0","0","2","2","-4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":163988,"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-493e6c3c99ee8db4"]},{"id":163989,"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-493e6c3c99ee8db4"]},{"id":163990,"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-493e6c3c99ee8db4"]}],"region_exact":{},"incoming_edges":[{"id":"e-493e6c3c99ee8db4","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-5bbc9a303e54ec16","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":"1560544edcc34b1fa29a28ae2f43152757e580948fffed82efd4495a18d83c87","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-7c641d81e21514ce","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of ternary words of length n having degree of asymmetry equal to k (n>=0; 0<=k<=n/2).","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-a8c419980f5c24fb","kind":"fingerprint_related","node_a_id":"n-5265efb6991612b1","node_b_id":"n-5bbc9a303e54ec16","fingerprint":"f6-4a9146a6908256f6","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-4a9146a6908256f6"},"other_id":"n-5265efb6991612b1","other":{"id":"n-5265efb6991612b1","name":"theta_plus_one of Triangle T(n,k) read by rows: number of size-k antisymmetric subsets of {1,2,...,n}.","first_index":0,"fingerprint":"f6-4a9146a6908256f6","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["1"],["1","4"]],"card_rows":[["1"],["1"],["1","4"],["1","4"]],"row_sums_preview":["1","1","5","5","21","21","81","81"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-ba3bb18490b15e2e","steps":["\u03b8+1"],"edges":["e-f85b46c82d805226"],"text":"A188440 \u2192 \u03b8+1"},"headline":"A188440 \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:   1;\n  1:   3;\n  2:   3,   12;\n  3:   9,   36;\n  4:   9,   72,   108;\n  5:  27,  216,   324;\n  6:  27,  324,   972,   864;\n  7:  81,  972,  2916,  2592;\n  8:  81, 1296,  5832, 10368,  6480;\n  9: 243, 3888, 17496, 31104, 19440;\n","recurrence_sentence":"The row polynomials satisfy (2+(2*n+3)*x+(n^2+n)*x^2)*P(n,x) = -(4*n-10+(6*n^2-18*n-3)*x+(2*n^3-11*n^2-9*n+12)*x^2-(2*n^3+4*n^2-2*n-4)*x^3)*P(n-1,x) + (2+(4*n+2)*x+(2*n^2+4*n-12)*x^2+(2*n^2-14*n-20)*x^3-(4*n^2+12*n+8)*x^4)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[(-(4*n - 10 + (6*n^2 - 18*n - 3)*x + (2*n^3 - 11*n^2 - 9*n + 12)*x^2 - (2*n^3 + 4*n^2 - 2*n - 4)*x^3)*P[n - 1, x] + (2 + (4*n + 2)*x + (2*n^2 + 4*n - 12)*x^2 + (2*n^2 - 14*n - 20)*x^3 - (4*n^2 + 12*n + 8)*x^4)*D[P[n - 1, x], x])/(2 + (2*n + 3)*x + (n^2 + n)*x^2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (-(4*n - 10 + (6*n^2 - 18*n - 3)*x + (2*n^3 - 11*n^2 - 9*n + 12)*x^2 - (2*n^3 + 4*n^2 - 2*n - 4)*x^3)*v[i - 1] + (2 + (4*n + 2)*x + (2*n^2 + 4*n - 12)*x^2 + (2*n^2 - 14*n - 20)*x^3 - (4*n^2 + 12*n + 8)*x^4)*deriv(v[i - 1], x))/(2 + (2*n + 3)*x + (n^2 + n)*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-7c641d81e21514ce","steps":["\u03b8+1"],"edges":["e-493e6c3c99ee8db4"],"text":"A274498 \u2192 \u03b8+1"},"headline":"A274498 \u2192 \u03b8+1","chain":null}