{"id":"n-74ec83953eae1292","revision":0,"first_index":0,"fingerprint":"f6-ff1dc72e140f0934","name":"basis_map_A013610 of Riordan array (1, x/(1-3*x+2*x^2)).","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","3"],["4","15","9"],["14","66","81","27"],["48","276","504","351","81"],["164","1116","2682","2862","1377","243"],["560","4404","13068","18792","13932","5103","729"],["1912","17064","60120","108648","109350","61722","18225","2187"],["6528","65184","265536","577368","735480","564732","256608","63423","6561"],["22288","246192","1137456","2888784","4455324","4341924","2684178","1019142","216513","19683"],["76096","921264","4757328","13812768","25016688","29604204","23249268","12002256","3910356","728271","59049"],["259808","3420960","19518192","63745488","132594408","184783032","176441328","115718544","51215166","14604786","2421009","177147"],["887040","12620736","78820992","285910992","671580720","1077706944","1213615872","968193648","544195584","210608100","53380296","7971615","531441"],["3028544","46302144","314109792","1252615968","3278867040","5956003872","7734701664","7282185120","4978932948","2445809580","840503466","191673054","26040609","1594323"],["10340096","169052736","1237703616","5380971264","15530154624","31505202720","46379586528","50396458176","40673895984","24298820964","10592682012","3272259384","678118716","84499119","4782969"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","28","188","1260","8444","56588","379228","2541420","17031484","114137548","764899868","5126023980","34352368124","230214528908"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A013610","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1","3"],["4","15","9"]],"recurrence":{"denominator":{"coeffs":[["-2"],["1"]]},"terms":[{"coeff":{"coeffs":[["4"],["-2"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-8","-6"],["4","3"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":201938,"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-bce77ed0b34406cb"]},{"id":201939,"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-bce77ed0b34406cb"]},{"id":201940,"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-bce77ed0b34406cb"]},{"id":201941,"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-bce77ed0b34406cb"]}],"region_exact":{},"incoming_edges":[{"id":"e-bce77ed0b34406cb","operation":{"map":"A013610","operation":"basis_map"},"operation_detail":"A013610","conclusion_id":"n-74ec83953eae1292","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":"28469feea5353c2c988cf927398f8ccd2250c384a0b811627402681a97255a06","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-d7abbe24afd98bff","role":"sequence","name":"Riordan array (1, x/(1-3*x+2*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":[],"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,      3;\n  2:     4,     15,       9;\n  3:    14,     66,      81,      27;\n  4:    48,    276,     504,     351,      81;\n  5:   164,   1116,    2682,    2862,    1377,     243;\n  6:   560,   4404,   13068,   18792,   13932,    5103,     729;\n  7:  1912,  17064,   60120,  108648,  109350,   61722,   18225,    2187;\n  8:  6528,  65184,  265536,  577368,  735480,  564732,  256608,   63423,   6561;\n  9: 22288, 246192, 1137456, 2888784, 4455324, 4341924, 2684178, 1019142, 216513, 19683;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = -(2*n-4)*P(n-2,x) + (4*n-8+(3*n-6)*x)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1 + 3*x, P(2,x) = 4 + 15*x + 9*x^2.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1 + 3*x;\nP[2, x_] := 4 + 15*x + 9*x^2;\nP[n_, x_] := P[n, x] = Expand[Together[(-(2*n - 4)*P[n - 2, x] + (4*n - 8 + (3*n - 6)*x)*P[n - 1, x])/(n - 2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + 3*x; v[3] = 4 + 15*x + 9*x^2; for(n = 3, N, my(i = n + 1); v[i] = (-(2*n - 4)*v[i - 2] + (4*n - 8 + (3*n - 6)*x)*v[i - 1])/(n - 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-d7abbe24afd98bff","steps":["basis A013610"],"edges":["e-bce77ed0b34406cb"],"text":"A206306 \u2192 basis A013610"},"headline":"A206306 \u2192 basis A013610","chain":null}
