{"id":"n-bab8f81b674979eb","revision":0,"first_index":0,"fingerprint":"f6-803a5d83f859558a","name":"shift_x_plus_one of Triangular array of the number of binary, rooted, leaf-labeled tree topologies with n leaves and k cherries, n >= 2, 1 <= k <= floor(n/2).","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"],["3"],["15","3"],["105","45"],["945","630","45"],["10395","9450","1575"],["135135","155925","42525","1575"],["2027025","2837835","1091475","99225"],["34459425","56756700","28378350","4365900","99225"],["654729075","1240539300","766215450","170270100","9823275"],["13749310575","29462808375","21709437750","6385128750","638512875","9823275"],["316234143225","756212081625","648181784250","238803815250","35118208125","1404728325"],["7905853580625","20871453452850","20417726203875","9074544979500","1791028614375","126425549250","1404728325"],["213458046676875","616656579288750","678322237217625","353907254200500","88476813550125","9313348794750","273922023375"],["6190283353629375","19424682247595625","23741278302616875","14244766981570125","4335363863956125","619337694850875","32596720781625","273922023375"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","3","18","150","1620","21420","335160","6055560","124059600","2841577200","71955021600","1995954760800","60188437108800","1960408201752000","68588583087024000"],"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":[["0","-2","-2"]]},"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-5344783b25882878","recurrence":{"first_index":0,"initial_polynomials":[["1"],["3"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","-1"],["0","0"],["0","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1"],["2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":184706,"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-52051dbfe7e31a47"]},{"id":184707,"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-52051dbfe7e31a47","e-b66d3a1eda18e07c"]},{"id":184708,"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-52051dbfe7e31a47","e-b66d3a1eda18e07c"]},{"id":184709,"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-b66d3a1eda18e07c"]},{"id":184710,"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-b66d3a1eda18e07c"]}],"region_exact":{},"incoming_edges":[{"id":"e-b66d3a1eda18e07c","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-bab8f81b674979eb","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":"678ad1b34cb8791cbad761e0614ed72004b82073599ad8d7bfe48722778ee21a","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-3951e6b9a140d595","role":"sequence","name":"Triangular array of the number of binary, rooted, leaf-labeled tree topologies with n leaves and k cherries, n >= 2, 1 <= k <= floor(n/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]"}]},{"id":"e-5344783b25882878","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-bab8f81b674979eb","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":"57aae9094050a2b913aed383aeb2cda706be6df401c237d1edb0f5a0fe7a8166","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-52051dbfe7e31a47","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-bab8f81b674979eb","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":"d1058699c1332bf04617b051f4e9c611a283e325f7adcae5f82125a132fd8570","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-3951e6b9a140d595","role":"sequence","name":"Triangular array of the number of binary, rooted, leaf-labeled tree topologies with n leaves and k cherries, n >= 2, 1 <= k <= floor(n/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":[],"used_by_total":0,"links":[{"id":"l-88549507e11ac6f1","kind":"fingerprint_related","node_a_id":"n-11c80474068b8d4c","node_b_id":"n-bab8f81b674979eb","fingerprint":"f6-803a5d83f859558a","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-803a5d83f859558a"},"other_id":"n-11c80474068b8d4c","other":{"id":"n-11c80474068b8d4c","name":"derivative of Triangle of coefficients of Legendre polynomials 2^n P_n (x).","first_index":0,"fingerprint":"f6-803a5d83f859558a","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],[],["2"]],"card_rows":[["2"],["12"],["60","12"],["280","120"]],"row_sums_preview":["0","0","2","12","72","400","2160","11424"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b2f14d9f44a39df2","steps":["D"],"edges":["e-e9199417d7093add"],"text":"A008556 \u2192 D"},"headline":"A008556 \u2192 D","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:         3;\n  2:        15,          3;\n  3:       105,         45;\n  4:       945,        630,        45;\n  5:     10395,       9450,      1575;\n  6:    135135,     155925,     42525,      1575;\n  7:   2027025,    2837835,   1091475,     99225;\n  8:  34459425,   56756700,  28378350,   4365900,   99225;\n  9: 654729075, 1240539300, 766215450, 170270100, 9823275;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2*n+1+(n-1)*x)*P(n-1,x) - (2*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] - (2*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] - (2*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-3951e6b9a140d595","steps":["x \u21a6 x+1"],"edges":["e-52051dbfe7e31a47"],"text":"A306364 \u2192 x \u21a6 x+1"},"headline":"A306364 \u2192 x \u21a6 x+1","chain":null}