{"id":"n-62c21d7097227e9f","revision":0,"first_index":0,"fingerprint":"f6-ca873dd047c5050a","name":"shift_x_plus_one of basis_map_A013610 of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).","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":false,"rows":[["1"],["1"],["5","3"],["13","9"],["73","90","27"],["281","390","135"],["1741","3285","2025","405"],["8485","17703","12285","2835"],["57233","146244","137970","56700","8505"],["328753","916380","955962","442260","76545"],["2389141","7726455","9871470","6208650","1913625","229635"],["15539261","54244245","75601350","52577910","18243225","2525985"],["120661465","473049918","764919045","651517020","307328175","75779550","7577955"],["866545993","3636187074","6346576665","5896905300","3075807735","853782930","98513415"],["7140942173","32940579945","64571313807","69607633095","44466036615","16780118355","3447969525","295540245"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","8","22","190","806","7456","41308","406652","2719900","28338976","218731976","2400833128","20774319112","239250133760"],"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":{"denominator":{"coeffs":[["3"]]},"terms":[{"coeff":{"coeffs":[["-9","-9"],["12","9"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-32","-48","-18"]]},"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-ba776593a5d483a1","recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-4","-3"],["4","3"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":176488,"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-6364ebbb017f26b9"]},{"id":176489,"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-6364ebbb017f26b9","e-eb37f00faa27b33b"]},{"id":176490,"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-6364ebbb017f26b9","e-eb37f00faa27b33b"]},{"id":176491,"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-eb37f00faa27b33b"]},{"id":176492,"position":4,"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-eb37f00faa27b33b"]}],"region_exact":{},"incoming_edges":[{"id":"e-eb37f00faa27b33b","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-62c21d7097227e9f","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":"3220cbe8675fab9bc695259290003fbcff23e5f94ee38cbf7e468f68f77f2682","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-e5924eef99dd90a5","role":"sequence","name":"basis_map_A013610 of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph 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-ba776593a5d483a1","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-62c21d7097227e9f","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":"e621e8ab65e1ef8eb6692254e6882c783e67ad34e4167c8ae0d3a02810a09603","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-6364ebbb017f26b9","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-62c21d7097227e9f","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":"e0d7230542f693facce7db02f9f993fa94e33e294a2cd3a049dd3fbefc598fe0","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-e5924eef99dd90a5","role":"sequence","name":"basis_map_A013610 of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph 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]"}]}],"used_by":[],"used_by_total":0,"links":[],"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:      1;\n  2:      5,      3;\n  3:     13,      9;\n  4:     73,     90,     27;\n  5:    281,    390,    135;\n  6:   1741,   3285,   2025,    405;\n  7:   8485,  17703,  12285,   2835;\n  8:  57233, 146244, 137970,  56700,  8505;\n  9: 328753, 916380, 955962, 442260, 76545;\n","recurrence_sentence":"The row polynomials satisfy 3*P(n,x) = (12*n-9+(9*n-9)*x)*P(n-1,x) - (32+48*x+18*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[Together[((12*n - 9 + (9*n - 9)*x)*P[n - 1, x] - (32 + 48*x + 18*x^2)*D[P[n - 1, x], x])/(3)]];\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] = ((12*n - 9 + (9*n - 9)*x)*v[i - 1] - (32 + 48*x + 18*x^2)*deriv(v[i - 1], x))/(3)); 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-97b51734d39ede6c","steps":["basis A013610","x \u21a6 x+1"],"edges":["e-d718d4a3c4d020a8","e-6364ebbb017f26b9"],"text":"A100861 \u2192 basis A013610 \u2192 x \u21a6 x+1"},"headline":"A100861 \u2192 basis A013610 \u2192 x \u21a6 x+1","chain":null}