{"id":"n-7e8d73671f213694","revision":0,"first_index":0,"fingerprint":"f6-c5faa49c64af63fa","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 double rises (0 <= k <= n-1).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["2","2"],["4","12","3"],["8","48","36","4"],["16","160","240","80","5"],["32","480","1200","800","150","6"],["64","1344","5040","5600","2100","252","7"],["128","3584","18816","31360","19600","4704","392","8"],["256","9216","64512","150528","141120","56448","9408","576","9"],["512","23040","207360","645120","846720","508032","141120","17280","810","10"],["1024","56320","633600","2534400","4435200","3725568","1552320","316800","29700","1100","11"],["2048","135168","1858560","9292800","20908800","23417856","13660416","4181760","653400","48400","1452","12"],["4096","319488","5271552","32215040","90604800","130470912","101477376","43490304","10193040","1258400","75504","1872","13"],["8192","745472","14536704","106602496","366446080","659602944","659602944","376915968","123675552","22902880","2290288","113568","2366","14"],["16384","1720320","39137280","339189760","1399157760","3078147072","3847683840","2826869760","1236755520","320640320","48096048","3974880","165620","2940","15"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","19","96","501","2668","14407","78592","432073","2390004","13286043","74160672","415382397","2333445468","13141557519"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0"],["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0"],["2","1"],["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":176563,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-ef0d0424646f90c4"]},{"id":176564,"position":1,"claim":"one_signed_coefficients","from_index":0,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":0},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 0: the coefficients of P_n have one sign","region_exact":null,"edges":["e-ef0d0424646f90c4"]},{"id":176565,"position":2,"claim":"hadamard_kernel","from_index":0,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":0},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-ef0d0424646f90c4"]},{"id":176566,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-ef0d0424646f90c4"]}],"region_exact":{},"incoming_edges":[{"id":"e-ef0d0424646f90c4","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-7e8d73671f213694","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":"80ba3295d145d7865e857dd0a96c083b9e51900d0dbbead33ff2788a8958562e","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-1b0fc3e5a40ede1a","role":"sequence","name":"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 double rises (0 <= k <= n-1).","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]"}]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-0547eb196c4996d2","kind":"fingerprint_related","node_a_id":"n-9d80e1b19273e824","node_b_id":"n-7e8d73671f213694","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-228c37fb493468c6","kind":"fingerprint_related","node_a_id":"n-7f47b2246e50a89b","node_b_id":"n-7e8d73671f213694","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-7f47b2246e50a89b","other":{"id":"n-7f47b2246e50a89b","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.","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":[["2"],["4","4"],["8","24","6"]],"card_rows":[["2"],["4","4"],["8","24","6"],["16","96","72","8"]],"row_sums_preview":["2","8","38","192","1002","5336","28814","157184"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-6a30765140629bd5","steps":["\u03b8+1"],"edges":["e-d14d9d630db1a5b2"],"text":"A114655 \u2192 \u03b8+1"},"headline":"A114655 \u2192 \u03b8+1","chain":null}},{"id":"l-7ac98e48bfbeb476","kind":"fingerprint_related","node_a_id":"n-7e8d73671f213694","node_b_id":"n-236a5c827b0706e7","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-236a5c827b0706e7","other":{"id":"n-236a5c827b0706e7","name":"derivative of Delannoy paths counted by number of weak peaks.","first_index":0,"fingerprint":"f6-c5faa49c64af63fa","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["8","8"],["18","72","24"],["32","288","384","64"]],"card_rows":[["8","8"],["18","72","24"],["32","288","384","64"],["50","800","2400","1600","160"]],"row_sums_preview":["16","114","768","5010","32016","201698","1257472","7777314"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b31aa1a3fd93d174","steps":["D"],"edges":["e-f75fd743a43c1d65"],"text":"A133214 \u2192 D"},"headline":"A133214 \u2192 D","chain":null}},{"id":"l-97be6dd0c196a53e","kind":"fingerprint_related","node_a_id":"n-7e8d73671f213694","node_b_id":"n-78c1f32e7d3584ec","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-78c1f32e7d3584ec","other":{"id":"n-78c1f32e7d3584ec","name":"reversal of 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.","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":[["2"],["4","4"],["6","24","8"]],"card_rows":[["2"],["4","4"],["6","24","8"],["8","72","96","16"]],"row_sums_preview":["2","8","38","192","1002","5336","28814","157184"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-6a30765140629bd5","steps":["\u03b8+1","reverse"],"edges":["e-d14d9d630db1a5b2","e-09fa0d29f4904372"],"text":"A114655 \u2192 \u03b8+1 \u2192 reverse"},"headline":"A114655 \u2192 \u03b8+1 \u2192 reverse","chain":null}},{"id":"l-e76d4845c8ec8d7d","kind":"fingerprint_related","node_a_id":"n-7e8d73671f213694","node_b_id":"n-69ce0ad43c657483","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-69ce0ad43c657483","other":{"id":"n-69ce0ad43c657483","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 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"],["3","12","4"]],"card_rows":[["1"],["2","2"],["3","12","4"],["4","36","48","8"]],"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","reverse"],"edges":["e-57c7b63013beaaa7","e-8523f428ac45163c"],"text":"A114656 \u2192 \u03b8+1 \u2192 reverse"},"headline":"A114656 \u2192 \u03b8+1 \u2192 reverse","chain":null}}],"oeis":[],"bfiles":[],"oeis_texts":[{"oeis_id":"","target":"node","first_row":0,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0:   1;\n  1:   2,     2;\n  2:   4,    12,      3;\n  3:   8,    48,     36,      4;\n  4:  16,   160,    240,     80,      5;\n  5:  32,   480,   1200,    800,    150,      6;\n  6:  64,  1344,   5040,   5600,   2100,    252,      7;\n  7: 128,  3584,  18816,  31360,  19600,   4704,    392,     8;\n  8: 256,  9216,  64512, 150528, 141120,  56448,   9408,   576,   9;\n  9: 512, 23040, 207360, 645120, 846720, 508032, 141120, 17280, 810, 10;\n","recurrence_sentence":"The row polynomials satisfy (n^2+n)*P(n,x) = (2*n^2+2*n+(3*n^2+n)*x)*P(n-1,x) + ((4*n+2)*x-(2*n+1)*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[((2*n^2 + 2*n + (3*n^2 + n)*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, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((2*n^2 + 2*n + (3*n^2 + n)*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 - 1, v[i])))};\nT(9)","reading":{"first_row":0,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-8ce61d302cec295b","steps":["reverse","\u03b8+1"],"edges":["e-0ad5e2ffb4ffd4ba","e-ef0d0424646f90c4"],"text":"A114687 \u2192 reverse \u2192 \u03b8+1"},"headline":"A114687 \u2192 reverse \u2192 \u03b8+1","chain":null}