{"id":"n-1a86492085c1e21c","revision":2,"first_index":0,"fingerprint":"f6-e309ee14657f718e","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).","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"],["9","6"],["27","18"],["81","108","36"],["243","324","108"],["729","1458","972","216"],["2187","4374","2916","648"],["6561","17496","17496","7776","1296"],["19683","52488","52488","23328","3888"],["59049","196830","262440","174960","58320","7776"],["177147","590490","787320","524880","174960","23328"],["531441","2125764","3542940","3149280","1574640","419904","46656"],["1594323","6377292","10628820","9447840","4723920","1259712","139968"],["4782969","22320522","44641044","49601160","33067440","13226976","2939328","279936"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","3","15","45","225","675","3375","10125","50625","151875","759375","2278125","11390625","34171875","170859375"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A007318","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["9","6"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},{"position":1,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":"e-98d5ec9577026c22","recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["3","-2"],["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-6","-4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":161586,"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-f41ab3c7deb8e5d8"]},{"id":161587,"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-94bbecf72edd8f15","e-f41ab3c7deb8e5d8"]},{"id":161588,"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-94bbecf72edd8f15","e-f41ab3c7deb8e5d8"]},{"id":161589,"position":3,"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-94bbecf72edd8f15"]}],"region_exact":{},"incoming_edges":[{"id":"e-f41ab3c7deb8e5d8","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-1a86492085c1e21c","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":"396af2a2c891ea7898c6a968e268161f159f29ef8367438cc2c86d6405c332a0","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-7c641d81e21514ce","role":"sequence","name":"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-98d5ec9577026c22","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-1a86492085c1e21c","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":"c5c641473868a3550320bd2d17f4bbc4c49f6ffabfe9c5cad546919219ea396f","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-94bbecf72edd8f15","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-1a86492085c1e21c","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":"4f5f927d92c1f07806534228e680e96e0e603c02a688c0c0d434641636ce49e0","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-7c641d81e21514ce","role":"sequence","name":"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-83e94f5982190ef9","kind":"fingerprint_related","node_a_id":"n-4e8690098ee9d7b4","node_b_id":"n-1a86492085c1e21c","fingerprint":"f6-e309ee14657f718e","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-e309ee14657f718e"},"other_id":"n-4e8690098ee9d7b4","other":{"id":"n-4e8690098ee9d7b4","name":"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-e309ee14657f718e","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["1"],["3","2"]],"card_rows":[["1"],["1"],["3","2"],["3","2"]],"row_sums_preview":["1","1","5","5","25","25","125","125"],"regions":["(-inf, -1]","(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-ba3bb18490b15e2e","steps":["basis A007318"],"edges":["e-0b9b63070f7f0adc"],"text":"A188440 \u2192 basis A007318"},"headline":"A188440 \u2192 basis A007318","chain":null}},{"id":"l-b766d2348fa2301b","kind":"fingerprint_related","node_a_id":"n-1a86492085c1e21c","node_b_id":"n-6b39163848c2036c","fingerprint":"f6-e309ee14657f718e","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-e309ee14657f718e"},"other_id":"n-6b39163848c2036c","other":{"id":"n-6b39163848c2036c","name":"basis_map_A013610 of Triangle read by rows, A007318 rows repeated.","first_index":0,"fingerprint":"f6-e309ee14657f718e","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["1"],["2","3"]],"card_rows":[["1"],["1"],["2","3"],["2","3"]],"row_sums_preview":["1","1","5","5","25","25","125","125"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-4124f4242e7d4c67","steps":["basis A013610"],"edges":["e-c6857bd156c16708"],"text":"A152198 \u2192 basis A013610"},"headline":"A152198 \u2192 basis A013610","chain":null}},{"id":"l-ff8b4bf95a6bcce3","kind":"fingerprint_related","node_a_id":"n-1a86492085c1e21c","node_b_id":"n-a9e3a6c6145e13ca","fingerprint":"f6-e309ee14657f718e","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-e309ee14657f718e"},"other_id":"n-a9e3a6c6145e13ca","other":{"id":"n-a9e3a6c6145e13ca","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).","first_index":0,"fingerprint":"f6-e309ee14657f718e","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["2"],["4","6"]],"card_rows":[["1"],["2"],["4","6"],["8","12"]],"row_sums_preview":["1","2","10","20","100","200","1000","2000"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b6aca576a689e9f0","steps":["basis A013610"],"edges":["e-4e3482570d7ce009"],"text":"A274496 \u2192 basis A013610"},"headline":"A274496 \u2192 basis A013610","chain":null}},{"id":"l-931b4b5c24462337","kind":"oeis_match","node_a_id":"n-1a86492085c1e21c","node_b_id":null,"fingerprint":null,"oeis_id":"A100747","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A100747","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A100747","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-1a86492085c1e21c","oeis_id":"A100747","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":27,"oeis_terms_available":27,"term_count":200,"raw_size":12680}],"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:     9,     6;\n  3:    27,    18;\n  4:    81,   108,    36;\n  5:   243,   324,   108;\n  6:   729,  1458,   972,   216;\n  7:  2187,  4374,  2916,   648;\n  8:  6561, 17496, 17496,  7776, 1296;\n  9: 19683, 52488, 52488, 23328, 3888;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (9+6*x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3;\nP[n_, x_] := P[n, x] = Expand[(9 + 6*x)*P[n - 2, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 3; for(n = 2, N, my(i = n + 1); v[i] = (9 + 6*x)*v[i - 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-7c641d81e21514ce","steps":["x \u21a6 x+1"],"edges":["e-94bbecf72edd8f15"],"text":"A274498 \u2192 x \u21a6 x+1"},"headline":"A274498 \u2192 x \u21a6 x+1","chain":null}