{"id":"n-3314ca1e7e4eb797","revision":0,"first_index":1,"fingerprint":"f6-bf35de5d7524cff0","name":"shift_x_plus_one of theta_plus_one 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"],["4","2"],["19","18","3"],["96","132","48","4"],["501","900","510","100","5"],["2668","5910","4560","1460","180","6"],["14407","37926","37065","16660","3465","294","7"],["78592","239624","283584","164920","49280","7224","448","8"],["432073","1497096","2080764","1488312","585270","125496","13692","648","9"],["2390004","9274410","14806080","12585720","6166440","1764252","285600","24120","900","10"],["13286043","57074490","102912975","101422200","59655750","21496860","4696230","595320","40095","1210","11"],["74160672","349367436","702195120","787508700","541411200","236257560","65604000","11329560","1156320","63580","1584","12"],["415382397","2129223564","4719920634","5936939580","4675831875","2401902360","813752940","180025560","25231635","2119260","96954","2028","13"],["2333445468","12929165886","31335215184","43696304652","38813234460","22975562610","9220411200","2505033960","452792340","52582530","3699696","143052","2548","14"],["13141557519","78265638990","205878954645","315268169580","311915138535","209279088018","97293401205","31483469160","7028506485","1058787730","103606503","6197100","205205","3150","15"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","40","280","2016","14784","109824","823680","6223360","47297536","361181184","2769055744","21300428800","164317593600","1270722723840"],"nonn":true,"definitions":[{"position":0,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0"],["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["2","2"],["-7","-5"],["5","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","0","1"],["2","0","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":178701,"position":0,"claim":"real_rooted","from_index":1,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-fb72ecb8e91a7061"]},{"id":178702,"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-fb72ecb8e91a7061"]},{"id":178703,"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-fb72ecb8e91a7061"]},{"id":178704,"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-fb72ecb8e91a7061"]}],"region_exact":{},"incoming_edges":[{"id":"e-fb72ecb8e91a7061","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-3314ca1e7e4eb797","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":"2395e6a058706d3ed1f21647f7cc4c037a18149c1cb05b970d7716980c9d23d7","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"-1"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-9d80e1b19273e824","role":"sequence","name":"theta_plus_one 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).","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":[{"id":"l-956a3a3c1dad820e","kind":"fingerprint_related","node_a_id":"n-3314ca1e7e4eb797","node_b_id":"n-a1c963de13c50910","fingerprint":"f6-bf35de5d7524cff0","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-bf35de5d7524cff0"},"other_id":"n-a1c963de13c50910","other":{"id":"n-a1c963de13c50910","name":"shift_x_plus_one of theta_plus_one of Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis. A weak ascent in a Schroeder path is a maximal sequence of consecutive U and H steps.","first_index":1,"fingerprint":"f6-bf35de5d7524cff0","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["2"],["8","4"],["38","36","6"]],"card_rows":[["2"],["8","4"],["38","36","6"],["192","264","96","8"]],"row_sums_preview":["2","12","80","560","4032","29568","219648","1647360"],"regions":["(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-6a30765140629bd5","steps":["\u03b8+1","x \u21a6 x+1"],"edges":["e-d14d9d630db1a5b2","e-0a9056d8051cd933"],"text":"A114655 \u2192 \u03b8+1 \u2192 x \u21a6 x+1"},"headline":"A114655 \u2192 \u03b8+1 \u2192 x \u21a6 x+1","chain":null}}],"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:       4,       2;\n   3:      19,      18,        3;\n   4:      96,     132,       48,        4;\n   5:     501,     900,      510,      100,       5;\n   6:    2668,    5910,     4560,     1460,     180,       6;\n   7:   14407,   37926,    37065,    16660,    3465,     294,      7;\n   8:   78592,  239624,   283584,   164920,   49280,    7224,    448,     8;\n   9:  432073, 1497096,  2080764,  1488312,  585270,  125496,  13692,   648,   9;\n  10: 2390004, 9274410, 14806080, 12585720, 6166440, 1764252, 285600, 24120, 900, 10;\n","recurrence_sentence":"The row polynomials satisfy (n^2-n)*P(n,x) = (5*n^2-7*n+2+(3*n^2-5*n+2)*x)*P(n-1,x) + (2*n-1-(2*n-1)*x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.","mathematica":"P[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[((5*n^2 - 7*n + 2 + (3*n^2 - 5*n + 2)*x)*P[n - 1, x] + (2*n - 1 - (2*n - 1)*x^2)*D[P[n - 1, x], x])/(n^2 - n)]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((5*n^2 - 7*n + 2 + (3*n^2 - 5*n + 2)*x)*v[i - 1] + (2*n - 1 - (2*n - 1)*x^2)*deriv(v[i - 1], x))/(n^2 - n)); 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":["\u03b8+1","x \u21a6 x+1"],"edges":["e-57c7b63013beaaa7","e-fb72ecb8e91a7061"],"text":"A114656 \u2192 \u03b8+1 \u2192 x \u21a6 x+1"},"headline":"A114656 \u2192 \u03b8+1 \u2192 x \u21a6 x+1","chain":null}