{"id":"n-a408539cfbf31905","revision":0,"first_index":1,"fingerprint":"f6-78ed572c24a1b447","name":"theta_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"],["6","4"],["22","32","6"],["90","204","90","8"],["394","1216","876","192","10"],["1806","7060","7140","2640","350","12"],["8558","40512","53010","28160","6450","576","14"],["41586","231196","372078","260120","87150","13692","882","16"],["206098","1316096","2517144","2192512","980140","228480","26264","1280","18"],["1037718","7484580","16596360","17354400","9771300","3073896","530376","46656","1782","20"],["5293446","42557280","107387550","131251200","89491500","35784000","8411340","1121280","78030","2400","22"],["27297738","242047212","685031490","959145000","769840500","375578280","113092980","20702880","2200770","124300","3146","24"],["142078746","1377372096","4321612548","6824304960","6311967750","3647635200","1348864440","318447360","46804230","4065600","190212","4032","26"],["745387038","7843007796","27022985964","47529925872","49828354290","33357737556","14692285608","4284042048","816779106","98672860","7141420","281424","5070","28"],["3937603038","44691024000","167760380970","325330037760","381507876750","290786880384","149066511594","52023189504","12311717418","1939217280","196193998","12020736","404586","6272","30"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["2","10","60","392","2688","19008","137280","1006720","7468032","55897088","421378048","3195064320","24343347200","186226606080","1429563064320"],"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":[["-2","0","0"],["-2","2","-1"],["0","2","0"],["0","0","1"]]},"terms":[{"coeff":{"coeffs":[["2","8","0","2"],["-10","-8","-11","-3"],["0","8","6","-2"],["0","0","5","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-2","0","1","0","1"],["0","4","1","-4","-1"],["0","0","2","0","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":180527,"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-2e15c7ca4c773425"]},{"id":180528,"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-2e15c7ca4c773425"]},{"id":180529,"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-2e15c7ca4c773425"]}],"region_exact":{},"incoming_edges":[{"id":"e-2e15c7ca4c773425","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-a408539cfbf31905","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":"877668fa85dde588396e935c1c42856fa8205ae860fe413e8b632233b9e28ab8","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-b5fe53700172188a","kind":"fingerprint_related","node_a_id":"n-ab3980fcc888883c","node_b_id":"n-a408539cfbf31905","fingerprint":"f6-78ed572c24a1b447","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-78ed572c24a1b447"},"other_id":"n-ab3980fcc888883c","other":{"id":"n-ab3980fcc888883c","name":"theta_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-78ed572c24a1b447","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["3","2"],["11","16","3"]],"card_rows":[["1"],["3","2"],["11","16","3"],["45","102","45","4"]],"row_sums_preview":["1","5","30","196","1344","9504","68640","503360"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["basis A007318","\u03b8+1"],"edges":["e-38a7985c4c1aa2e3","e-29230fb0ba10dc48"],"text":"A114656 \u2192 basis A007318 \u2192 \u03b8+1"},"headline":"A114656 \u2192 basis A007318 \u2192 \u03b8+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:       6,       4;\n   3:      22,      32,        6;\n   4:      90,     204,       90,        8;\n   5:     394,    1216,      876,      192,      10;\n   6:    1806,    7060,     7140,     2640,     350,      12;\n   7:    8558,   40512,    53010,    28160,    6450,     576,     14;\n   8:   41586,  231196,   372078,   260120,   87150,   13692,    882,    16;\n   9:  206098, 1316096,  2517144,  2192512,  980140,  228480,  26264,  1280,   18;\n  10: 1037718, 7484580, 16596360, 17354400, 9771300, 3073896, 530376, 46656, 1782, 20;\n","recurrence_sentence":"The row polynomials satisfy -(2*n+2-(2*n^2+2*n)*x-(n^3-n)*x^2)*P(n,x) = -(10*n-2-(8*n^2-8*n+8)*x-(5*n^3+6*n^2-11*n)*x^2-(3*n^3-2*n^2-3*n+2)*x^3)*P(n-1,x) - (2-4*n*x-(2*n^2+n+1)*x^2+4*n*x^3+(2*n^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[(-(10*n - 2 - (8*n^2 - 8*n + 8)*x - (5*n^3 + 6*n^2 - 11*n)*x^2 - (3*n^3 - 2*n^2 - 3*n + 2)*x^3)*P[n - 1, x] - (2 - 4*n*x - (2*n^2 + n + 1)*x^2 + 4*n*x^3 + (2*n^2 + n - 1)*x^4)*D[P[n - 1, x], x])/(-2*n - 2 + (2*n^2 + 2*n)*x + (n^3 - n)*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] = (-(10*n - 2 - (8*n^2 - 8*n + 8)*x - (5*n^3 + 6*n^2 - 11*n)*x^2 - (3*n^3 - 2*n^2 - 3*n + 2)*x^3)*v[i - 1] - (2 - 4*n*x - (2*n^2 + n + 1)*x^2 + 4*n*x^3 + (2*n^2 + n - 1)*x^4)*deriv(v[i - 1], x))/(-2*n - 2 + (2*n^2 + 2*n)*x + (n^3 - n)*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":["x \u21a6 x+1","\u03b8+1"],"edges":["e-5ebd2cd7e542e718","e-2e15c7ca4c773425"],"text":"A114655 \u2192 x \u21a6 x+1 \u2192 \u03b8+1"},"headline":"A114655 \u2192 x \u21a6 x+1 \u2192 \u03b8+1","chain":null}