{"id":"n-8a7f4c5c028e757f","revision":0,"first_index":1,"fingerprint":"f6-77e051dbf841d62e","name":"shift_x_plus_one of shift_x_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","2"],["40","20","2"],["224","168","36","2"],["1344","1344","448","56","2"],["8448","10560","4800","960","80","2"],["54912","82368","47520","13200","1800","108","2"],["366080","640640","448448","160160","30800","3080","140","2"],["2489344","4978688","4100096","1793792","448448","64064","4928","176","2"],["17199104","38697984","36661248","19009536","5870592","1100736","122304","7488","216","2"],["120393728","300984320","322483200","193489920","71285760","16633344","2446080","218400","10920","260","2"],["852017152","2343047168","2801469440","1910092800","818611200","229211136","42223104","5026560","369600","15400","308","2"],["6085836800","18257510400","24099913728","18409656320","9004723200","2947000320","654888960","98233344","9694080","598400","21120","360","2"],["43818024960","142408581120","205701283840","174054932480","95730212864","35898829824","9364912128","1702711296","212838912","17736576","933504","28288","416","2"],["317680680960","1111882383360","1744505118720","1619897610240","989937428480","418819681280","125645904384","26924122368","4097149056","434546112","31039008","1410864","37128","476","2"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["2","10","62","430","3194","24850","199910","1649350","13879538","118669210","1027945934","9002083870","79568077034","708911026210","6359857112438"],"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":[["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-4","-3"],["8","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-4","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":180533,"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-2c7c6c8ed6291ecb"]},{"id":180534,"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-2c7c6c8ed6291ecb"]},{"id":180535,"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-2c7c6c8ed6291ecb"]}],"region_exact":{},"incoming_edges":[{"id":"e-2c7c6c8ed6291ecb","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-8a7f4c5c028e757f","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":"ca5af14f014f95918dff72d1ca10b89f7d11e3b578e174d8eed69161b5056995","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"-1"}}}],"premises":[{"position":0,"node_id":"n-25065a706ad43d32","role":"sequence","name":"shift_x_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-974ebf1b0ab2e18b","kind":"fingerprint_related","node_a_id":"n-b4f19b398a718e0e","node_b_id":"n-8a7f4c5c028e757f","fingerprint":"f6-77e051dbf841d62e","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-77e051dbf841d62e"},"other_id":"n-b4f19b398a718e0e","other":{"id":"n-b4f19b398a718e0e","name":"shift_x_plus_one of basis_map_A007318 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-77e051dbf841d62e","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["4","1"],["20","10","1"]],"card_rows":[["1"],["4","1"],["20","10","1"],["112","84","18","1"]],"row_sums_preview":["1","5","31","215","1597","12425","99955","824675"],"regions":["(-inf, -1]","(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["basis A007318","x \u21a6 x+1"],"edges":["e-38a7985c4c1aa2e3","e-5ed4aa7494f18ecc"],"text":"A114656 \u2192 basis A007318 \u2192 x \u21a6 x+1"},"headline":"A114656 \u2192 basis A007318 \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,        2;\n   3:       40,       20,        2;\n   4:      224,      168,       36,        2;\n   5:     1344,     1344,      448,       56,       2;\n   6:     8448,    10560,     4800,      960,      80,       2;\n   7:    54912,    82368,    47520,    13200,    1800,     108,      2;\n   8:   366080,   640640,   448448,   160160,   30800,    3080,    140,    2;\n   9:  2489344,  4978688,  4100096,  1793792,  448448,   64064,   4928,  176,   2;\n  10: 17199104, 38697984, 36661248, 19009536, 5870592, 1100736, 122304, 7488, 216, 2;\n","recurrence_sentence":"The row polynomials satisfy (n+1)*P(n,x) = (8*n-4+(3*n-3)*x)*P(n-1,x) - (4*x+2*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[((8*n - 4 + (3*n - 3)*x)*P[n - 1, x] - (4*x + 2*x^2)*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] = 2; for(n = 2, N, my(i = n); v[i] = ((8*n - 4 + (3*n - 3)*x)*v[i - 1] - (4*x + 2*x^2)*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-6a30765140629bd5","steps":["x \u21a6 x+1","x \u21a6 x+1"],"edges":["e-5ebd2cd7e542e718","e-2c7c6c8ed6291ecb"],"text":"A114655 \u2192 x \u21a6 x+1 \u2192 x \u21a6 x+1"},"headline":"A114655 \u2192 x \u21a6 x+1 \u2192 x \u21a6 x+1","chain":null}