{"id":"n-505fa69e524feade","revision":1,"first_index":1,"fingerprint":"f6-a2e2bf0142c1e4e9","name":"basis_map_A008277 of Triangle read by rows: T(n,k) is the number of double rise-bicolored Dyck paths (double rises come in two colors; also called marked Dyck paths) of semilength n and having k peaks (1 <= 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"],["3","1"],["11","9","1"],["45","67","18","1"],["197","475","225","30","1"],["903","3321","2440","565","45","1"],["4279","23177","24661","8680","1190","63","1"],["20793","162247","239694","119301","24570","2226","84","1"],["103049","1141623","2276737","1532034","440055","59430","3822","108","1"],["518859","8080693","21327180","18821965","7197939","1343559","128100","6150","135","1"],["2646723","57550141","198112981","224378220","110690140","27233745","3565947","252780","9405","165","1"],["13648869","412359707","1831336826","2619022461","1629202080","511525960","87661728","8493507","465135","13805","198","1"],["71039373","2971879027","16884620545","30113812014","23221968341","9089343120","1972690720","248840592","18557682","808665","19591","234","1"],["372693519","21536318961","155505090832","342515518709","323130248441","154919802037","41578824144","6604716976","638660022","37787750","1341340","27027","273","1"],["1968801519","156871538961","1432108338389","3865268439760","4414657645762","2557306827075","833642758949","162777512040","19734316030","1509049542","72558486","2138500","36400","315","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","21","131","928","7275","62051","568916","5556859","57424581","624440248","7113730277","84593579905","1046841030032","13445919961729"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A008277","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["3","1"]],"recurrence":{"denominator":{"coeffs":[["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["2","-2","2"],["-1","1","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","-2","4"],["0","1","-2"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","0","2"],["0","0","-1"]]},"deriv_order":2,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-3","-1"],["6","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-1"],["0","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":162414,"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-262d5bb70cb5d431"]},{"id":162415,"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-262d5bb70cb5d431"]},{"id":162416,"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-262d5bb70cb5d431"]}],"region_exact":{},"incoming_edges":[{"id":"e-262d5bb70cb5d431","operation":{"map":"A008277","operation":"basis_map"},"operation_detail":"A008277","conclusion_id":"n-505fa69e524feade","premise_count":1,"theorem":"ray basis maps: for L f = (a + b t) f + kappa (t - h) f', b > 0, kappa >= 0, and g real-rooted with every root <= h, of multiplicity m at h, T(u^k) = L^k g sends every real polynomial with all roots in S to one with all roots in (-inf, h] if and only if S lies in (-inf, a + b h + kappa m] (RealRooted rayBasisMap_maps_realRootedIn_iff; the step is Ma and Wang, EJC 15 (2008) R17, Theorem 2)","lean_route":null,"lean_declarations":[],"certificate_hash":"0c75f97a22d5ec177ab3d2bee042e3d48555f1ce3447bc0389bd6f2f0d7924c2","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-0d75f6272d2a2a84","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of double rise-bicolored Dyck paths (double rises come in two colors; also called marked Dyck paths) of semilength n and having k peaks (1 <= 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:      3,       1;\n   3:     11,       9,        1;\n   4:     45,      67,       18,        1;\n   5:    197,     475,      225,       30,       1;\n   6:    903,    3321,     2440,      565,      45,       1;\n   7:   4279,   23177,    24661,     8680,    1190,      63,      1;\n   8:  20793,  162247,   239694,   119301,   24570,    2226,     84,    1;\n   9: 103049, 1141623,  2276737,  1532034,  440055,   59430,   3822,  108,   1;\n  10: 518859, 8080693, 21327180, 18821965, 7197939, 1343559, 128100, 6150, 135, 1;\n","recurrence_sentence":"The row polynomials satisfy (n+1)*P(n,x) = -(n-2-(n-2)*x+(n-2)*x^2)*P(n-2,x) + ((n-2)*x-(2*n-4)*x^2)*d/dx P(n-2,x) - (n-2)*x^2*d^2/dx^2 P(n-2,x) + (6*n-3+(2*n-1)*x)*P(n-1,x) + (2*n-1)*x*d/dx P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 3 + x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 3 + x;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n - 2 - (n - 2)*x + (n - 2)*x^2)*P[n - 2, x] + ((n - 2)*x - (2*n - 4)*x^2)*D[P[n - 2, x], x] - (n - 2)*x^2*D[P[n - 2, x], {x, 2}] + (6*n - 3 + (2*n - 1)*x)*P[n - 1, x] + (2*n - 1)*x*D[P[n - 1, x], x])/(n + 1)]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 3 + x; for(n = 3, N, my(i = n); v[i] = (-(n - 2 - (n - 2)*x + (n - 2)*x^2)*v[i - 2] + ((n - 2)*x - (2*n - 4)*x^2)*deriv(v[i - 2], x) - (n - 2)*x^2*deriv(deriv(v[i - 2], x), x) + (6*n - 3 + (2*n - 1)*x)*v[i - 1] + (2*n - 1)*x*deriv(v[i - 1], x))/(n + 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-0d75f6272d2a2a84","steps":["basis A008277"],"edges":["e-262d5bb70cb5d431"],"text":"A114656 \u2192 basis A008277"},"headline":"A114656 \u2192 basis A008277","chain":null}