{"id":"n-ffe0c414befb86c3","revision":1,"first_index":1,"fingerprint":"f6-5ab569ff3c1291af","name":"theta_plus_one_squared 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","8"],["8","48","18"],["16","192","216","32"],["32","640","1440","640","50"],["64","1920","7200","6400","1500","72"],["128","5376","30240","44800","21000","3024","98"],["256","14336","112896","250880","196000","56448","5488","128"],["512","36864","387072","1204224","1411200","677376","131712","9216","162"],["1024","92160","1244160","5160960","8467200","6096384","1975680","276480","14580","200"],["2048","225280","3801600","20275200","44352000","44706816","21732480","5068800","534600","22000","242"],["4096","540672","11151360","74342400","209088000","281014272","191245824","66908160","11761200","968000","31944","288"],["8192","1277952","31629312","257720320","906048000","1565650944","1420683264","695844864","183474720","25168000","1661088","44928","338"],["16384","2981888","87220224","852819968","3664460800","7915235328","9234441216","6030655488","2226159936","458057600","50386336","2725632","61516","392"],["32768","6881280","234823680","2713518080","13991577600","36937764864","53867573760","45229916160","22261599360","6412806400","1058113056","95397120","4306120","82320","450"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["2","12","74","456","2802","17156","104666","636432","3858338","23328828","140721066","847056216","5089211922","30525222708","182814393018"],"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"],["2","0"],["-2","1"],["0","-2"],["0","1"]]},"terms":[{"coeff":{"coeffs":[["0","-8","-2"],["4","20","5"],["-4","-10","-2"],["0","-4","-4"],["0","2","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","4","0","-1"],["0","-8","0","2"],["0","0","0","0"],["0","0","4","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":165463,"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-b19e39c8911e8bee"]},{"id":165464,"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-b19e39c8911e8bee"]},{"id":165465,"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-b19e39c8911e8bee"]},{"id":165466,"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-b19e39c8911e8bee"]}],"region_exact":{},"incoming_edges":[{"id":"e-b19e39c8911e8bee","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-ffe0c414befb86c3","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":"961f5bcd69e16b49e528e54cf0f2c94161af5766abc343797e5ddef73e603bad","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-6a30765140629bd5","role":"sequence","name":"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-5773646621824d59","kind":"fingerprint_related","node_a_id":"n-dcdf634434d2b81e","node_b_id":"n-ffe0c414befb86c3","fingerprint":"f6-5ab569ff3c1291af","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-5ab569ff3c1291af"},"other_id":"n-dcdf634434d2b81e","other":{"id":"n-dcdf634434d2b81e","name":"theta_plus_one_squared 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-5ab569ff3c1291af","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","4"],["4","24","9"]],"card_rows":[["1"],["2","4"],["4","24","9"],["8","96","108","16"]],"row_sums_preview":["1","6","37","228","1401","8578","52333","318216"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["(\u03b8+1)\u00b2"],"edges":["e-e1d01b2b90edc2fe"],"text":"A114656 \u2192 (\u03b8+1)\u00b2"},"headline":"A114656 \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,     8;\n   3:    8,    48,      18;\n   4:   16,   192,     216,      32;\n   5:   32,   640,    1440,     640,      50;\n   6:   64,  1920,    7200,    6400,    1500,      72;\n   7:  128,  5376,   30240,   44800,   21000,    3024,      98;\n   8:  256, 14336,  112896,  250880,  196000,   56448,    5488,    128;\n   9:  512, 36864,  387072, 1204224, 1411200,  677376,  131712,   9216,   162;\n  10: 1024, 92160, 1244160, 5160960, 8467200, 6096384, 1975680, 276480, 14580, 200;\n","recurrence_sentence":"The row polynomials satisfy -(2*n^2-2*n-(n^4-2*n^3+n^2)*x)*P(n,x) = -(4*n^2-4*n-(2*n^4-4*n^3-10*n^2+20*n-8)*x-(3*n^4-4*n^3-2*n^2+5*n-2)*x^2)*P(n-1,x) - ((8*n-4)*x-4*n^3*x^2+(2*n^3-2*n+1)*x^3)*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[(-(4*n^2 - 4*n - (2*n^4 - 4*n^3 - 10*n^2 + 20*n - 8)*x - (3*n^4 - 4*n^3 - 2*n^2 + 5*n - 2)*x^2)*P[n - 1, x] - ((8*n - 4)*x - 4*n^3*x^2 + (2*n^3 - 2*n + 1)*x^3)*D[P[n - 1, x], x])/(-2*n^2 + 2*n + (n^4 - 2*n^3 + n^2)*x)]];\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] = (-(4*n^2 - 4*n - (2*n^4 - 4*n^3 - 10*n^2 + 20*n - 8)*x - (3*n^4 - 4*n^3 - 2*n^2 + 5*n - 2)*x^2)*v[i - 1] - ((8*n - 4)*x - 4*n^3*x^2 + (2*n^3 - 2*n + 1)*x^3)*deriv(v[i - 1], x))/(-2*n^2 + 2*n + (n^4 - 2*n^3 + n^2)*x)); 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)\u00b2"],"edges":["e-b19e39c8911e8bee"],"text":"A114655 \u2192 (\u03b8+1)\u00b2"},"headline":"A114655 \u2192 (\u03b8+1)\u00b2","chain":null}