{"id":"n-98e164af94aad52d","revision":0,"first_index":0,"fingerprint":"f6-98f5de0f25da5386","name":"shift_x_plus_one of shift_x_plus_one 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"],["3","1"],["7","3"],["25","18","3"],["81","70","15"],["331","375","135","15"],["1303","1701","735","105"],["5937","9268","5250","1260","105"],["26785","46908","30618","8820","945"],["133651","267165","208530","78750","14175","945"],["669351","1473175","1289970","561330","121275","10395"],["3609673","8820966","8816445","4587660","1299375","187110","10395"],["19674097","52209378","57453825","33539220","10945935","1891890","135135"],["113525595","328480243","401353953","267432165","104369265","23648625","2837835","135135"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","4","10","46","166","856","3844","21820","114076","703216","4125496","27331624","175849480","1241782816"],"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":{"terms":[{"coeff":{"coeffs":[["-1","-1"],["2","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-8","-8","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":174181,"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-6855597ed29b7ff8"]},{"id":174182,"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-6855597ed29b7ff8"]},{"id":174183,"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-6855597ed29b7ff8"]}],"region_exact":{},"incoming_edges":[{"id":"e-6855597ed29b7ff8","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-98e164af94aad52d","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":"2246faddb4e91a32e4fec63f59e89615a34d764d6ecf46bec844be351fa38253","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-8159f24e9c9fb552","role":"sequence","name":"shift_x_plus_one 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:     3,     1;\n  3:     7,     3;\n  4:    25,    18,     3;\n  5:    81,    70,    15;\n  6:   331,   375,   135,   15;\n  7:  1303,  1701,   735,  105;\n  8:  5937,  9268,  5250, 1260, 105;\n  9: 26785, 46908, 30618, 8820, 945;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2*n-1+(n-1)*x)*P(n-1,x) - (8+8*x+2*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[(2*n - 1 + (n - 1)*x)*P[n - 1, x] - (8 + 8*x + 2*x^2)*D[P[n - 1, x], x]];\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] = (2*n - 1 + (n - 1)*x)*v[i - 1] - (8 + 8*x + 2*x^2)*deriv(v[i - 1], x)); 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 A007318","x \u21a6 x+1"],"edges":["e-d700e7dd8b41ed69","e-6855597ed29b7ff8"],"text":"A100861 \u2192 basis A007318 \u2192 x \u21a6 x+1"},"headline":"A100861 \u2192 basis A007318 \u2192 x \u21a6 x+1","chain":null}