{"id":"n-78c1f32e7d3584ec","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 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"],["6","24","8"],["8","72","96","16"],["10","160","480","320","32"],["12","300","1600","2400","960","64"],["14","504","4200","11200","10080","2688","128"],["16","784","9408","39200","62720","37632","7168","256"],["18","1152","18816","112896","282240","301056","129024","18432","512"],["20","1620","34560","282240","1016064","1693440","1290240","414720","46080","1024"],["22","2200","59400","633600","3104640","7451136","8870400","5068800","1267200","112640","2048"],["24","2904","96800","1306800","8363520","27320832","46835712","41817600","18585600","3717120","270336","4096"],["26","3744","151008","2516800","20386080","86980608","202954752","260941824","181209600","64430080","10543104","638976","8192"],["28","4732","227136","4580576","45805760","247351104","753831936","1319205888","1319205888","732892160","213204992","29073408","1490944","16384"],["30","5880","331240","7949760","96192096","641280640","2473511040","5653739520","7695367680","6156294144","2798315520","678379520","78274560","3440640","32768"]],"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:reversal","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["2"]],"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":179491,"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-09fa0d29f4904372"]},{"id":179492,"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-09fa0d29f4904372"]},{"id":179493,"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-09fa0d29f4904372"]}],"region_exact":{},"incoming_edges":[{"id":"e-09fa0d29f4904372","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-78c1f32e7d3584ec","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":"00a745417087ca574658736dd7ca2473f395cf5eb9bb372f9d160dc15a62449e","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-7f47b2246e50a89b","role":"sequence","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.","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-7810b6a940760a07","kind":"fingerprint_related","node_a_id":"n-78c1f32e7d3584ec","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-86941f6c195d1c91","kind":"fingerprint_related","node_a_id":"n-9d80e1b19273e824","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-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-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-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-c3f3fca3eb902c2d","kind":"fingerprint_related","node_a_id":"n-7f47b2246e50a89b","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-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-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-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":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:  6,   24,     8;\n   4:  8,   72,    96,     16;\n   5: 10,  160,   480,    320,      32;\n   6: 12,  300,  1600,   2400,     960,      64;\n   7: 14,  504,  4200,  11200,   10080,    2688,     128;\n   8: 16,  784,  9408,  39200,   62720,   37632,    7168,    256;\n   9: 18, 1152, 18816, 112896,  282240,  301056,  129024,  18432,   512;\n  10: 20, 1620, 34560, 282240, 1016064, 1693440, 1290240, 414720, 46080, 1024;\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) = 2.","mathematica":"P[1, x_] := 2;\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] = 2; 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-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}