{"id":"n-69ce0ad43c657483","revision":0,"first_index":1,"fingerprint":"f6-c5faa49c64af63fa","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).","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"],["2","2"],["3","12","4"],["4","36","48","8"],["5","80","240","160","16"],["6","150","800","1200","480","32"],["7","252","2100","5600","5040","1344","64"],["8","392","4704","19600","31360","18816","3584","128"],["9","576","9408","56448","141120","150528","64512","9216","256"],["10","810","17280","141120","508032","846720","645120","207360","23040","512"],["11","1100","29700","316800","1552320","3725568","4435200","2534400","633600","56320","1024"],["12","1452","48400","653400","4181760","13660416","23417856","20908800","9292800","1858560","135168","2048"],["13","1872","75504","1258400","10193040","43490304","101477376","130470912","90604800","32215040","5271552","319488","4096"],["14","2366","113568","2290288","22902880","123675552","376915968","659602944","659602944","366446080","106602496","14536704","745472","8192"],["15","2940","165620","3974880","48096048","320640320","1236755520","2826869760","3847683840","3078147072","1399157760","339189760","39137280","1720320","16384"]],"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:reversal","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"],["0","-12"],["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":178705,"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-8523f428ac45163c"]},{"id":178706,"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-8523f428ac45163c"]},{"id":178707,"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-8523f428ac45163c"]}],"region_exact":{},"incoming_edges":[{"id":"e-8523f428ac45163c","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"reversal\",\"schedule\":{\"first_index\":1,\"first_degree\":0,\"step\":1}}"},"operation_detail":"reversal, shift 0","conclusion_id":"n-69ce0ad43c657483","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":"reversed","lean_declarations":["RealRooted.X_pow_mul_reverse_eq_zero_or_splits","RealRooted.reflect_eq_zero_or_splits"],"certificate_hash":"7a3ec39d2ceda28253000b7203c7112ae3f3ccd5639d395d3fd95ffbc6eab710","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-9d80e1b19273e824","role":"sequence","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).","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-6240e4d029de6a12","kind":"fingerprint_related","node_a_id":"n-7f47b2246e50a89b","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-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-ad142032ab0713f6","kind":"fingerprint_related","node_a_id":"n-9d80e1b19273e824","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-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-e0ee780a281ae5e2","kind":"fingerprint_related","node_a_id":"n-69ce0ad43c657483","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-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-7e8d73671f213694","other":{"id":"n-7e8d73671f213694","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).","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":[["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-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}},{"id":"l-fb594a71349170d2","kind":"fingerprint_related","node_a_id":"n-69ce0ad43c657483","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}}],"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:  2,   2;\n   3:  3,  12,     4;\n   4:  4,  36,    48,      8;\n   5:  5,  80,   240,    160,     16;\n   6:  6, 150,   800,   1200,    480,     32;\n   7:  7, 252,  2100,   5600,   5040,   1344,     64;\n   8:  8, 392,  4704,  19600,  31360,  18816,   3584,    128;\n   9:  9, 576,  9408,  56448, 141120, 150528,  64512,   9216,   256;\n  10: 10, 810, 17280, 141120, 508032, 846720, 645120, 207360, 23040, 512;\n","recurrence_sentence":"The row polynomials satisfy (n^2-n)*P(n,x) = (n^2+(6*n^2-12*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 + (6*n^2 - 12*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 + (6*n^2 - 12*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":["\u03b8+1","reverse"],"edges":["e-57c7b63013beaaa7","e-8523f428ac45163c"],"text":"A114656 \u2192 \u03b8+1 \u2192 reverse"},"headline":"A114656 \u2192 \u03b8+1 \u2192 reverse","chain":null}