{"id":"n-d6831a2f321e9d14","revision":0,"first_index":1,"fingerprint":"f6-ade972e3543234ee","name":"theta_plus_one of reversal 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"],["2","8"],["2","24","24"],["2","48","144","64"],["2","80","480","640","160"],["2","120","1200","3200","2400","384"],["2","168","2520","11200","16800","8064","896"],["2","224","4704","31360","78400","75264","25088","2048"],["2","288","8064","75264","282240","451584","301056","73728","4608"],["2","360","12960","161280","846720","2032128","2257920","1105920","207360","10240"],["2","440","19800","316800","2217600","7451136","12418560","10137600","3801600","563200","22528"],["2","528","29040","580800","5227200","23417856","54641664","66908160","41817600","12390400","1486848","49152"],["2","624","41184","1006720","11325600","65235456","202954752","347922432","326177280","161075200","38658048","3833856","106496"],["2","728","56784","1665664","22902880","164900736","659602944","1507663872","1978808832","1465784320","586313728","116293632","9691136","229376"],["2","840","76440","2649920","43723680","384768384","1923841920","5653739520","9894044160","10260490240","6156294144","2035138560","339189760","24084480","491520"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["2","10","50","258","1362","7306","39650","217090","1196834","6634890","36949266","206549250","1158337650","6513914634","36718533570"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_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":[["0","4"],["-1","-10"],["1","6"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-1","2"],["0","2","-4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":177453,"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-101a9c96b8392e2e"]},{"id":177454,"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-101a9c96b8392e2e"]},{"id":177455,"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-101a9c96b8392e2e"]},{"id":177456,"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-101a9c96b8392e2e"]}],"region_exact":{},"incoming_edges":[{"id":"e-101a9c96b8392e2e","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-d6831a2f321e9d14","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":"6a097f6eed38a590e31465fc3ebea9149c3f56ee1e6ab6b4ef1e991408513870","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-435b4d5bded8f11f","role":"sequence","name":"reversal 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-701d25cd337320ab","kind":"fingerprint_related","node_a_id":"n-916d0051af2e0118","node_b_id":"n-d6831a2f321e9d14","fingerprint":"f6-ade972e3543234ee","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-ade972e3543234ee"},"other_id":"n-916d0051af2e0118","other":{"id":"n-916d0051af2e0118","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 double rises (0 <= k <= n-1).","first_index":0,"fingerprint":"f6-ade972e3543234ee","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","4"],["1","12","12"]],"card_rows":[["1"],["1","4"],["1","12","12"],["1","24","72","32"]],"row_sums_preview":["1","5","25","129","681","3653","19825","108545"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-8ce61d302cec295b","steps":["\u03b8+1"],"edges":["e-2a32d110f0351649"],"text":"A114687 \u2192 \u03b8+1"},"headline":"A114687 \u2192 \u03b8+1","chain":null}},{"id":"l-a2093f3e788d0c62","kind":"fingerprint_related","node_a_id":"n-587271daecb2c809","node_b_id":"n-d6831a2f321e9d14","fingerprint":"f6-ade972e3543234ee","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-ade972e3543234ee"},"other_id":"n-587271daecb2c809","other":{"id":"n-587271daecb2c809","name":"theta_plus_one of reversal 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-ade972e3543234ee","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","4"],["1","12","12"]],"card_rows":[["1"],["1","4"],["1","12","12"],["1","24","72","32"]],"row_sums_preview":["1","5","25","129","681","3653","19825","108545"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["reverse","\u03b8+1"],"edges":["e-87267df0bda73e27","e-bd31a37f32a8c0aa"],"text":"A114656 \u2192 reverse \u2192 \u03b8+1"},"headline":"A114656 \u2192 reverse \u2192 \u03b8+1","chain":null}},{"id":"l-b0cbdabe17418995","kind":"fingerprint_related","node_a_id":"n-d6831a2f321e9d14","node_b_id":"n-9cc1c067e5b017e3","fingerprint":"f6-ade972e3543234ee","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-ade972e3543234ee"},"other_id":"n-9cc1c067e5b017e3","other":{"id":"n-9cc1c067e5b017e3","name":"reversal 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 double rises (0 <= k <= n-1).","first_index":0,"fingerprint":"f6-ade972e3543234ee","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["4","1"],["12","12","1"]],"card_rows":[["1"],["4","1"],["12","12","1"],["32","72","24","1"]],"row_sums_preview":["1","5","25","129","681","3653","19825","108545"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-8ce61d302cec295b","steps":["\u03b8+1","reverse"],"edges":["e-2a32d110f0351649","e-580d3e1c63295286"],"text":"A114687 \u2192 \u03b8+1 \u2192 reverse"},"headline":"A114687 \u2192 \u03b8+1 \u2192 reverse","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: 2,   8;\n   3: 2,  24,    24;\n   4: 2,  48,   144,     64;\n   5: 2,  80,   480,    640,    160;\n   6: 2, 120,  1200,   3200,   2400,     384;\n   7: 2, 168,  2520,  11200,  16800,    8064,     896;\n   8: 2, 224,  4704,  31360,  78400,   75264,   25088,    2048;\n   9: 2, 288,  8064,  75264, 282240,  451584,  301056,   73728,   4608;\n  10: 2, 360, 12960, 161280, 846720, 2032128, 2257920, 1105920, 207360, 10240;\n","recurrence_sentence":"The row polynomials satisfy (n^2-n)*P(n,x) = (n^2-n+(6*n^2-10*n+4)*x)*P(n-1,x) + ((2*n-1)*x-(4*n-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[((n^2 - n + (6*n^2 - 10*n + 4)*x)*P[n - 1, x] + ((2*n - 1)*x - (4*n - 2)*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] = ((n^2 - n + (6*n^2 - 10*n + 4)*x)*v[i - 1] + ((2*n - 1)*x - (4*n - 2)*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":["reverse","\u03b8+1"],"edges":["e-a35c7072fcaf677b","e-101a9c96b8392e2e"],"text":"A114655 \u2192 reverse \u2192 \u03b8+1"},"headline":"A114655 \u2192 reverse \u2192 \u03b8+1","chain":null}