{"id":"n-00447aedf6d1c69b","revision":0,"first_index":0,"fingerprint":"f6-1e01e0fee2e89b30","name":"one_plus_derivative 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"],["10","6"],["20","12"],["64","120","36"],["128","240","72"],["352","1152","1080","216"],["704","2304","2160","432"],["1792","8448","13824","8640","1296"],["3584","16896","27648","17280","2592"],["8704","53760","126720","138240","64800","7776"],["17408","107520","253440","276480","129600","15552"],["40960","313344","967680","1520640","1244160","466560","46656"],["81920","626688","1935360","3041280","2488320","933120","93312"],["188416","1720320","6580224","13547520","15966720","10450944","3265920","279936"]],"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:one_plus_derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-26","-42","36"],["-3","36","0"],["9","0","0"]]},"terms":[{"coeff":{"coeffs":[["8","-96","90","-108"],["-102","93","-126","108"],["54","-36","108","0"],["0","27","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-16","-136","-288","-324","-216"],["-48","-132","-234","-216","0"],["0","-36","-54","0","0"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":174371,"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-ae39bd62e7fd010f"]},{"id":174372,"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-ae39bd62e7fd010f"]},{"id":174373,"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-ae39bd62e7fd010f"]}],"region_exact":{},"incoming_edges":[{"id":"e-ae39bd62e7fd010f","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"derivative_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-00447aedf6d1c69b","premise_count":1,"theorem":"Laguerre's theorem on differential operators: if phi is a real polynomial with only real roots, then phi(D) maps every real-rooted polynomial to a real-rooted polynomial or zero (write phi(D) = C D^j prod (1 + c_i D); D preserves real-rootedness by Rolle's theorem and p + c p' is real-rooted for every real c by Rolle's theorem applied to e^(x/c) p; Polya--Schur 1914); when the coefficients of phi have one sign, coefficients of one sign stay of one sign; applied to phi(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.splits_add_C_mul_derivative_all","RealRooted.splits_C_mul_add_derivative","Polynomial.Splits.derivative"],"certificate_hash":"3d7575455b920b77e1e5fd775143da4338a458ccd38fc8c6d30068a40a526cdd","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-b3a3833cb9ed7238","kind":"fingerprint_related","node_a_id":"n-f97899e6ddb309b6","node_b_id":"n-00447aedf6d1c69b","fingerprint":"f6-1e01e0fee2e89b30","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-1e01e0fee2e89b30"},"other_id":"n-f97899e6ddb309b6","other":{"id":"n-f97899e6ddb309b6","name":"one_plus_derivative of basis_map_A013610 of Triangle read by rows, A007318 rows repeated.","first_index":0,"fingerprint":"f6-1e01e0fee2e89b30","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["1"],["5","3"]],"card_rows":[["1"],["1"],["5","3"],["5","3"]],"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","D+1"],"edges":["e-c6857bd156c16708","e-e207383da831d5bb"],"text":"A152198 \u2192 basis A013610 \u2192 D+1"},"headline":"A152198 \u2192 basis A013610 \u2192 D+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:   10,     6;\n  3:   20,    12;\n  4:   64,   120,    36;\n  5:  128,   240,    72;\n  6:  352,  1152,  1080,   216;\n  7:  704,  2304,  2160,   432;\n  8: 1792,  8448, 13824,  8640, 1296;\n  9: 3584, 16896, 27648, 17280, 2592;\n","recurrence_sentence":"The row polynomials satisfy (9*n^2-3*n-26+(36*n-42)*x+36*x^2)*P(n,x) = (54*n^2-102*n+8+(27*n^3-36*n^2+93*n-96)*x+(108*n^2-126*n+90)*x^2+(108*n-108)*x^3)*P(n-1,x) - (48*n+16+(36*n^2+132*n+136)*x+(54*n^2+234*n+288)*x^2+(216*n+324)*x^3+216*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[((54*n^2 - 102*n + 8 + (27*n^3 - 36*n^2 + 93*n - 96)*x + (108*n^2 - 126*n + 90)*x^2 + (108*n - 108)*x^3)*P[n - 1, x] - (48*n + 16 + (36*n^2 + 132*n + 136)*x + (54*n^2 + 234*n + 288)*x^2 + (216*n + 324)*x^3 + 216*x^4)*D[P[n - 1, x], x])/(9*n^2 - 3*n - 26 + (36*n - 42)*x + 36*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] = ((54*n^2 - 102*n + 8 + (27*n^3 - 36*n^2 + 93*n - 96)*x + (108*n^2 - 126*n + 90)*x^2 + (108*n - 108)*x^3)*v[i - 1] - (48*n + 16 + (36*n^2 + 132*n + 136)*x + (54*n^2 + 234*n + 288)*x^2 + (216*n + 324)*x^3 + 216*x^4)*deriv(v[i - 1], x))/(9*n^2 - 3*n - 26 + (36*n - 42)*x + 36*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","D+1"],"edges":["e-4e3482570d7ce009","e-ae39bd62e7fd010f"],"text":"A274496 \u2192 basis A013610 \u2192 D+1"},"headline":"A274496 \u2192 basis A013610 \u2192 D+1","chain":null}