{"id":"n-da15dfce718ba206","revision":0,"first_index":0,"fingerprint":"f6-83abbbf5c563f720","name":"reversal of 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"],["1","2"],["1","5","5"],["1","9","21","14"],["1","14","57","86","43"],["1","20","125","320","355","142"],["1","27","240","925","1710","1497","499"],["1","35","420","2275","6230","8967","6475","1850"],["1","44","686","4984","18935","39872","46858","28772","7193"],["1","54","1062","9996","50463","145782","248178","246024","131337","29186"],["1","65","1575","18690","121485","461979","1069005","1522950","1304055","615545","123109"],["1","77","2255","33000","269445","1309539","3955413","7600560","9291975","6997265","2959429","538078"],["1","90","3135","55550","558360","3390354","12992595","32352210","53004600","56678270","38069559","14582130","2430355"],["1","104","4251","89804","1092520","8136414","38721111","121516824","256380696","365397890","346896979","210201576","73564699","11317646"],["1","119","5642","140231","2035033","18302284","106327221","411937383","1088896809","1987797812","2503570069","2135717311","1178439808","379609349","54229907"]],"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:reversal","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["2"]]},"terms":[{"coeff":{"coeffs":[["2","0","6","8"],["0","3","-10","-12"],["0","1","4","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-2","2","22","16"],["0","0","-4","-12","-8"]]},"deriv_order":1,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","0","4","8","4"]]},"deriv_order":2,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":176988,"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-bfe39a542f8e54c9"]},{"id":176989,"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-bfe39a542f8e54c9"]},{"id":176990,"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-bfe39a542f8e54c9"]}],"region_exact":{},"incoming_edges":[{"id":"e-bfe39a542f8e54c9","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-da15dfce718ba206","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":"0947f5c610fc89f66bea44e250984db55bcab6a10d4378a2e8d18f598637e65d","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-6bbd968fe5cbbe11","role":"sequence","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'.","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-008c2c6e2e077374","kind":"candidate_equal","node_a_id":"n-b37fb34e5b5db4ed","node_b_id":"n-da15dfce718ba206","fingerprint":null,"oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"reason":"no all-index equality certificate was found","rows_compared":15},"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-aa1c7b4942b75806","kind":"fingerprint_related","node_a_id":"n-6bbd968fe5cbbe11","node_b_id":"n-da15dfce718ba206","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-6bbd968fe5cbbe11","other":{"id":"n-6bbd968fe5cbbe11","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'.","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"],["2","1"],["5","5","1"]],"card_rows":[["1"],["2","1"],["5","5","1"],["14","21","9","1"]],"row_sums_preview":["1","3","11","45","201","963","4899","26253"],"regions":["(-inf, 0]","(-inf, -1]"],"region_exact":{},"oeis_ids":[],"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}}],"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,  2;\n  2: 1,  5,    5;\n  3: 1,  9,   21,   14;\n  4: 1, 14,   57,   86,    43;\n  5: 1, 20,  125,  320,   355,    142;\n  6: 1, 27,  240,  925,  1710,   1497,    499;\n  7: 1, 35,  420, 2275,  6230,   8967,   6475,   1850;\n  8: 1, 44,  686, 4984, 18935,  39872,  46858,  28772,   7193;\n  9: 1, 54, 1062, 9996, 50463, 145782, 248178, 246024, 131337, 29186;\n","recurrence_sentence":"The row polynomials satisfy 2*P(n,x) = (2+(n^2+3*n)*x+(4*n^2-10*n+6)*x^2+(4*n^2-12*n+8)*x^3)*P(n-1,x) - (2*x+(4*n-2)*x^2+(12*n-22)*x^3+(8*n-16)*x^4)*d/dx P(n-1,x) + (4*x^3+8*x^4+4*x^5)*d^2/dx^2 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[((2 + (n^2 + 3*n)*x + (4*n^2 - 10*n + 6)*x^2 + (4*n^2 - 12*n + 8)*x^3)*P[n - 1, x] - (2*x + (4*n - 2)*x^2 + (12*n - 22)*x^3 + (8*n - 16)*x^4)*D[P[n - 1, x], x] + (4*x^3 + 8*x^4 + 4*x^5)*D[P[n - 1, x], {x, 2}])/(2)]];\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^2 + 3*n)*x + (4*n^2 - 10*n + 6)*x^2 + (4*n^2 - 12*n + 8)*x^3)*v[i - 1] - (2*x + (4*n - 2)*x^2 + (12*n - 22)*x^3 + (8*n - 16)*x^4)*deriv(v[i - 1], x) + (4*x^3 + 8*x^4 + 4*x^5)*deriv(deriv(v[i - 1], x), x))/(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-07e5356ad37f61ea","steps":["x \u21a6 x+1","reverse"],"edges":["e-2fc15f707287930e","e-bfe39a542f8e54c9"],"text":"A100862 \u2192 x \u21a6 x+1 \u2192 reverse"},"headline":"A100862 \u2192 x \u21a6 x+1 \u2192 reverse","chain":null}