{"id":"n-97b51734d39ede6c","revision":3,"first_index":0,"fingerprint":"f6-eccca8d515312e3b","name":"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"],["1","1"],["1","3"],["1","6","3"],["1","10","15"],["1","15","45","15"],["1","21","105","105"],["1","28","210","420","105"],["1","36","378","1260","945"],["1","45","630","3150","4725","945"],["1","55","990","6930","17325","10395"],["1","66","1485","13860","51975","62370","10395"],["1","78","2145","25740","135135","270270","135135"],["1","91","3003","45045","315315","945945","945945","135135"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","2","4","10","26","76","232","764","2620","9496","35696","140152","568504","2390480"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A100861","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-1"],["0","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},{"position":1,"source":"derived:gamma_polynomial","source_kind":"derived","equality_edge_id":"e-6bf151a19679edda","recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","0"],["0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-1"],["0","1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},{"position":2,"source":"derived:reversal","source_kind":"derived","equality_edge_id":"e-9aa46c19266a00bf","recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","-1"],["0","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":158992,"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-037c1a08736a9fd9","e-8187ad69de0e901a","e-a3a653eabafbad6b"]},{"id":158993,"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-037c1a08736a9fd9","e-8187ad69de0e901a","e-a3a653eabafbad6b"]},{"id":158994,"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-037c1a08736a9fd9","e-8187ad69de0e901a","e-a3a653eabafbad6b"]},{"id":158995,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 1","region_exact":null,"edges":["e-8187ad69de0e901a"]}],"region_exact":{},"incoming_edges":[{"id":"e-6bf151a19679edda","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-97b51734d39ede6c","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":"8d62e08c9b1b64357b79f4e624b82a301c29f92870ddbadd8c33d85085aa3945","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-9aa46c19266a00bf","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-97b51734d39ede6c","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":"bc3425d98a81153e76f5ed88b2cd1fc3f27bbc03399e094fab6d983908950276","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-037c1a08736a9fd9","operation":{"index_shift":0,"operation":"gamma_polynomial","scale":"1"},"operation_detail":"scale 1, shift 0","conclusion_id":"n-97b51734d39ede6c","premise_count":1,"theorem":"gamma criterion (RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff): if P = sum_j gamma_j x^j (1 + x)^(d - 2j) with deg Gamma <= d/2, then P is nonzero and real-rooted with roots in (-inf, 0] if and only if Gamma(z) = sum_j gamma_j z^j is; Gamma(c z) with c != 0 has the roots of Gamma divided by c","lean_route":null,"lean_declarations":[],"certificate_hash":"ce49da729642bb1c9d992b199d1c5e4531c3a8efd3c11dbf180327cea22f86e7","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"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-8187ad69de0e901a","operation":{"operation":"parent_provers","route":"paper_theorem"},"operation_detail":"paper_theorem","conclusion_id":"n-97b51734d39ede6c","premise_count":0,"theorem":"polytool parent provers, route paper_theorem: every parent row P_n, n >= 0, is zero or real-rooted with coefficients of one sign","lean_route":null,"lean_declarations":[],"certificate_hash":"e716c9c843543ff8be3be21e3c8c467bf66562c966db7bc2bebd81a196bf4f78","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":"previous_interlaces_next"}],"premises":[]},{"id":"e-a3a653eabafbad6b","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"reversal\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}"},"operation_detail":"reversal, shift 0","conclusion_id":"n-97b51734d39ede6c","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":"reversed","lean_declarations":["RealRooted.X_pow_mul_reverse_eq_zero_or_splits","RealRooted.reflect_eq_zero_or_splits"],"certificate_hash":"1166a1e3664934c7e4aecad018c31854f1bfd5bbafe222e0468aac5b74e7715e","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-f6268da8d9636534","role":"sequence","name":"Exponential Riordan array (1, x(1+x/2)).","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":[{"id":"e-7ff8f7c42dce00d9","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-cb27c40f78048a11","conclusion_name":"basis_map_A008277 of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n)."},{"id":"e-bef9a5250f0c94a4","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-378328f3fde82415","conclusion_name":"basis_map_A013611 of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n)."},{"id":"e-d700e7dd8b41ed69","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-8159f24e9c9fb552","conclusion_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)."},{"id":"e-d718d4a3c4d020a8","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-e5924eef99dd90a5","conclusion_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)."},{"id":"e-ffb008f602bb5117","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-6a6677e3386580cd","conclusion_name":"basis_map_A013609 of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n)."},{"id":"e-01d50252f4aaa594","operation":"preserver_image","operation_detail":"reversal, shift 0","conclusion_id":"n-f6268da8d9636534","conclusion_name":"Exponential Riordan array (1, x(1+x/2))."},{"id":"e-0e3cf0b8dd3f845e","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-68a09e7004d283fc","conclusion_name":"theta_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)."},{"id":"e-11861e18b0a26fda","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-dcfa39142f813dd0","conclusion_name":"one_plus_derivative of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n)."},{"id":"e-409924954694eb46","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-4c77cf1836e24da4","conclusion_name":"derivative of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n)."},{"id":"e-b214721870127413","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-3df88d88faaf70ef","conclusion_name":"theta_plus_one_squared of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n)."},{"id":"e-de232437ce21276e","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-8159f24e9c9fb552","conclusion_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)."}],"used_by_total":11,"links":[{"id":"l-0714e39d6b8e405e","kind":"fingerprint_related","node_a_id":"n-97b51734d39ede6c","node_b_id":"n-f6268da8d9636534","fingerprint":"f6-eccca8d515312e3b","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-eccca8d515312e3b"},"other_id":"n-f6268da8d9636534","other":{"id":"n-f6268da8d9636534","name":"Exponential Riordan array (1, x(1+x/2)).","first_index":0,"fingerprint":"f6-eccca8d515312e3b","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["0","1"],["0","1","1"]],"card_rows":[["1"],["0","1"],["0","1","1"],["0","0","3","1"]],"row_sums_preview":["1","1","2","4","10","26","76","232"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A122848"],"derivation":{"root":"n-97b51734d39ede6c","steps":["reverse"],"edges":["e-01d50252f4aaa594"],"text":"A100861 \u2192 reverse"},"headline":"A122848: Exponential Riordan array (1, x(1+x/2)).","chain":"A100861 \u2192 reverse"}},{"id":"l-a18a3827f7d1361b","kind":"fingerprint_related","node_a_id":"n-97b51734d39ede6c","node_b_id":"n-4c77cf1836e24da4","fingerprint":"f6-eccca8d515312e3b","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-eccca8d515312e3b"},"other_id":"n-4c77cf1836e24da4","other":{"id":"n-4c77cf1836e24da4","name":"derivative of Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).","first_index":0,"fingerprint":"f6-eccca8d515312e3b","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],[],["1"]],"card_rows":[["1"],["3"],["6","6"],["10","30"]],"row_sums_preview":["0","0","1","3","12","40","150","546"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-97b51734d39ede6c","steps":["D"],"edges":["e-409924954694eb46"],"text":"A100861 \u2192 D"},"headline":"A100861 \u2192 D","chain":null}},{"id":"l-1cf8a1aa252a671d","kind":"oeis_match","node_a_id":"n-97b51734d39ede6c","node_b_id":null,"fingerprint":null,"oeis_id":"A000085","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":"A000085","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-662f6ba1e783b3ac","kind":"oeis_match","node_a_id":"n-97b51734d39ede6c","node_b_id":null,"fingerprint":null,"oeis_id":"A100861","in_catalog":1,"target":"triangle","row_alignment":"node_lengths","rows_matched":15,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"node_lengths","rows_matched":15,"target":"triangle","terms_compared":64},"in_catalog":true,"oeis_id":"A100861","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A100861","relation":"identification"},{"oeis_id":"A144299","relation":"identification"},{"oeis_id":"A000085","relation":"match_row_sums"},{"oeis_id":"A100861","relation":"match_triangle"}],"bfiles":[{"node_id":"n-97b51734d39ede6c","oeis_id":"A000085","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":28,"oeis_terms_available":28,"term_count":200,"raw_size":18162},{"node_id":"n-97b51734d39ede6c","oeis_id":"A100861","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":62,"terms_matched":64,"oeis_terms_agreeing":64,"oeis_terms_available":64,"term_count":992,"raw_size":23084}],"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: 1,  1;\n  3: 1,  3;\n  4: 1,  6,   3;\n  5: 1, 10,  15;\n  6: 1, 15,  45,   15;\n  7: 1, 21, 105,  105;\n  8: 1, 28, 210,  420, 105;\n  9: 1, 36, 378, 1260, 945;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = P(n-1,x) + (n-1)*x*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[P[n - 1, x] + (n - 1)*x*P[n - 2, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = v[i - 1] + (n - 1)*x*v[i - 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}},{"oeis_id":"A100861","target":"triangle","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: 1,  1;\n  3: 1,  3;\n  4: 1,  6,   3;\n  5: 1, 10,  15;\n  6: 1, 15,  45,   15;\n  7: 1, 21, 105,  105;\n  8: 1, 28, 210,  420, 105;\n  9: 1, 36, 378, 1260, 945;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = P(n-1,x) + (n-1)*x*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[P[n - 1, x] + (n - 1)*x*P[n - 2, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = v[i - 1] + (n - 1)*x*v[i - 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-97b51734d39ede6c","steps":[],"edges":[],"text":"A100861"},"headline":"A100861: Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).","chain":null}