{"id":"n-c846bc324cb25f0c","revision":0,"first_index":0,"fingerprint":"f6-4f7c344a4c25ac22","name":"theta_plus_one_squared of derivative 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":-2,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[[],[],["2"],["4"],["8","32"],["16","64"],["24","192","216"],["48","384","432"],["64","768","1728","1024"],["128","1536","3456","2048"],["160","2560","8640","10240","4000"],["320","5120","17280","20480","8000"],["384","7680","34560","61440","48000","13824"],["768","15360","69120","122880","96000","27648"],["896","21504","120960","286720","336000","193536","43904"]],"degrees":[-1,-1,0,0,1,1,2,2,3,3,4,4,5,5,6],"row_sums":["0","0","2","4","40","80","432","864","3584","7168","25600","51200","165888","331776","1003520"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one_squared","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["0"],["2"]],"recurrence":{"denominator":{"coeffs":[["-128","208","-360","16","-8"],["64","-264","580","-108","28"],["0","80","-312","150","-38"],["0","0","56","-74","25"],["0","0","0","12","-8"],["0","0","0","0","1"]]},"terms":[{"coeff":{"coeffs":[["-1024","4352","-4992","1088","-64","0"],["576","-5224","8980","-3112","252","0"],["-64","1696","-5696","3506","-406","0"],["0","-136","1332","-1780","389","-3"],["0","0","-80","354","-189","7"],["0","0","0","-16","35","-5"],["0","0","0","0","-1","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-128","704","-608","-992","416","-32","0"],["32","-688","1464","1064","-1000","120","0"],["0","96","-888","76","880","-180","0"],["0","0","88","-292","-230","148","-2"],["0","0","0","24","-28","-48","4"],["0","0","0","0","2","0","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":172027,"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-6e441004198bccbf"]},{"id":172028,"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-6e441004198bccbf"]},{"id":172029,"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-6e441004198bccbf"]}],"region_exact":{},"incoming_edges":[{"id":"e-6e441004198bccbf","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-c846bc324cb25f0c","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":"504cce5fabb6ccb75ac0cccd8352287d1106858103f884dc56bf455b4fa5e7f9","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-507d474f4c2321e5","role":"sequence","name":"derivative 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-996fac09df343df3","kind":"fingerprint_related","node_a_id":"n-05fe2267b7e2ee62","node_b_id":"n-c846bc324cb25f0c","fingerprint":"f6-4f7c344a4c25ac22","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-4f7c344a4c25ac22"},"other_id":"n-05fe2267b7e2ee62","other":{"id":"n-05fe2267b7e2ee62","name":"theta_plus_one_squared of Triangle read by rows, A007318 rows repeated.","first_index":0,"fingerprint":"f6-4f7c344a4c25ac22","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["1","4"]],"card_rows":[["1"],["1"],["1","4"],["1","4"]],"row_sums_preview":["1","1","5","5","18","18","56","56"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-4124f4242e7d4c67","steps":["(\u03b8+1)\u00b2"],"edges":["e-e247b8d27ee67ca0"],"text":"A152198 \u2192 (\u03b8+1)\u00b2"},"headline":"A152198 \u2192 (\u03b8+1)\u00b2","chain":null}},{"id":"l-e4ab2d92d4455ba7","kind":"fingerprint_related","node_a_id":"n-760706415e8d0c94","node_b_id":"n-c846bc324cb25f0c","fingerprint":"f6-4f7c344a4c25ac22","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-4f7c344a4c25ac22"},"other_id":"n-760706415e8d0c94","other":{"id":"n-760706415e8d0c94","name":"theta_plus_one_squared of basis_map_A013609 of Triangle read by rows, A007318 rows repeated.","first_index":0,"fingerprint":"f6-4f7c344a4c25ac22","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["2","8"]],"card_rows":[["1"],["1"],["2","8"],["2","8"]],"row_sums_preview":["1","1","10","10","72","72","448","448"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-4124f4242e7d4c67","steps":["basis A013609","(\u03b8+1)\u00b2"],"edges":["e-500dd9b78517f374","e-22e8cf39d67b3907"],"text":"A152198 \u2192 basis A013609 \u2192 (\u03b8+1)\u00b2"},"headline":"A152198 \u2192 basis A013609 \u2192 (\u03b8+1)\u00b2","chain":null}},{"id":"l-fe915735b56b9ee2","kind":"fingerprint_related","node_a_id":"n-44e08c411ecb806d","node_b_id":"n-c846bc324cb25f0c","fingerprint":"f6-4f7c344a4c25ac22","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-4f7c344a4c25ac22"},"other_id":"n-44e08c411ecb806d","other":{"id":"n-44e08c411ecb806d","name":"theta_plus_one_squared 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).","first_index":0,"fingerprint":"f6-4f7c344a4c25ac22","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2"],["2","8"]],"card_rows":[["1"],["2"],["2","8"],["4","16"]],"row_sums_preview":["1","2","10","20","72","144","448","896"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b6aca576a689e9f0","steps":["(\u03b8+1)\u00b2"],"edges":["e-e6a7da242cad039d"],"text":"A274496 \u2192 (\u03b8+1)\u00b2"},"headline":"A274496 \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:   0;\n  1:   0;\n  2:   2;\n  3:   4;\n  4:   8,   32;\n  5:  16,   64;\n  6:  24,  192,  216;\n  7:  48,  384,  432;\n  8:  64,  768, 1728, 1024;\n  9: 128, 1536, 3456, 2048;\n","recurrence_sentence":"The row polynomials satisfy (64*n-128+(80*n^2-264*n+208)*x+(56*n^3-312*n^2+580*n-360)*x^2+(12*n^4-74*n^3+150*n^2-108*n+16)*x^3+(n^5-8*n^4+25*n^3-38*n^2+28*n-8)*x^4)*P(n,x) = -(64*n^2-576*n+1024+(136*n^3-1696*n^2+5224*n-4352)*x+(80*n^4-1332*n^3+5696*n^2-8980*n+4992)*x^2+(16*n^5-354*n^4+1780*n^3-3506*n^2+3112*n-1088)*x^3+(n^6-35*n^5+189*n^4-389*n^3+406*n^2-252*n+64)*x^4-(n^6-5*n^5+7*n^4-3*n^3)*x^5)*P(n-1,x) + (32*n-128+(96*n^2-688*n+704)*x+(88*n^3-888*n^2+1464*n-608)*x^2+(24*n^4-292*n^3+76*n^2+1064*n-992)*x^3+(2*n^5-28*n^4-230*n^3+880*n^2-1000*n+416)*x^4-(48*n^4-148*n^3+180*n^2-120*n+32)*x^5-(2*n^5-4*n^4+2*n^3)*x^6)*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 2.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 0;\nP[2, x_] := 2;\nP[n_, x_] := P[n, x] = Expand[Together[(-(64*n^2 - 576*n + 1024 + (136*n^3 - 1696*n^2 + 5224*n - 4352)*x + (80*n^4 - 1332*n^3 + 5696*n^2 - 8980*n + 4992)*x^2 + (16*n^5 - 354*n^4 + 1780*n^3 - 3506*n^2 + 3112*n - 1088)*x^3 + (n^6 - 35*n^5 + 189*n^4 - 389*n^3 + 406*n^2 - 252*n + 64)*x^4 - (n^6 - 5*n^5 + 7*n^4 - 3*n^3)*x^5)*P[n - 1, x] + (32*n - 128 + (96*n^2 - 688*n + 704)*x + (88*n^3 - 888*n^2 + 1464*n - 608)*x^2 + (24*n^4 - 292*n^3 + 76*n^2 + 1064*n - 992)*x^3 + (2*n^5 - 28*n^4 - 230*n^3 + 880*n^2 - 1000*n + 416)*x^4 - (48*n^4 - 148*n^3 + 180*n^2 - 120*n + 32)*x^5 - (2*n^5 - 4*n^4 + 2*n^3)*x^6)*D[P[n - 1, x], x])/(64*n - 128 + (80*n^2 - 264*n + 208)*x + (56*n^3 - 312*n^2 + 580*n - 360)*x^2 + (12*n^4 - 74*n^3 + 150*n^2 - 108*n + 16)*x^3 + (n^5 - 8*n^4 + 25*n^3 - 38*n^2 + 28*n - 8)*x^4)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 0; v[3] = 2; for(n = 3, N, my(i = n + 1); v[i] = (-(64*n^2 - 576*n + 1024 + (136*n^3 - 1696*n^2 + 5224*n - 4352)*x + (80*n^4 - 1332*n^3 + 5696*n^2 - 8980*n + 4992)*x^2 + (16*n^5 - 354*n^4 + 1780*n^3 - 3506*n^2 + 3112*n - 1088)*x^3 + (n^6 - 35*n^5 + 189*n^4 - 389*n^3 + 406*n^2 - 252*n + 64)*x^4 - (n^6 - 5*n^5 + 7*n^4 - 3*n^3)*x^5)*v[i - 1] + (32*n - 128 + (96*n^2 - 688*n + 704)*x + (88*n^3 - 888*n^2 + 1464*n - 608)*x^2 + (24*n^4 - 292*n^3 + 76*n^2 + 1064*n - 992)*x^3 + (2*n^5 - 28*n^4 - 230*n^3 + 880*n^2 - 1000*n + 416)*x^4 - (48*n^4 - 148*n^3 + 180*n^2 - 120*n + 32)*x^5 - (2*n^5 - 4*n^4 + 2*n^3)*x^6)*deriv(v[i - 1], x))/(64*n - 128 + (80*n^2 - 264*n + 208)*x + (56*n^3 - 312*n^2 + 580*n - 360)*x^2 + (12*n^4 - 74*n^3 + 150*n^2 - 108*n + 16)*x^3 + (n^5 - 8*n^4 + 25*n^3 - 38*n^2 + 28*n - 8)*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":["D","(\u03b8+1)\u00b2"],"edges":["e-5c70b541165ff56b","e-6e441004198bccbf"],"text":"A274496 \u2192 D \u2192 (\u03b8+1)\u00b2"},"headline":"A274496 \u2192 D \u2192 (\u03b8+1)\u00b2","chain":null}