{"id":"n-6bbd968fe5cbbe11","revision":2,"first_index":0,"fingerprint":"f6-83abbbf5c563f720","name":"basis_map_A007318 of Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.","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"],["2","1"],["5","5","1"],["14","21","9","1"],["43","86","57","14","1"],["142","355","320","125","20","1"],["499","1497","1710","925","240","27","1"],["1850","6475","8967","6230","2275","420","35","1"],["7193","28772","46858","39872","18935","4984","686","44","1"],["29186","131337","246024","248178","145782","50463","9996","1062","54","1"],["123109","615545","1304055","1522950","1069005","461979","121485","18690","1575","65","1"],["538078","2959429","6997265","9291975","7600560","3955413","1309539","269445","33000","2255","77","1"],["2430355","14582130","38069559","56678270","53004600","32352210","12992595","3390354","558360","55550","3135","90","1"],["11317646","73564699","210201576","346896979","365397890","256380696","121516824","38721111","8136414","1092520","89804","4251","104","1"],["54229907","379609349","1178439808","2135717311","2503570069","1987797812","1088896809","411937383","106327221","18302284","2035033","140231","5642","119","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","3","11","45","201","963","4899","26253","147345","862083","5238459","32957037","214117209","1433320515","9867008979"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A007318","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["2","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","-1"],["1","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["2","1"]]},"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-0c59df4465220d31","recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["2"]]},"terms":[{"coeff":{"coeffs":[["6","4"],["-3","-2"],["1","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["10","14","2"],["-4","-4","0"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["4","8","4"]]},"deriv_order":2,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":161581,"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-c6b24692a36542e0"]},{"id":161582,"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-2fc15f707287930e","e-c6b24692a36542e0"]},{"id":161583,"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-2fc15f707287930e","e-c6b24692a36542e0"]},{"id":161584,"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-2fc15f707287930e","e-c6b24692a36542e0"]},{"id":161585,"position":4,"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-2fc15f707287930e"]}],"region_exact":{},"incoming_edges":[{"id":"e-c6b24692a36542e0","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-6bbd968fe5cbbe11","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":"66833c8cc6f2cef3f1b15ce422baf486d1c471f246a73ec2ff335be9669b2a4f","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-07e5356ad37f61ea","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.","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-0c59df4465220d31","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-6bbd968fe5cbbe11","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":"83cb635452a248b5dee6a543c4e5bdc90c502d8ea1236db88cd19ec50cf309d0","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-2fc15f707287930e","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-6bbd968fe5cbbe11","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":"43e36051a60e38b1254756eca36f58e0e8e2d5596604cc47f4910d9b619b9c25","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-07e5356ad37f61ea","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.","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-ba01d77038b0ee1b","kind":"fingerprint_related","node_a_id":"n-6bbd968fe5cbbe11","node_b_id":"n-b37fb34e5b5db4ed","fingerprint":"f6-83abbbf5c563f720","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-83abbbf5c563f720"},"other_id":"n-b37fb34e5b5db4ed","other":{"id":"n-b37fb34e5b5db4ed","name":"mobius_x_over_x_plus_one of Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.","first_index":0,"fingerprint":"f6-83abbbf5c563f720","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","2"],["1","5","5"]],"card_rows":[["1"],["1","2"],["1","5","5"],["1","9","21","14"]],"row_sums_preview":["1","3","11","45","201","963","4899","26253"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-07e5356ad37f61ea","steps":["x \u21a6 x/(x+1)"],"edges":["e-16a1260593e0941e"],"text":"A100862 \u2192 x \u21a6 x/(x+1)"},"headline":"A100862 \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-351be482417144d9","kind":"oeis_match","node_a_id":"n-6bbd968fe5cbbe11","node_b_id":null,"fingerprint":null,"oeis_id":"A083886","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":"A083886","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A083886","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-6bbd968fe5cbbe11","oeis_id":"A083886","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":26,"oeis_terms_available":26,"term_count":200,"raw_size":21996}],"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,      1;\n  2:     5,      5,      1;\n  3:    14,     21,      9,      1;\n  4:    43,     86,     57,     14,      1;\n  5:   142,    355,    320,    125,     20,     1;\n  6:   499,   1497,   1710,    925,    240,    27,    1;\n  7:  1850,   6475,   8967,   6230,   2275,   420,   35,    1;\n  8:  7193,  28772,  46858,  39872,  18935,  4984,  686,   44,  1;\n  9: 29186, 131337, 246024, 248178, 145782, 50463, 9996, 1062, 54, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (n-1+(n-1)*x)*P(n-2,x) + (2+x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + x;\nP[n_, x_] := P[n, x] = Expand[(n - 1 + (n - 1)*x)*P[n - 2, x] + (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] = 1; v[2] = 2 + x; for(n = 2, N, my(i = n + 1); v[i] = (n - 1 + (n - 1)*x)*v[i - 2] + (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-07e5356ad37f61ea","steps":["x \u21a6 x+1"],"edges":["e-2fc15f707287930e"],"text":"A100862 \u2192 x \u21a6 x+1"},"headline":"A100862 \u2192 x \u21a6 x+1","chain":null}