{"id":"n-07af2e6e3c9f0c77","revision":2,"first_index":0,"fingerprint":"f6-ca6d936c14642db2","name":"basis_map_A007318 of Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["3","2"],["11","15","5"],["45","93","63","14"],["197","546","560","252","42"],["903","3140","4320","2940","990","132"],["4279","17901","30915","28215","14355","3861","429"],["20793","101675","211365","242165","165165","67067","15015","1430"],["103049","576708","1402016","1933932","1655654","900900","304304","58344","4862"],["518859","3270438","9103536","14688492","15140034","10339056","4678128","1352520","226746","16796"],["2646723","18553275","58188585","107526510","129653160","106594488","60518640","23430420","5920590","881790","58786"],["13648869","105324681","367494435","765316860","1056991320","1016590344","694796256","337463940","114157890","25617130","3432198","208012"],["71039373","598407750","2299160160","5327906760","8293857660","9137235888","7305252240","4270848120","1812136590","544248540","109830336","13372200","742900"],["372693519","3402883848","14275737216","36435419592","63121702644","78385689096","71786574288","49091516760","25069264506","9442140136","2549632800","467432680","52151580","2674440"],["1968801519","19367988633","88091707431","245538217197","468563894799","647614352385","668552103219","523691390079","312798513027","141775518885","48002149195","11773219185","1977414075","203591745","9694845"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","31","215","1597","12425","99955","824675","6939769","59334605","513972967","4501041935","39784038517","354455513105","3179928556219"],"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","2"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["1"],["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","2"],["6","4"]]},"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-8f2f1dc6ded97c3f","recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["6","4"],["3","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["4","6","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":161735,"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-e0b14bd13b542826"]},{"id":161736,"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-190c283dd8b47413","e-e0b14bd13b542826"]},{"id":161737,"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-190c283dd8b47413","e-e0b14bd13b542826"]},{"id":161738,"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-190c283dd8b47413","e-e0b14bd13b542826"]},{"id":161739,"position":4,"claim":"real_rooted","from_index":0,"region_key":"(-2, -1)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-2"},"upper":{"closed":false,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-2, -1)","region_exact":null,"edges":["e-190c283dd8b47413"]}],"region_exact":{},"incoming_edges":[{"id":"e-e0b14bd13b542826","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-07af2e6e3c9f0c77","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":"28e31c85f689af7e6e9e40bcd209bbbbeb6ae38650c253386ab0705e0a39a432","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-66e2c3448245b0b7","role":"sequence","name":"Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.","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-8f2f1dc6ded97c3f","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-07af2e6e3c9f0c77","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":"b089aca3fd081d8b91c083abfd4e9a2bfa25e698dd5b36fb4b309c4526136e60","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-190c283dd8b47413","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-07af2e6e3c9f0c77","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":"56c12d7a25b3914b4b58dc2448bab231c1513d4f83fa6d4dbc595b57363b8aa2","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-2"},"upper":{"closed":false,"value":"-1"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-66e2c3448245b0b7","role":"sequence","name":"Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.","uses":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-1"},"upper":{"closed":false,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-1, 0)"}]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-ed5441e8f99f3414","kind":"fingerprint_related","node_a_id":"n-07af2e6e3c9f0c77","node_b_id":"n-ff3f26cc45b3d80a","fingerprint":"f6-ca6d936c14642db2","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-ca6d936c14642db2"},"other_id":"n-ff3f26cc45b3d80a","other":{"id":"n-ff3f26cc45b3d80a","name":"mobius_x_over_x_plus_one of Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks at level one (n >= 1; 0 <= k <= n-1).","first_index":0,"fingerprint":"f6-ca6d936c14642db2","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","3"],["5","15","11"]],"card_rows":[["1"],["2","3"],["5","15","11"],["14","63","93","45"]],"row_sums_preview":["1","5","31","215","1597","12425","99955","824675"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-57b4b14604f4c0d7","steps":["x \u21a6 x/(x+1)"],"edges":["e-38a5f21f7e3f9e41"],"text":"A126216 \u2192 x \u21a6 x/(x+1)"},"headline":"A126216 \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-98975f62061ab695","kind":"oeis_match","node_a_id":"n-07af2e6e3c9f0c77","node_b_id":null,"fingerprint":null,"oeis_id":"A269730","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":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A269730","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A269730","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-07af2e6e3c9f0c77","oeis_id":"A269730","target":"row_sums","oeis_offset":1,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":23,"oeis_terms_available":23,"term_count":200,"raw_size":20321}],"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,       2;\n  2:     11,      15,       5;\n  3:     45,      93,      63,       14;\n  4:    197,     546,     560,      252,       42;\n  5:    903,    3140,    4320,     2940,      990,      132;\n  6:   4279,   17901,   30915,    28215,    14355,     3861,     429;\n  7:  20793,  101675,  211365,   242165,   165165,    67067,   15015,    1430;\n  8: 103049,  576708, 1402016,  1933932,  1655654,   900900,  304304,   58344,   4862;\n  9: 518859, 3270438, 9103536, 14688492, 15140034, 10339056, 4678128, 1352520, 226746, 16796;\n","recurrence_sentence":"The row polynomials satisfy (n+2)*P(n,x) = -(n-1)*P(n-2,x) + (6*n+3+(4*n+2)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 2*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3 + 2*x;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n - 1)*P[n - 2, x] + (6*n + 3 + (4*n + 2)*x)*P[n - 1, x])/(n + 2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 3 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n - 1)*v[i - 2] + (6*n + 3 + (4*n + 2)*x)*v[i - 1])/(n + 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-66e2c3448245b0b7","steps":["x \u21a6 x+1"],"edges":["e-190c283dd8b47413"],"text":"A033282 \u2192 x \u21a6 x+1"},"headline":"A033282 \u2192 x \u21a6 x+1","chain":null}