{"id":"n-a1c963de13c50910","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 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.","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":[["2"],["8","4"],["38","36","6"],["192","264","96","8"],["1002","1800","1020","200","10"],["5336","11820","9120","2920","360","12"],["28814","75852","74130","33320","6930","588","14"],["157184","479248","567168","329840","98560","14448","896","16"],["864146","2994192","4161528","2976624","1170540","250992","27384","1296","18"],["4780008","18548820","29612160","25171440","12332880","3528504","571200","48240","1800","20"],["26572086","114148980","205825950","202844400","119311500","42993720","9392460","1190640","80190","2420","22"],["148321344","698734872","1404390240","1575017400","1082822400","472515120","131208000","22659120","2312640","127160","3168","24"],["830764794","4258447128","9439841268","11873879160","9351663750","4803804720","1627505880","360051120","50463270","4238520","193908","4056","26"],["4666890936","25858331772","62670430368","87392609304","77626468920","45951125220","18440822400","5010067920","905584680","105165060","7399392","286104","5096","28"],["26283115038","156531277980","411757909290","630536339160","623830277070","418558176036","194586802410","62966938320","14057012970","2117575460","207213006","12394200","410410","6300","30"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["2","12","80","560","4032","29568","219648","1647360","12446720","94595072","722362368","5538111488","42600857600","328635187200","2541445447680"],"nonn":true,"definitions":[{"position":0,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["2"]],"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":179487,"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-0a9056d8051cd933"]},{"id":179488,"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-0a9056d8051cd933"]},{"id":179489,"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-0a9056d8051cd933"]},{"id":179490,"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-0a9056d8051cd933"]}],"region_exact":{},"incoming_edges":[{"id":"e-0a9056d8051cd933","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-a1c963de13c50910","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":"f04a198e1ea9a62c4c2e805d0ba1f924c678867761d36f8242b76aa95309a1ca","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-7f47b2246e50a89b","role":"sequence","name":"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.","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-3314ca1e7e4eb797","other":{"id":"n-3314ca1e7e4eb797","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).","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":[["1"],["4","2"],["19","18","3"]],"card_rows":[["1"],["4","2"],["19","18","3"],["96","132","48","4"]],"row_sums_preview":["1","6","40","280","2016","14784","109824","823680"],"regions":["(-inf, -1]"],"region_exact":{},"oeis_ids":[],"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}}],"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:       2;\n   2:       8,        4;\n   3:      38,       36,        6;\n   4:     192,      264,       96,        8;\n   5:    1002,     1800,     1020,      200,       10;\n   6:    5336,    11820,     9120,     2920,      360,      12;\n   7:   28814,    75852,    74130,    33320,     6930,     588,     14;\n   8:  157184,   479248,   567168,   329840,    98560,   14448,    896,    16;\n   9:  864146,  2994192,  4161528,  2976624,  1170540,  250992,  27384,  1296,   18;\n  10: 4780008, 18548820, 29612160, 25171440, 12332880, 3528504, 571200, 48240, 1800, 20;\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) = 2.","mathematica":"P[1, x_] := 2;\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] = 2; 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-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}