{"id":"n-0b5fdf5ee862725f","revision":0,"first_index":0,"fingerprint":"f6-90678fce5eba4992","name":"theta_plus_one 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":true,"rows":[["1"],["2"],["4","4"],["8","8"],["16","32","12"],["32","64","24"],["64","192","144","32"],["128","384","288","64"],["256","1024","1152","512","80"],["512","2048","2304","1024","160"],["1024","5120","7680","5120","1600","192"],["2048","10240","15360","10240","3200","384"],["4096","24576","46080","40960","19200","4608","448"],["8192","49152","92160","81920","38400","9216","896"],["16384","114688","258048","286720","179200","64512","12544","1024"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","2","8","16","60","120","432","864","3024","6048","20736","41472","139968","279936","933120"],"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","12","0"],["0","8","1"],["0","0","1"]]},"terms":[{"coeff":{"coeffs":[["64","-40","-24","-2"],["0","80","10","-1"],["0","0","18","2"],["0","0","0","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-128","-128","-40","-4"],["0","0","-48","-36","-6"],["0","0","0","-4","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":172935,"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-89e0088710520b5e"]},{"id":172936,"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-89e0088710520b5e"]},{"id":172937,"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-89e0088710520b5e"]}],"region_exact":{},"incoming_edges":[{"id":"e-89e0088710520b5e","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-0b5fdf5ee862725f","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":"221736ef20e77ac60fbde54deb9797c53934d0dc2ee6d07eb74584d9f7b2abde","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-50601cbf7ef4444e","kind":"fingerprint_related","node_a_id":"n-a12b13f8ef19e579","node_b_id":"n-0b5fdf5ee862725f","fingerprint":"f6-90678fce5eba4992","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-90678fce5eba4992"},"other_id":"n-a12b13f8ef19e579","other":{"id":"n-a12b13f8ef19e579","name":"theta_plus_one of shift_x_plus_one of Triangle read by rows, A007318 rows repeated.","first_index":0,"fingerprint":"f6-90678fce5eba4992","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["1"],["2","2"]],"card_rows":[["1"],["1"],["2","2"],["2","2"]],"row_sums_preview":["1","1","4","4","15","15","54","54"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-4124f4242e7d4c67","steps":["x \u21a6 x+1","\u03b8+1"],"edges":["e-009b68c8336dc2e0","e-7e5dcd7db571819d"],"text":"A152198 \u2192 x \u21a6 x+1 \u2192 \u03b8+1"},"headline":"A152198 \u2192 x \u21a6 x+1 \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,    4;\n  3:   8,    8;\n  4:  16,   32,   12;\n  5:  32,   64,   24;\n  6:  64,  192,  144,   32;\n  7: 128,  384,  288,   64;\n  8: 256, 1024, 1152,  512,  80;\n  9: 512, 2048, 2304, 1024, 160;\n","recurrence_sentence":"The row polynomials satisfy (32+(8*n+12)*x+(n^2+n)*x^2)*P(n,x) = (64+(80*n-40)*x+(18*n^2+10*n-24)*x^2+(n^3+2*n^2-n-2)*x^3)*P(n-1,x) - (128*x+(48*n+128)*x^2+(4*n^2+36*n+40)*x^3+(2*n^2+6*n+4)*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 + (80*n - 40)*x + (18*n^2 + 10*n - 24)*x^2 + (n^3 + 2*n^2 - n - 2)*x^3)*P[n - 1, x] - (128*x + (48*n + 128)*x^2 + (4*n^2 + 36*n + 40)*x^3 + (2*n^2 + 6*n + 4)*x^4)*D[P[n - 1, x], x])/(32 + (8*n + 12)*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] = ((64 + (80*n - 40)*x + (18*n^2 + 10*n - 24)*x^2 + (n^3 + 2*n^2 - n - 2)*x^3)*v[i - 1] - (128*x + (48*n + 128)*x^2 + (4*n^2 + 36*n + 40)*x^3 + (2*n^2 + 6*n + 4)*x^4)*deriv(v[i - 1], x))/(32 + (8*n + 12)*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-b6aca576a689e9f0","steps":["x \u21a6 x+1","\u03b8+1"],"edges":["e-5428ec8f88838d6b","e-89e0088710520b5e"],"text":"A274496 \u2192 x \u21a6 x+1 \u2192 \u03b8+1"},"headline":"A274496 \u2192 x \u21a6 x+1 \u2192 \u03b8+1","chain":null}