{"id":"n-d7a8290cc3936400","revision":0,"first_index":0,"fingerprint":"f6-aee9d583da3df3c2","name":"shift_x_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"],["10","6"],["20","12"],["100","120","36"],["200","240","72"],["1000","1800","1080","216"],["2000","3600","2160","432"],["10000","24000","21600","8640","1296"],["20000","48000","43200","17280","2592"],["100000","300000","360000","216000","64800","7776"],["200000","600000","720000","432000","129600","15552"],["1000000","3600000","5400000","4320000","1944000","466560","46656"],["2000000","7200000","10800000","8640000","3888000","933120","93312"],["10000000","42000000","75600000","75600000","45360000","16329600","3265920","279936"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","2","16","32","256","512","4096","8192","65536","131072","1048576","2097152","16777216","33554432","268435456"],"nonn":true,"definitions":[{"position":0,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","-3"],["3","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-10","-16","-6"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},{"position":1,"source":"derived:basis_map_A007318","source_kind":"derived","equality_edge_id":"e-1396bd047934bc5c","recurrence":{"first_index":0,"initial_polynomials":[["1"],["2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["10","6"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":174377,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-00d580fb395bd7b7"]},{"id":174378,"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-00d580fb395bd7b7","e-75e46525d041a2a4"]},{"id":174379,"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-00d580fb395bd7b7","e-75e46525d041a2a4"]},{"id":174380,"position":3,"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-75e46525d041a2a4"]}],"region_exact":{},"incoming_edges":[{"id":"e-75e46525d041a2a4","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-d7a8290cc3936400","premise_count":1,"theorem":"geometric family P_k = g(t) (a + d t)^k: T(p) = g(t) p(a + d t), so the roots of T(p) are those of g and the points (r - a)/d for the roots r of p (elementary)","lean_route":null,"lean_declarations":[],"certificate_hash":"a741e7aecdbab537f6080bd6bceab035fc200e21bc33beadfe99a2116e1a9471","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]"}]},{"id":"e-1396bd047934bc5c","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-d7a8290cc3936400","premise_count":0,"theorem":"all-index identity Q_n = P_n certified by exact Ore-algebra division and identifying rows (polytool preserver-image certificate of the identity map)","lean_route":null,"lean_declarations":[],"certificate_hash":"711f30c96df37e615a9276886523634980a2538e7980356d414a359b8efc2144","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-00d580fb395bd7b7","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-d7a8290cc3936400","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":null,"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"certificate_hash":"eda2497fb7f0626cc3d1097a3998aa6bf7cd6074e80a436aa326605506d5f04a","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}}],"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-fb6b664599d96ccd","kind":"fingerprint_related","node_a_id":"n-86bc5e5caf1f46e7","node_b_id":"n-d7a8290cc3936400","fingerprint":"f6-aee9d583da3df3c2","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-aee9d583da3df3c2"},"other_id":"n-86bc5e5caf1f46e7","other":{"id":"n-86bc5e5caf1f46e7","name":"shift_x_plus_one of basis_map_A013610 of Triangle read by rows, A007318 rows repeated.","first_index":0,"fingerprint":"f6-aee9d583da3df3c2","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","64","64","512","512"],"regions":["(-inf, -1]","(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-4124f4242e7d4c67","steps":["basis A013610","basis A007318"],"edges":["e-c6857bd156c16708","e-4722a80c7bc02bf1"],"text":"A152198 \u2192 basis A013610 \u2192 basis A007318"},"headline":"A152198 \u2192 basis A013610 \u2192 basis A007318","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:   100,   120,    36;\n  5:   200,   240,    72;\n  6:  1000,  1800,  1080,   216;\n  7:  2000,  3600,  2160,   432;\n  8: 10000, 24000, 21600,  8640, 1296;\n  9: 20000, 48000, 43200, 17280, 2592;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (3*n-1+(3*n-3)*x)*P(n-1,x) - (10+16*x+6*x^2)*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[(3*n - 1 + (3*n - 3)*x)*P[n - 1, x] - (10 + 16*x + 6*x^2)*D[P[n - 1, x], x]];\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] = (3*n - 1 + (3*n - 3)*x)*v[i - 1] - (10 + 16*x + 6*x^2)*deriv(v[i - 1], x)); 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","x \u21a6 x+1"],"edges":["e-4e3482570d7ce009","e-00d580fb395bd7b7"],"text":"A274496 \u2192 basis A013610 \u2192 x \u21a6 x+1"},"headline":"A274496 \u2192 basis A013610 \u2192 x \u21a6 x+1","chain":null}