{"id":"n-0a0b20e3f10ebdec","revision":0,"first_index":0,"fingerprint":"f6-f613749a36a48642","name":"theta_plus_one_squared of shift_x_plus_one 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":false,"rows":[["1"],["2"],["4","8"],["8","16"],["16","64","36"],["32","128","72"],["64","384","432","128"],["128","768","864","256"],["256","2048","3456","2048","400"],["512","4096","6912","4096","800"],["1024","10240","23040","20480","8000","1152"],["2048","20480","46080","40960","16000","2304"],["4096","49152","138240","163840","96000","27648","3136"],["8192","98304","276480","327680","192000","55296","6272"],["16384","229376","774144","1146880","896000","387072","87808","8192"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","2","12","24","116","232","1008","2016","8208","16416","63936","127872","482112","964224","3545856"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one_squared","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["1024","448","16","-24","0"],["0","640","96","-12","0"],["0","0","224","44","1"],["0","0","0","24","2"],["0","0","0","0","1"]]},"terms":[{"coeff":{"coeffs":[["2048","-3200","-1760","-464","-40","-4"],["0","5376","-576","-552","-124","-8"],["0","0","3008","504","18","-1"],["0","0","0","576","112","7"],["0","0","0","0","42","5"],["0","0","0","0","0","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-4096","-4608","-2176","-608","-96","-8"],["0","0","-4352","-4416","-1648","-312","-24"],["0","0","0","-1280","-1104","-284","-26"],["0","0","0","0","-128","-88","-12"],["0","0","0","0","0","-4","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":172938,"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-f01140ef782e47b9"]},{"id":172939,"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-f01140ef782e47b9"]},{"id":172940,"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-f01140ef782e47b9"]}],"region_exact":{},"incoming_edges":[{"id":"e-f01140ef782e47b9","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-0a0b20e3f10ebdec","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":"50623730cce61607955be1cdfd009939c1ab42684681e36ef562671feb858fe2","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-d321ff0d3bb39024","role":"sequence","name":"shift_x_plus_one 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-da723c8bcb37ddbb","kind":"fingerprint_related","node_a_id":"n-3a8c7055e07fb582","node_b_id":"n-0a0b20e3f10ebdec","fingerprint":"f6-f613749a36a48642","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-f613749a36a48642"},"other_id":"n-3a8c7055e07fb582","other":{"id":"n-3a8c7055e07fb582","name":"theta_plus_one_squared of shift_x_plus_one of Triangle read by rows, A007318 rows repeated.","first_index":0,"fingerprint":"f6-f613749a36a48642","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["2","4"]],"card_rows":[["1"],["1"],["2","4"],["2","4"]],"row_sums_preview":["1","1","6","6","29","29","126","126"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-4124f4242e7d4c67","steps":["x \u21a6 x+1","(\u03b8+1)\u00b2"],"edges":["e-009b68c8336dc2e0","e-e1f64e2e742ca618"],"text":"A152198 \u2192 x \u21a6 x+1 \u2192 (\u03b8+1)\u00b2"},"headline":"A152198 \u2192 x \u21a6 x+1 \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:   1;\n  1:   2;\n  2:   4,    8;\n  3:   8,   16;\n  4:  16,   64,   36;\n  5:  32,  128,   72;\n  6:  64,  384,  432,  128;\n  7: 128,  768,  864,  256;\n  8: 256, 2048, 3456, 2048, 400;\n  9: 512, 4096, 6912, 4096, 800;\n","recurrence_sentence":"The row polynomials satisfy (1024+(640*n+448)*x+(224*n^2+96*n+16)*x^2+(24*n^3+44*n^2-12*n-24)*x^3+(n^4+2*n^3+n^2)*x^4)*P(n,x) = (2048+(5376*n-3200)*x+(3008*n^2-576*n-1760)*x^2+(576*n^3+504*n^2-552*n-464)*x^3+(42*n^4+112*n^3+18*n^2-124*n-40)*x^4+(n^5+5*n^4+7*n^3-n^2-8*n-4)*x^5)*P(n-1,x) - (4096*x+(4352*n+4608)*x^2+(1280*n^2+4416*n+2176)*x^3+(128*n^3+1104*n^2+1648*n+608)*x^4+(4*n^4+88*n^3+284*n^2+312*n+96)*x^5+(2*n^4+12*n^3+26*n^2+24*n+8)*x^6)*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[((2048 + (5376*n - 3200)*x + (3008*n^2 - 576*n - 1760)*x^2 + (576*n^3 + 504*n^2 - 552*n - 464)*x^3 + (42*n^4 + 112*n^3 + 18*n^2 - 124*n - 40)*x^4 + (n^5 + 5*n^4 + 7*n^3 - n^2 - 8*n - 4)*x^5)*P[n - 1, x] - (4096*x + (4352*n + 4608)*x^2 + (1280*n^2 + 4416*n + 2176)*x^3 + (128*n^3 + 1104*n^2 + 1648*n + 608)*x^4 + (4*n^4 + 88*n^3 + 284*n^2 + 312*n + 96)*x^5 + (2*n^4 + 12*n^3 + 26*n^2 + 24*n + 8)*x^6)*D[P[n - 1, x], x])/(1024 + (640*n + 448)*x + (224*n^2 + 96*n + 16)*x^2 + (24*n^3 + 44*n^2 - 12*n - 24)*x^3 + (n^4 + 2*n^3 + n^2)*x^4)]];\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] = ((2048 + (5376*n - 3200)*x + (3008*n^2 - 576*n - 1760)*x^2 + (576*n^3 + 504*n^2 - 552*n - 464)*x^3 + (42*n^4 + 112*n^3 + 18*n^2 - 124*n - 40)*x^4 + (n^5 + 5*n^4 + 7*n^3 - n^2 - 8*n - 4)*x^5)*v[i - 1] - (4096*x + (4352*n + 4608)*x^2 + (1280*n^2 + 4416*n + 2176)*x^3 + (128*n^3 + 1104*n^2 + 1648*n + 608)*x^4 + (4*n^4 + 88*n^3 + 284*n^2 + 312*n + 96)*x^5 + (2*n^4 + 12*n^3 + 26*n^2 + 24*n + 8)*x^6)*deriv(v[i - 1], x))/(1024 + (640*n + 448)*x + (224*n^2 + 96*n + 16)*x^2 + (24*n^3 + 44*n^2 - 12*n - 24)*x^3 + (n^4 + 2*n^3 + n^2)*x^4)); 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":["x \u21a6 x+1","(\u03b8+1)\u00b2"],"edges":["e-5428ec8f88838d6b","e-f01140ef782e47b9"],"text":"A274496 \u2192 x \u21a6 x+1 \u2192 (\u03b8+1)\u00b2"},"headline":"A274496 \u2192 x \u21a6 x+1 \u2192 (\u03b8+1)\u00b2","chain":null}