{"id":"n-ef3b9f3925d35219","revision":0,"first_index":1,"fingerprint":"f6-64a0e8e2d31a6bd3","name":"theta_plus_one_squared 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"],["4","16"],["8","96","54"],["16","384","648","128"],["32","1280","4320","2560","250"],["64","3840","21600","25600","7500","432"],["128","10752","90720","179200","105000","18144","686"],["256","28672","338688","1003520","980000","338688","38416","1024"],["512","73728","1161216","4816896","7056000","4064256","921984","73728","1458"],["1024","184320","3732480","20643840","42336000","36578304","13829760","2211840","131220","2000"],["2048","450560","11404800","81100800","221760000","268240896","152127360","40550400","4811400","220000","2662"],["4096","1081344","33454080","297369600","1045440000","1686085632","1338720768","535265280","105850800","9680000","351384","3456"],["8192","2555904","94887936","1030881280","4530240000","9393905664","9944782848","5566758912","1651272480","251680000","18271968","539136","4394"],["16384","5963776","261660672","3411279872","18322304000","47491411968","64641088512","48245243904","20035439424","4580576000","554249696","32707584","799708","5488"],["32768","13762560","704471040","10854072320","69957888000","221626589184","377073016320","361839329280","200354394240","64128064000","11639243616","1144765440","55979560","1152480","6750"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["2","20","158","1176","8442","59036","404630","2729264","18169778","119650788","780670926","5053306440","32485788714","207582746988","1319392767558"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one_squared","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["2"]],"recurrence":{"denominator":{"coeffs":[["0","0","0"],["-4","2","0"],["4","-14","0"],["0","20","-1"],["0","-8","3"],["0","0","-3"],["0","0","1"]]},"terms":[{"coeff":{"coeffs":[["0","32","28","2"],["-8","-76","-54","-5"],["8","20","-12","0"],["0","40","78","9"],["0","-16","-36","-6"],["0","0","-6","-3"],["0","0","2","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-8","-12","6","1"],["0","16","16","-8","-2"],["0","0","16","-6","-1"],["0","0","-32","8","4"],["0","0","0","2","-1"],["0","0","0","4","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":179483,"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-f660767f73780ed5"]},{"id":179484,"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-f660767f73780ed5"]},{"id":179485,"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-f660767f73780ed5"]},{"id":179486,"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-f660767f73780ed5"]}],"region_exact":{},"incoming_edges":[{"id":"e-f660767f73780ed5","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"2\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-ef3b9f3925d35219","premise_count":1,"theorem":"Laguerre's theorem on multiplier sequences: if f is a real polynomial whose roots are all real and <= 0, then (f(k))_(k >= 0) is a multiplier sequence, so x^k -> f(k) x^k maps every real-rooted polynomial to a real-rooted polynomial or zero (Laguerre; see T. Craven and G. Csordas, Multiplier sequences for fields, Illinois J. Math. 21 (1977); Polya--Schur, Theorem 40 of P. Branden, arXiv:1410.6601: sum_k f(k) x^k / k! = f(theta) e^x = C e^x x^m prod (1 + x/a_j), a_j > 0); f(k) has one sign for k >= 0, so coefficients of one sign stay of one sign; applied to f(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.isMultiplierSequence_eval_of_roots_nonpos","RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos","RealRooted.isMultiplierSequence_iff_preserves"],"certificate_hash":"5ce79b909b58b500dcff419f132a1ab87c82e3d02ff7c0f37fd5f8c3c1026412","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},{"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-fba01a5d0d0f819d","kind":"fingerprint_related","node_a_id":"n-570a472e1ba455c2","node_b_id":"n-ef3b9f3925d35219","fingerprint":"f6-64a0e8e2d31a6bd3","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-64a0e8e2d31a6bd3"},"other_id":"n-570a472e1ba455c2","other":{"id":"n-570a472e1ba455c2","name":"theta_plus_one_squared 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-64a0e8e2d31a6bd3","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","8"],["4","48","27"]],"card_rows":[["1"],["2","8"],["4","48","27"],["8","192","324","64"]],"row_sums_preview":["1","10","79","588","4221","29518","202315","1364632"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["\u03b8+1","(\u03b8+1)\u00b2"],"edges":["e-57c7b63013beaaa7","e-edddfc5d5887b86a"],"text":"A114656 \u2192 \u03b8+1 \u2192 (\u03b8+1)\u00b2"},"headline":"A114656 \u2192 \u03b8+1 \u2192 (\u03b8+1)\u00b2","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:    4,     16;\n   3:    8,     96,      54;\n   4:   16,    384,     648,      128;\n   5:   32,   1280,    4320,     2560,      250;\n   6:   64,   3840,   21600,    25600,     7500,      432;\n   7:  128,  10752,   90720,   179200,   105000,    18144,      686;\n   8:  256,  28672,  338688,  1003520,   980000,   338688,    38416,    1024;\n   9:  512,  73728, 1161216,  4816896,  7056000,  4064256,   921984,   73728,   1458;\n  10: 1024, 184320, 3732480, 20643840, 42336000, 36578304, 13829760, 2211840, 131220, 2000;\n","recurrence_sentence":"The row polynomials satisfy (4*n^2-4*n-(8*n^4-20*n^3+14*n^2-2*n)*x+(n^6-3*n^5+3*n^4-n^3)*x^2)*P(n,x) = (8*n^2-8*n-(16*n^4-40*n^3-20*n^2+76*n-32)*x+(2*n^6-6*n^5-36*n^4+78*n^3-12*n^2-54*n+28)*x^2+(3*n^6-3*n^5-6*n^4+9*n^3-5*n+2)*x^3)*P(n-1,x) + ((16*n-8)*x-(32*n^3-16*n^2-16*n+12)*x^2+(4*n^5+2*n^4+8*n^3-6*n^2-8*n+6)*x^3-(2*n^5+n^4-4*n^3+n^2+2*n-1)*x^4)*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^2 - 8*n - (16*n^4 - 40*n^3 - 20*n^2 + 76*n - 32)*x + (2*n^6 - 6*n^5 - 36*n^4 + 78*n^3 - 12*n^2 - 54*n + 28)*x^2 + (3*n^6 - 3*n^5 - 6*n^4 + 9*n^3 - 5*n + 2)*x^3)*P[n - 1, x] + ((16*n - 8)*x - (32*n^3 - 16*n^2 - 16*n + 12)*x^2 + (4*n^5 + 2*n^4 + 8*n^3 - 6*n^2 - 8*n + 6)*x^3 - (2*n^5 + n^4 - 4*n^3 + n^2 + 2*n - 1)*x^4)*D[P[n - 1, x], x])/(4*n^2 - 4*n - (8*n^4 - 20*n^3 + 14*n^2 - 2*n)*x + (n^6 - 3*n^5 + 3*n^4 - n^3)*x^2)]];\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^2 - 8*n - (16*n^4 - 40*n^3 - 20*n^2 + 76*n - 32)*x + (2*n^6 - 6*n^5 - 36*n^4 + 78*n^3 - 12*n^2 - 54*n + 28)*x^2 + (3*n^6 - 3*n^5 - 6*n^4 + 9*n^3 - 5*n + 2)*x^3)*v[i - 1] + ((16*n - 8)*x - (32*n^3 - 16*n^2 - 16*n + 12)*x^2 + (4*n^5 + 2*n^4 + 8*n^3 - 6*n^2 - 8*n + 6)*x^3 - (2*n^5 + n^4 - 4*n^3 + n^2 + 2*n - 1)*x^4)*deriv(v[i - 1], x))/(4*n^2 - 4*n - (8*n^4 - 20*n^3 + 14*n^2 - 2*n)*x + (n^6 - 3*n^5 + 3*n^4 - n^3)*x^2)); 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","(\u03b8+1)\u00b2"],"edges":["e-d14d9d630db1a5b2","e-f660767f73780ed5"],"text":"A114655 \u2192 \u03b8+1 \u2192 (\u03b8+1)\u00b2"},"headline":"A114655 \u2192 \u03b8+1 \u2192 (\u03b8+1)\u00b2","chain":null}