{"id":"n-7f47b2246e50a89b","revision":1,"first_index":1,"fingerprint":"f6-c5faa49c64af63fa","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.","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","4"],["8","24","6"],["16","96","72","8"],["32","320","480","160","10"],["64","960","2400","1600","300","12"],["128","2688","10080","11200","4200","504","14"],["256","7168","37632","62720","39200","9408","784","16"],["512","18432","129024","301056","282240","112896","18816","1152","18"],["1024","46080","414720","1290240","1693440","1016064","282240","34560","1620","20"],["2048","112640","1267200","5068800","8870400","7451136","3104640","633600","59400","2200","22"],["4096","270336","3717120","18585600","41817600","46835712","27320832","8363520","1306800","96800","2904","24"],["8192","638976","10543104","64430080","181209600","260941824","202954752","86980608","20386080","2516800","151008","3744","26"],["16384","1490944","29073408","213204992","732892160","1319205888","1319205888","753831936","247351104","45805760","4580576","227136","4732","28"],["32768","3440640","78274560","678379520","2798315520","6156294144","7695367680","5653739520","2473511040","641280640","96192096","7949760","331240","5880","30"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["2","8","38","192","1002","5336","28814","157184","864146","4780008","26572086","148321344","830764794","4666890936","26283115038"],"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","2"],["-2","-5"],["2","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-2","1"],["0","4","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":165459,"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-f3cda92ee6452a8a"]},{"id":165460,"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-f3cda92ee6452a8a"]},{"id":165461,"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-f3cda92ee6452a8a"]},{"id":165462,"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-f3cda92ee6452a8a"]}],"region_exact":{},"incoming_edges":[{"id":"e-f3cda92ee6452a8a","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-7f47b2246e50a89b","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":"dabffe41feea133dd765f8ab3382b376c3f7187da299a2326d2320e96ec92206","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-e7bc3dee517c9497","kind":"fingerprint_related","node_a_id":"n-9d80e1b19273e824","node_b_id":"n-7f47b2246e50a89b","fingerprint":"f6-c5faa49c64af63fa","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c5faa49c64af63fa"},"other_id":"n-9d80e1b19273e824","other":{"id":"n-9d80e1b19273e824","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 peaks (1 <= k <= n).","first_index":1,"fingerprint":"f6-c5faa49c64af63fa","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","2"],["4","12","3"]],"card_rows":[["1"],["2","2"],["4","12","3"],["8","48","36","4"]],"row_sums_preview":["1","4","19","96","501","2668","14407","78592"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["\u03b8+1"],"edges":["e-57c7b63013beaaa7"],"text":"A114656 \u2192 \u03b8+1"},"headline":"A114656 \u2192 \u03b8+1","chain":null}},{"id":"l-2bbb39423078e638","kind":"oeis_match","node_a_id":"n-7f47b2246e50a89b","node_b_id":null,"fingerprint":null,"oeis_id":"A002003","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A002003","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-83e0bd750d2f6192","kind":"oeis_match","node_a_id":"n-7f47b2246e50a89b","node_b_id":null,"fingerprint":null,"oeis_id":"A123164","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A123164","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A002003","relation":"match_row_sums"},{"oeis_id":"A123164","relation":"match_row_sums"}],"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,     4;\n   3:    8,    24,      6;\n   4:   16,    96,     72,       8;\n   5:   32,   320,    480,     160,      10;\n   6:   64,   960,   2400,    1600,     300,      12;\n   7:  128,  2688,  10080,   11200,    4200,     504,     14;\n   8:  256,  7168,  37632,   62720,   39200,    9408,    784,    16;\n   9:  512, 18432, 129024,  301056,  282240,  112896,  18816,  1152,   18;\n  10: 1024, 46080, 414720, 1290240, 1693440, 1016064, 282240, 34560, 1620, 20;\n","recurrence_sentence":"The row polynomials satisfy (n^2-n)*P(n,x) = (2*n^2-2*n+(3*n^2-5*n+2)*x)*P(n-1,x) + ((4*n-2)*x-(2*n-1)*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[((2*n^2 - 2*n + (3*n^2 - 5*n + 2)*x)*P[n - 1, x] + ((4*n - 2)*x - (2*n - 1)*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] = ((2*n^2 - 2*n + (3*n^2 - 5*n + 2)*x)*v[i - 1] + ((4*n - 2)*x - (2*n - 1)*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":["\u03b8+1"],"edges":["e-f3cda92ee6452a8a"],"text":"A114655 \u2192 \u03b8+1"},"headline":"A114655 \u2192 \u03b8+1","chain":null}