{"id":"n-52245c5cd1a8bc4d","revision":0,"first_index":1,"fingerprint":"f6-c431670491fdf571","name":"theta_plus_one_squared 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"],["6","8"],["22","64","18"],["90","408","270","32"],["394","2432","2628","768","50"],["1806","14120","21420","10560","1750","72"],["8558","81024","159030","112640","32250","3456","98"],["41586","462392","1116234","1040480","435750","82152","6174","128"],["206098","2632192","7551432","8770048","4900700","1370880","183848","10240","162"],["1037718","14969160","49789080","69417600","48856500","18443376","3712632","373248","16038","200"],["5293446","85114560","322162650","525004800","447457500","214704000","58879380","8970240","702270","24000","242"],["27297738","484094424","2055094470","3836580000","3849202500","2253469680","791650860","165623040","19806930","1243000","34606","288"],["142078746","2754744192","12964837644","27297219840","31559838750","21885811200","9442051080","2547578880","421238070","40656000","2092332","48384","338"],["745387038","15686015592","81068957892","190119703488","249141771450","200146425336","102845999256","34272336384","7351011954","986728600","78555620","3377088","65910","392"],["3937603038","89382048000","503281142910","1301320151040","1907539383750","1744721282304","1043465581158","416185516032","110805456762","19392172800","2158133978","144248832","5259618","87808","450"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["2","14","104","800","6272","49728","397056","3184896","25625600","206615552","1668313088","13484097536","109058195456","882446336000","7142338068480"],"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":[["4","0","-4","0","0"],["4","-10","14","2","0"],["0","-10","12","-8","1"],["0","0","-6","-4","-1"],["0","0","0","6","-1"],["0","0","0","0","1"]]},"terms":[{"coeff":{"coeffs":[["-4","-20","4","-26","0","-2"],["20","16","58","-1","20","3"],["0","-36","12","32","-7","3"],["0","0","-42","-39","-37","-6"],["0","0","0","26","19","-1"],["0","0","0","0","5","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["2","0","3","0","-4","0","-1"],["0","-12","5","6","-6","6","1"],["0","0","-6","-2","4","2","2"],["0","0","0","12","2","-12","-2"],["0","0","0","0","2","0","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":180530,"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-33e2ea14dae3010a"]},{"id":180531,"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-33e2ea14dae3010a"]},{"id":180532,"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-33e2ea14dae3010a"]}],"region_exact":{},"incoming_edges":[{"id":"e-33e2ea14dae3010a","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-52245c5cd1a8bc4d","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":"93bcb86d2ff241b2e1b401e37a6344af5321efadc9541aa9f3f778a3311d440c","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}}],"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-c933845cb84e467e","kind":"fingerprint_related","node_a_id":"n-53a637cf2423ea1c","node_b_id":"n-52245c5cd1a8bc4d","fingerprint":"f6-c431670491fdf571","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c431670491fdf571"},"other_id":"n-53a637cf2423ea1c","other":{"id":"n-53a637cf2423ea1c","name":"theta_plus_one_squared 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-c431670491fdf571","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["3","4"],["11","32","9"]],"card_rows":[["1"],["3","4"],["11","32","9"],["45","204","135","16"]],"row_sums_preview":["1","7","52","400","3136","24864","198528","1592448"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["basis A007318","(\u03b8+1)\u00b2"],"edges":["e-38a7985c4c1aa2e3","e-73e88354a22e5b44"],"text":"A114656 \u2192 basis A007318 \u2192 (\u03b8+1)\u00b2"},"headline":"A114656 \u2192 basis A007318 \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:       6,        8;\n   3:      22,       64,       18;\n   4:      90,      408,      270,       32;\n   5:     394,     2432,     2628,      768,       50;\n   6:    1806,    14120,    21420,    10560,     1750,       72;\n   7:    8558,    81024,   159030,   112640,    32250,     3456,      98;\n   8:   41586,   462392,  1116234,  1040480,   435750,    82152,    6174,    128;\n   9:  206098,  2632192,  7551432,  8770048,  4900700,  1370880,  183848,  10240,   162;\n  10: 1037718, 14969160, 49789080, 69417600, 48856500, 18443376, 3712632, 373248, 16038, 200;\n","recurrence_sentence":"The row polynomials satisfy (4*n+4-(10*n^2+10*n)*x-(6*n^3-12*n^2-14*n+4)*x^2+(6*n^4-4*n^3-8*n^2+2*n)*x^3+(n^5-n^4-n^3+n^2)*x^4)*P(n,x) = (20*n-4-(36*n^2-16*n+20)*x-(42*n^3-12*n^2-58*n-4)*x^2+(26*n^4-39*n^3+32*n^2-n-26)*x^3+(5*n^5+19*n^4-37*n^3-7*n^2+20*n)*x^4+(3*n^5-n^4-6*n^3+3*n^2+3*n-2)*x^5)*P(n-1,x) + (2-12*n*x-(6*n^2-5*n-3)*x^2+(12*n^3-2*n^2+6*n)*x^3+(2*n^4+2*n^3+4*n^2-6*n-4)*x^4-(12*n^3-2*n^2-6*n)*x^5-(2*n^4+2*n^3-2*n^2-n+1)*x^6)*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[((20*n - 4 - (36*n^2 - 16*n + 20)*x - (42*n^3 - 12*n^2 - 58*n - 4)*x^2 + (26*n^4 - 39*n^3 + 32*n^2 - n - 26)*x^3 + (5*n^5 + 19*n^4 - 37*n^3 - 7*n^2 + 20*n)*x^4 + (3*n^5 - n^4 - 6*n^3 + 3*n^2 + 3*n - 2)*x^5)*P[n - 1, x] + (2 - 12*n*x - (6*n^2 - 5*n - 3)*x^2 + (12*n^3 - 2*n^2 + 6*n)*x^3 + (2*n^4 + 2*n^3 + 4*n^2 - 6*n - 4)*x^4 - (12*n^3 - 2*n^2 - 6*n)*x^5 - (2*n^4 + 2*n^3 - 2*n^2 - n + 1)*x^6)*D[P[n - 1, x], x])/(4*n + 4 - (10*n^2 + 10*n)*x - (6*n^3 - 12*n^2 - 14*n + 4)*x^2 + (6*n^4 - 4*n^3 - 8*n^2 + 2*n)*x^3 + (n^5 - n^4 - n^3 + n^2)*x^4)]];\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] = ((20*n - 4 - (36*n^2 - 16*n + 20)*x - (42*n^3 - 12*n^2 - 58*n - 4)*x^2 + (26*n^4 - 39*n^3 + 32*n^2 - n - 26)*x^3 + (5*n^5 + 19*n^4 - 37*n^3 - 7*n^2 + 20*n)*x^4 + (3*n^5 - n^4 - 6*n^3 + 3*n^2 + 3*n - 2)*x^5)*v[i - 1] + (2 - 12*n*x - (6*n^2 - 5*n - 3)*x^2 + (12*n^3 - 2*n^2 + 6*n)*x^3 + (2*n^4 + 2*n^3 + 4*n^2 - 6*n - 4)*x^4 - (12*n^3 - 2*n^2 - 6*n)*x^5 - (2*n^4 + 2*n^3 - 2*n^2 - n + 1)*x^6)*deriv(v[i - 1], x))/(4*n + 4 - (10*n^2 + 10*n)*x - (6*n^3 - 12*n^2 - 14*n + 4)*x^2 + (6*n^4 - 4*n^3 - 8*n^2 + 2*n)*x^3 + (n^5 - n^4 - n^3 + n^2)*x^4)); 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","(\u03b8+1)\u00b2"],"edges":["e-5ebd2cd7e542e718","e-33e2ea14dae3010a"],"text":"A114655 \u2192 x \u21a6 x+1 \u2192 (\u03b8+1)\u00b2"},"headline":"A114655 \u2192 x \u21a6 x+1 \u2192 (\u03b8+1)\u00b2","chain":null}