{"id":"n-47b361d1e904fbeb","revision":2,"first_index":0,"fingerprint":"f6-65206dde5faab998","name":"basis_map_A007318 of Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":2,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["11","14","4"],["41","76","44","8"],["153","372","324","120","16"],["571","1718","1996","1120","304","32"],["2131","7642","11096","8352","3440","736","64"],["7953","33112","57672","54480","30160","9792","1728","128"],["29681","140712","285816","324912","226160","98752","26432","3968","256"],["110771","589098","1367016","1816800","1524304","837536","301504","68608","8960","512"],["413403","2437222","6360444","9676320","9504656","6300000","2854656","873472","172800","19968","1024"],["1542841","9986596","28949204","49609368","55846960","43371776","23717120","9134592","2429184","424960","44032","2048"],["5757961","40594844","129409564","246659560","313101920","278881024","178757376","83099136","27813120","6538240","1025024","96256","4096"],["21489003","163908702","569878740","1195848000","1689879840","1698356160","1249074432","680776704","275021568","81354240","17132544","2433024","208896","8192"],["80198051","658017970","2477922800","5676489920","8838113440","9894303296","8214252672","5138156544","2433826560","868921856","230213632","43900928","5697536","450560","16384"],["299303201","2628559280","10657848400","26465957280","45015553760","55555083904","51396542848","36300354816","19736597760","8261986304","2641565696","633597952","110383104","13189120","966656","32768"],["1117014753","10454825552","45410589360","121503036000","224156016160","302357139840","308482086528","242856348416","149113274112","71652218880","26860021760","7773622272","1703030784","273072128","30228480","2064384","65536"]],"degrees":[2,3,4,5,6,7,8,9,10,11,12,13,14,15,16],"row_sums":["29","169","985","5741","33461","195025","1136689","6625109","38613965","225058681","1311738121","7645370045","44560482149","259717522849","1513744654945"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A007318","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["11","14","4"],["41","76","44","8"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["4","2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},{"position":1,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":"e-cd46c8ba2133c8f0","recurrence":{"first_index":0,"initial_polynomials":[["11","14","4"]],"recurrence":{"denominator":{"coeffs":[["3"],["2"]]},"terms":[{"coeff":{"coeffs":[["7","4"],["4","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["6","8","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":161847,"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-fe32eb1bdf118767"]},{"id":161848,"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-762ccb2ce32a5929","e-fe32eb1bdf118767"]},{"id":161849,"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-762ccb2ce32a5929","e-fe32eb1bdf118767"]},{"id":161850,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-762ccb2ce32a5929","e-fe32eb1bdf118767"]},{"id":161851,"position":4,"claim":"real_rooted","from_index":0,"region_key":"(-3, -1)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-3"},"upper":{"closed":false,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-3, -1)","region_exact":null,"edges":["e-762ccb2ce32a5929"]}],"region_exact":{},"incoming_edges":[{"id":"e-fe32eb1bdf118767","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-47b361d1e904fbeb","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":"80000bb59fe339786dfaa8cd95cb7d32e1316613d38214ba831eead6e7f7d21f","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-8eb9bb3a09f0b7fd","role":"sequence","name":"Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n).","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-cd46c8ba2133c8f0","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-47b361d1e904fbeb","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":"bdaaa109a1e86c6d34aaa5c5aeeb45d3baa7f74e56b79377ef96f21abb1e9067","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-762ccb2ce32a5929","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-47b361d1e904fbeb","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":"885404e9ae3361b75fa82018b65becd4a26822c2269616655f0793f0800a9ec7","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-3"},"upper":{"closed":false,"value":"-1"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-8eb9bb3a09f0b7fd","role":"sequence","name":"Triangle read by rows: T(n,k) number of tilings of a 2n X 3 grid by dominoes, 2k of which are in a vertical position (0<=k<=n).","uses":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-2"},"upper":{"closed":false,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-2, 0)"}]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-650711c8d044af54","kind":"oeis_match","node_a_id":"n-47b361d1e904fbeb","node_b_id":null,"fingerprint":null,"oeis_id":"A001653","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":1,"oeis_term_position":2,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A001653","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A001653","relation":"match_row_sums"}],"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:      11,      14,        4;\n  1:      41,      76,       44,        8;\n  2:     153,     372,      324,      120,       16;\n  3:     571,    1718,     1996,     1120,      304,       32;\n  4:    2131,    7642,    11096,     8352,     3440,      736,       64;\n  5:    7953,   33112,    57672,    54480,    30160,     9792,     1728,     128;\n  6:   29681,  140712,   285816,   324912,   226160,    98752,    26432,    3968,     256;\n  7:  110771,  589098,  1367016,  1816800,  1524304,   837536,   301504,   68608,    8960,    512;\n  8:  413403, 2437222,  6360444,  9676320,  9504656,  6300000,  2854656,  873472,  172800,  19968,  1024;\n  9: 1542841, 9986596, 28949204, 49609368, 55846960, 43371776, 23717120, 9134592, 2429184, 424960, 44032, 2048;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -P(n-2,x) + (4+2*x)*P(n-1,x) for n >= 2, with P(0,x) = 11 + 14*x + 4*x^2, P(1,x) = 41 + 76*x + 44*x^2 + 8*x^3.","mathematica":"P[0, x_] := 11 + 14*x + 4*x^2;\nP[1, x_] := 41 + 76*x + 44*x^2 + 8*x^3;\nP[n_, x_] := P[n, x] = Expand[-P[n - 2, x] + (4 + 2*x)*P[n - 1, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 11 + 14*x + 4*x^2; v[2] = 41 + 76*x + 44*x^2 + 8*x^3; for(n = 2, N, my(i = n + 1); v[i] = -v[i - 2] + (4 + 2*x)*v[i - 1]); 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-8eb9bb3a09f0b7fd","steps":["x \u21a6 x+1"],"edges":["e-762ccb2ce32a5929"],"text":"A123519 \u2192 x \u21a6 x+1"},"headline":"A123519 \u2192 x \u21a6 x+1","chain":null}