{"id":"n-5362cadbf99c9107","revision":0,"first_index":1,"fingerprint":"f6-60cb00b823fa13b8","name":"basis_map_A013609 of Triangle read by rows, T(n,k) = Sum_{j=0..n} (-1)^(n-j)*C(-j,-n)*S1(j,k), S1 the Stirling cycle numbers A132393, for n>=0 and 0<=k<=n.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":-1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1","2"],["3","8","4"],["11","36","32","8"],["49","186","224","104","16"],["261","1106","1620","1048","304","32"],["1631","7520","12656","10160","4160","832","64"],["11743","57892","108188","101352","52080","14816","2176","128"],["95901","499394","1013540","1067584","646464","232512","48832","5504","256"],["876809","4780498","10376872","11993456","8235248","3514336","938112","151808","13568","512"],["8877691","50343944","115598268","144141088","109402928","53268096","16957248","3502080","450816","32768","1024"],["98641011","578858228","1394475256","1852948488","1527000080","826393984","301580160","74573184","12291840","1290240","77824","2048"],["1193556233","7218999546","18129912104","25435869976","22462868736","13264440992","5403757568","1537590912","304432128","41029120","3581952","182272","4096"],["15624736141","97085665602","252917540732","371979570504","348554901376","221537577536","98864106176","31513482880","7202021376","1169079296","131349504","9693184","421888","8192"],["220048367319","1400906461760","3770375496936","5780298199312","5702728236816","3861000173888","1861191656896","651979364608","167404100864","31447882752","4265417728","405909504","25665536","966656","16384"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","3","15","87","579","4371","37023","348375","3609987","40881219","502575951","6668132343","94996225635","1446590154387","23452077916959"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013609","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["1","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["3"],["-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","2"],["1","0"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":199552,"position":0,"claim":"real_rooted","from_index":1,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-868ccd3463d01a1b"]},{"id":199553,"position":1,"claim":"one_signed_coefficients","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":1},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 1: the coefficients of P_n have one sign","region_exact":null,"edges":["e-868ccd3463d01a1b"]},{"id":199554,"position":2,"claim":"hadamard_kernel","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":1},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 1, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-868ccd3463d01a1b"]},{"id":199555,"position":3,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2","region_exact":null,"edges":["e-868ccd3463d01a1b"]}],"region_exact":{},"incoming_edges":[{"id":"e-868ccd3463d01a1b","operation":{"map":"A013609","operation":"basis_map"},"operation_detail":"A013609","conclusion_id":"n-5362cadbf99c9107","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":"63681226d8b997b0110f8321bc44757ec617cfe48537cb564bf7e6802cea4e4f","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-cd3918419c5686a8","role":"sequence","name":"Triangle read by rows, T(n,k) = Sum_{j=0..n} (-1)^(n-j)*C(-j,-n)*S1(j,k), S1 the Stirling cycle numbers A132393, for n>=0 and 0<=k<=n.","uses":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 1, 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":1,"oeis_offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1:      1;\n   2:      1,       2;\n   3:      3,       8,        4;\n   4:     11,      36,       32,        8;\n   5:     49,     186,      224,      104,      16;\n   6:    261,    1106,     1620,     1048,     304,      32;\n   7:   1631,    7520,    12656,    10160,    4160,     832,     64;\n   8:  11743,   57892,   108188,   101352,   52080,   14816,   2176,    128;\n   9:  95901,  499394,  1013540,  1067584,  646464,  232512,  48832,   5504,   256;\n  10: 876809, 4780498, 10376872, 11993456, 8235248, 3514336, 938112, 151808, 13568, 512;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n-3)*P(n-2,x) + (n+2*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 1 + 2*x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 1 + 2*x;\nP[n_, x_] := P[n, x] = Expand[-(n - 3)*P[n - 2, x] + (n + 2*x)*P[n - 1, x]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1 + 2*x; for(n = 3, N, my(i = n); v[i] = -(n - 3)*v[i - 2] + (n + 2*x)*v[i - 1]); v};\nrow(n, p) = {my(c = Vecrev(p)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-cd3918419c5686a8","steps":["basis A013609"],"edges":["e-868ccd3463d01a1b"],"text":"A269951 \u2192 basis A013609"},"headline":"A269951 \u2192 basis A013609","chain":null}
