{"id":"n-587271daecb2c809","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 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).","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":[["1"],["1","4"],["1","12","12"],["1","24","72","32"],["1","40","240","320","80"],["1","60","600","1600","1200","192"],["1","84","1260","5600","8400","4032","448"],["1","112","2352","15680","39200","37632","12544","1024"],["1","144","4032","37632","141120","225792","150528","36864","2304"],["1","180","6480","80640","423360","1016064","1128960","552960","103680","5120"],["1","220","9900","158400","1108800","3725568","6209280","5068800","1900800","281600","11264"],["1","264","14520","290400","2613600","11708928","27320832","33454080","20908800","6195200","743424","24576"],["1","312","20592","503360","5662800","32617728","101477376","173961216","163088640","80537600","19329024","1916928","53248"],["1","364","28392","832832","11451440","82450368","329801472","753831936","989404416","732892160","293156864","58146816","4845568","114688"],["1","420","38220","1324960","21861840","192384192","961920960","2826869760","4947022080","5130245120","3078147072","1017569280","169594880","12042240","245760"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","25","129","681","3653","19825","108545","598417","3317445","18474633","103274625","579168825","3256957317","18359266785"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"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":176675,"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-bd31a37f32a8c0aa"]},{"id":176676,"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-bd31a37f32a8c0aa"]},{"id":176677,"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-bd31a37f32a8c0aa"]},{"id":176678,"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-bd31a37f32a8c0aa"]}],"region_exact":{},"incoming_edges":[{"id":"e-bd31a37f32a8c0aa","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-587271daecb2c809","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":"a971c017256f7fdef7ee4a03f44606c95eb7905c8b95a6dd87bead0c4a5996f9","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-c3c79310b753c17e","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 peaks (1 <= k <= n).","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-3c7a930fb8e08ba0","kind":"fingerprint_related","node_a_id":"n-916d0051af2e0118","node_b_id":"n-587271daecb2c809","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-6851d7c839fdd368","kind":"fingerprint_related","node_a_id":"n-587271daecb2c809","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}},{"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-d6831a2f321e9d14","other":{"id":"n-d6831a2f321e9d14","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.","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":[["2"],["2","8"],["2","24","24"]],"card_rows":[["2"],["2","8"],["2","24","24"],["2","48","144","64"]],"row_sums_preview":["2","10","50","258","1362","7306","39650","217090"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"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}}],"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: 1;\n   2: 1,   4;\n   3: 1,  12,   12;\n   4: 1,  24,   72,    32;\n   5: 1,  40,  240,   320,     80;\n   6: 1,  60,  600,  1600,   1200,     192;\n   7: 1,  84, 1260,  5600,   8400,    4032,     448;\n   8: 1, 112, 2352, 15680,  39200,   37632,   12544,   1024;\n   9: 1, 144, 4032, 37632, 141120,  225792,  150528,  36864,   2304;\n  10: 1, 180, 6480, 80640, 423360, 1016064, 1128960, 552960, 103680, 5120;\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) = 1.","mathematica":"P[1, x_] := 1;\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] = 1; 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-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}