{"id":"n-2efb8d79b4c84c75","revision":0,"first_index":0,"fingerprint":"f6-5201f89336acf752","name":"theta_plus_one of basis_map_A013610 of Triangle read by rows: T(n,k) is the number of binary 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"],["2"],["4","12"],["8","24"],["16","96","108"],["32","192","216"],["64","576","1296","864"],["128","1152","2592","1728"],["256","3072","10368","13824","6480"],["512","6144","20736","27648","12960"],["1024","15360","69120","138240","129600","46656"],["2048","30720","138240","276480","259200","93312"],["4096","73728","414720","1105920","1555200","1119744","326592"],["8192","147456","829440","2211840","3110400","2239488","653184"],["16384","344064","2322432","7741440","14515200","15676416","9144576","2239488"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","2","16","32","220","440","2800","5600","34000","68000","400000","800000","4600000","9200000","52000000"],"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":[["32","36","0"],["0","24","9"],["0","0","9"]]},"terms":[{"coeff":{"coeffs":[["64","-120","-216","-54"],["0","240","90","-27"],["0","0","162","54"],["0","0","0","27"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-128","-384","-360","-108"],["0","0","-144","-324","-162"],["0","0","0","-36","-54"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":174374,"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-14319440978760cd"]},{"id":174375,"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-14319440978760cd"]},{"id":174376,"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-14319440978760cd"]}],"region_exact":{},"incoming_edges":[{"id":"e-14319440978760cd","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-2efb8d79b4c84c75","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":"2356f55b275941159a8a70ed5d2db7b23d968e78913e93ce67c1d382a19f308f","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-a9e3a6c6145e13ca","role":"sequence","name":"basis_map_A013610 of Triangle read by rows: T(n,k) is the number of binary 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-5fa9106b7192080f","kind":"fingerprint_related","node_a_id":"n-bd565809281b0df1","node_b_id":"n-2efb8d79b4c84c75","fingerprint":"f6-5201f89336acf752","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-5201f89336acf752"},"other_id":"n-bd565809281b0df1","other":{"id":"n-bd565809281b0df1","name":"theta_plus_one of basis_map_A013610 of Triangle read by rows, A007318 rows repeated.","first_index":0,"fingerprint":"f6-5201f89336acf752","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["1"],["2","6"]],"card_rows":[["1"],["1"],["2","6"],["2","6"]],"row_sums_preview":["1","1","8","8","55","55","350","350"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-4124f4242e7d4c67","steps":["basis A013610","\u03b8+1"],"edges":["e-c6857bd156c16708","e-2c2cfec0e137c866"],"text":"A152198 \u2192 basis A013610 \u2192 \u03b8+1"},"headline":"A152198 \u2192 basis A013610 \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:   2;\n  2:   4,   12;\n  3:   8,   24;\n  4:  16,   96,   108;\n  5:  32,  192,   216;\n  6:  64,  576,  1296,   864;\n  7: 128, 1152,  2592,  1728;\n  8: 256, 3072, 10368, 13824,  6480;\n  9: 512, 6144, 20736, 27648, 12960;\n","recurrence_sentence":"The row polynomials satisfy (32+(24*n+36)*x+(9*n^2+9*n)*x^2)*P(n,x) = (64+(240*n-120)*x+(162*n^2+90*n-216)*x^2+(27*n^3+54*n^2-27*n-54)*x^3)*P(n-1,x) - (128*x+(144*n+384)*x^2+(36*n^2+324*n+360)*x^3+(54*n^2+162*n+108)*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[((64 + (240*n - 120)*x + (162*n^2 + 90*n - 216)*x^2 + (27*n^3 + 54*n^2 - 27*n - 54)*x^3)*P[n - 1, x] - (128*x + (144*n + 384)*x^2 + (36*n^2 + 324*n + 360)*x^3 + (54*n^2 + 162*n + 108)*x^4)*D[P[n - 1, x], x])/(32 + (24*n + 36)*x + (9*n^2 + 9*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] = ((64 + (240*n - 120)*x + (162*n^2 + 90*n - 216)*x^2 + (27*n^3 + 54*n^2 - 27*n - 54)*x^3)*v[i - 1] - (128*x + (144*n + 384)*x^2 + (36*n^2 + 324*n + 360)*x^3 + (54*n^2 + 162*n + 108)*x^4)*deriv(v[i - 1], x))/(32 + (24*n + 36)*x + (9*n^2 + 9*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-b6aca576a689e9f0","steps":["basis A013610","\u03b8+1"],"edges":["e-4e3482570d7ce009","e-14319440978760cd"],"text":"A274496 \u2192 basis A013610 \u2192 \u03b8+1"},"headline":"A274496 \u2192 basis A013610 \u2192 \u03b8+1","chain":null}