{"id":"n-14e1070ac70ddf5c","revision":0,"first_index":0,"fingerprint":"f6-d56a20063c562182","name":"shift_x_plus_one of basis_map_A007318 of Triangle read by rows: T(n,k) is the number of ternary 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"],["3"],["15","6"],["45","18"],["225","180","36"],["675","540","108"],["3375","4050","1620","216"],["10125","12150","4860","648"],["50625","81000","48600","12960","1296"],["151875","243000","145800","38880","3888"],["759375","1518750","1215000","486000","97200","7776"],["2278125","4556250","3645000","1458000","291600","23328"],["11390625","27337500","27337500","14580000","4374000","699840","46656"],["34171875","82012500","82012500","43740000","13122000","2099520","139968"],["170859375","478406250","574087500","382725000","153090000","36741600","4898880","279936"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","3","21","63","441","1323","9261","27783","194481","583443","4084101","12252303","85766121","257298363","1801088541"],"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","-2"],["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-10","-14","-4"]]},"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-c6c2f44d9f7e209a","recurrence":{"first_index":0,"initial_polynomials":[["1"],["3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["15","6"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":176197,"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-7cdc9a9e53e9ee18"]},{"id":176198,"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-7cdc9a9e53e9ee18","e-a2280f17163fc981"]},{"id":176199,"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-7cdc9a9e53e9ee18","e-a2280f17163fc981"]},{"id":176200,"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-a2280f17163fc981"]}],"region_exact":{},"incoming_edges":[{"id":"e-a2280f17163fc981","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-14e1070ac70ddf5c","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":"6171c2819d1c691553439c92c266cfd6ad3fc7bb8abd9941bf900509d6c19e48","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-1a86492085c1e21c","role":"sequence","name":"basis_map_A007318 of Triangle read by rows: T(n,k) is the number of ternary 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-c6c2f44d9f7e209a","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-14e1070ac70ddf5c","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":"60981dba99c7179a7057aa50044459129e6ddd2a1415ae86081dc6e8eb5c74e6","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-7cdc9a9e53e9ee18","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-14e1070ac70ddf5c","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":"22d24d4fb013246a9847486cbf8e94fb95b681f76421d0b856d541c561c0f6c1","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-1a86492085c1e21c","role":"sequence","name":"basis_map_A007318 of Triangle read by rows: T(n,k) is the number of ternary 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-b6a57875bfccc41c","kind":"fingerprint_related","node_a_id":"n-2ef7680301a255ec","node_b_id":"n-14e1070ac70ddf5c","fingerprint":"f6-d56a20063c562182","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-d56a20063c562182"},"other_id":"n-2ef7680301a255ec","other":{"id":"n-2ef7680301a255ec","name":"shift_x_plus_one of shift_x_plus_one of Triangle T(n,k) read by rows: number of size-k antisymmetric subsets of {1,2,...,n}.","first_index":0,"fingerprint":"f6-d56a20063c562182","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["1"],["5","2"]],"card_rows":[["1"],["1"],["5","2"],["5","2"]],"row_sums_preview":["1","1","7","7","49","49","343","343"],"regions":["(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-ba3bb18490b15e2e","steps":["basis A007318","x \u21a6 x+1"],"edges":["e-0b9b63070f7f0adc","e-abcab971e5c111b1"],"text":"A188440 \u2192 basis A007318 \u2192 x \u21a6 x+1"},"headline":"A188440 \u2192 basis A007318 \u2192 x \u21a6 x+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:      3;\n  2:     15,      6;\n  3:     45,     18;\n  4:    225,    180,     36;\n  5:    675,    540,    108;\n  6:   3375,   4050,   1620,   216;\n  7:  10125,  12150,   4860,   648;\n  8:  50625,  81000,  48600, 12960, 1296;\n  9: 151875, 243000, 145800, 38880, 3888;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2*n+1+(2*n-2)*x)*P(n-1,x) - (10+14*x+4*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[(2*n + 1 + (2*n - 2)*x)*P[n - 1, x] - (10 + 14*x + 4*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] = (2*n + 1 + (2*n - 2)*x)*v[i - 1] - (10 + 14*x + 4*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-7c641d81e21514ce","steps":["x \u21a6 x+1","x \u21a6 x+1"],"edges":["e-94bbecf72edd8f15","e-7cdc9a9e53e9ee18"],"text":"A274498 \u2192 x \u21a6 x+1 \u2192 x \u21a6 x+1"},"headline":"A274498 \u2192 x \u21a6 x+1 \u2192 x \u21a6 x+1","chain":null}