{"id":"n-bd61f7a659e54e52","revision":0,"first_index":0,"fingerprint":"f6-acc791d1c44ba380","name":"mobius_x_over_x_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","3"],["4","14","11"],["8","48","84","45"],["16","144","416","484","197"],["32","400","1680","3160","2750","903"],["64","1056","6000","16120","22380","15546","4279"],["128","2688","19712","70560","138320","151872","87752","20793"],["256","6656","60928","277760","718144","1104320","1001728","495368","103049"],["512","16128","179712","1010688","3298176","6640704","8385216","6475824","2798586","518859"],["1024","38400","510720","3459840","13816320","34882176","57355200","61368240","41246580","15827910","2646723"],["2048","90112","1408000","11278080","53856000","165403392","339322368","470738400","436686360","259741680","89625756","13648869"],["4096","208896","3784704","35312640","198063360","723469824","1797210624","3098468736","3713838480","3039445200","1621094112","508129452","71039373"],["8192","479232","9957376","106895360","694160896","2963380992","8718488064","18134907648","26926332576","28391570064","20781618000","10044902088","2884263798","372693519"],["16384","1089536","25718784","314402816","2336029696","11493081600","39364765440","96647041920","172616283840","224865697056","211548280944","140023292136","61875173724","16390465266","1968801519"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","29","185","1257","8925","65445","491825","3768209","29324405","231153133","1841801065","14810069497","120029657805","979470140661"],"nonn":true,"definitions":[{"position":0,"source":"derived:mobius_x_over_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["2","4","2"],["1","2","1"]]},"terms":[{"coeff":{"coeffs":[["4","16","22","12","2"],["2","5","2","-3","-2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","4","14","18","10","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":176575,"position":0,"claim":"real_rooted","from_index":0,"region_key":"[-1, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":true,"value":"-1"},"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in [-1, 0]","region_exact":null,"edges":["e-34ee51153b1773b2"]},{"id":176576,"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-34ee51153b1773b2"]},{"id":176577,"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-34ee51153b1773b2"]}],"region_exact":{},"incoming_edges":[{"id":"e-34ee51153b1773b2","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"mobius\",\"a\":\"1\",\"b\":\"0\",\"c\":\"1\",\"e\":\"1\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}"},"operation_detail":"mobius, shift 0","conclusion_id":"n-bd61f7a659e54e52","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":"fTransform","lean_declarations":["RealRooted.splits_fPolynomial"],"certificate_hash":"e8e27fee24c7b257387cb049927554ce2710f4edfbc5ac25bc05500402dc07db","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":true,"value":"-1"},"upper":{"closed":true,"value":"0"}}}],"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-218fe0839abf1b5a","kind":"candidate_equal","node_a_id":"n-bd61f7a659e54e52","node_b_id":"n-564c31896f63b482","fingerprint":null,"oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"reason":"no all-index equality certificate was found","rows_compared":15},"other_id":"n-564c31896f63b482","other":{"id":"n-564c31896f63b482","name":"reversal of basis_map_A007318 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-acc791d1c44ba380","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","3"],["4","14","11"]],"card_rows":[["1"],["2","3"],["4","14","11"],["8","48","84","45"]],"row_sums_preview":["1","5","29","185","1257","8925","65445","491825"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-8ce61d302cec295b","steps":["basis A007318","reverse"],"edges":["e-6804282af6df94ec","e-302c57842721c235"],"text":"A114687 \u2192 basis A007318 \u2192 reverse"},"headline":"A114687 \u2192 basis A007318 \u2192 reverse","chain":null}},{"id":"l-50e95ae21cf40dd6","kind":"fingerprint_related","node_a_id":"n-bd61f7a659e54e52","node_b_id":"n-31a1b9b1779ea532","fingerprint":"f6-acc791d1c44ba380","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-acc791d1c44ba380"},"other_id":"n-31a1b9b1779ea532","other":{"id":"n-31a1b9b1779ea532","name":"basis_map_A013609 of shift_x_plus_one of Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).","first_index":0,"fingerprint":"f6-acc791d1c44ba380","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["6","4"],["33","42","12"]],"card_rows":[["1"],["6","4"],["33","42","12"],["180","336","192","32"]],"row_sums_preview":["1","10","87","740","6285","53550","458115","3934600"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-984320118b653f6b","steps":["basis A007318","basis A013609"],"edges":["e-2345ffa617ccabd7","e-58c7c138b5508493"],"text":"A132812 \u2192 basis A007318 \u2192 basis A013609"},"headline":"A132812 \u2192 basis A007318 \u2192 basis A013609","chain":null}},{"id":"l-99df9b15696cdd6b","kind":"fingerprint_related","node_a_id":"n-b6cda967a092feb1","node_b_id":"n-bd61f7a659e54e52","fingerprint":"f6-acc791d1c44ba380","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-acc791d1c44ba380"},"other_id":"n-b6cda967a092feb1","other":{"id":"n-b6cda967a092feb1","name":"basis_map_A007318 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-acc791d1c44ba380","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["3","2"],["11","14","4"]],"card_rows":[["1"],["3","2"],["11","14","4"],["45","84","48","8"]],"row_sums_preview":["1","5","29","185","1257","8925","65445","491825"],"regions":["(-inf, 0]","(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-8ce61d302cec295b","steps":["basis A007318"],"edges":["e-6804282af6df94ec"],"text":"A114687 \u2192 basis A007318"},"headline":"A114687 \u2192 basis A007318","chain":null}},{"id":"l-9c06d288bcf3fa59","kind":"fingerprint_related","node_a_id":"n-bd61f7a659e54e52","node_b_id":"n-31db8029f5c1d671","fingerprint":"f6-acc791d1c44ba380","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-acc791d1c44ba380"},"other_id":"n-31db8029f5c1d671","other":{"id":"n-31db8029f5c1d671","name":"shift_x_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).","first_index":1,"fingerprint":"f6-acc791d1c44ba380","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["3","2"],["11","14","4"]],"card_rows":[["1"],["3","2"],["11","14","4"],["45","84","48","8"]],"row_sums_preview":["1","5","29","185","1257","8925","65445","491825"],"regions":["(-inf, -1]","(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["reverse","x \u21a6 x+1"],"edges":["e-87267df0bda73e27","e-9d1d77717d3adaeb"],"text":"A114656 \u2192 reverse \u2192 x \u21a6 x+1"},"headline":"A114656 \u2192 reverse \u2192 x \u21a6 x+1","chain":null}},{"id":"l-a0088c65aa903195","kind":"fingerprint_related","node_a_id":"n-bd61f7a659e54e52","node_b_id":"n-36ea7ad71f537a76","fingerprint":"f6-acc791d1c44ba380","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-acc791d1c44ba380"},"other_id":"n-36ea7ad71f537a76","other":{"id":"n-36ea7ad71f537a76","name":"shift_x_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-acc791d1c44ba380","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["2"],["6","4"],["22","28","8"]],"card_rows":[["2"],["6","4"],["22","28","8"],["90","168","96","16"]],"row_sums_preview":["2","10","58","370","2514","17850","130890","983650"],"regions":["(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-6a30765140629bd5","steps":["reverse","x \u21a6 x+1"],"edges":["e-a35c7072fcaf677b","e-9b41b0551a9c258e"],"text":"A114655 \u2192 reverse \u2192 x \u21a6 x+1"},"headline":"A114655 \u2192 reverse \u2192 x \u21a6 x+1","chain":null}},{"id":"l-b9412f8a27ba4c0f","kind":"fingerprint_related","node_a_id":"n-40fe41bf121fa8b3","node_b_id":"n-bd61f7a659e54e52","fingerprint":"f6-acc791d1c44ba380","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-acc791d1c44ba380"},"other_id":"n-40fe41bf121fa8b3","other":{"id":"n-40fe41bf121fa8b3","name":"mobius_x_over_x_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-acc791d1c44ba380","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","3"],["4","14","11"]],"card_rows":[["1"],["2","3"],["4","14","11"],["8","48","84","45"]],"row_sums_preview":["1","5","29","185","1257","8925","65445","491825"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["x \u21a6 x/(x+1)"],"edges":["e-0286c892acd84d8a"],"text":"A114656 \u2192 x \u21a6 x/(x+1)"},"headline":"A114656 \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-ea3b126a0de6ae7a","kind":"fingerprint_related","node_a_id":"n-4a5cb5ea4703a9a6","node_b_id":"n-bd61f7a659e54e52","fingerprint":"f6-acc791d1c44ba380","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-acc791d1c44ba380"},"other_id":"n-4a5cb5ea4703a9a6","other":{"id":"n-4a5cb5ea4703a9a6","name":"mobius_x_over_x_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-acc791d1c44ba380","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["2"],["4","6"],["8","28","22"]],"card_rows":[["2"],["4","6"],["8","28","22"],["16","96","168","90"]],"row_sums_preview":["2","10","58","370","2514","17850","130890","983650"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-6a30765140629bd5","steps":["x \u21a6 x/(x+1)"],"edges":["e-460d39e35063c243"],"text":"A114655 \u2192 x \u21a6 x/(x+1)"},"headline":"A114655 \u2192 x \u21a6 x/(x+1)","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,     3;\n  2:   4,    14,     11;\n  3:   8,    48,     84,      45;\n  4:  16,   144,    416,     484,     197;\n  5:  32,   400,   1680,    3160,    2750,     903;\n  6:  64,  1056,   6000,   16120,   22380,   15546,    4279;\n  7: 128,  2688,  19712,   70560,  138320,  151872,   87752,   20793;\n  8: 256,  6656,  60928,  277760,  718144, 1104320, 1001728,  495368,  103049;\n  9: 512, 16128, 179712, 1010688, 3298176, 6640704, 8385216, 6475824, 2798586, 518859;\n","recurrence_sentence":"The row polynomials satisfy (n+2+(2*n+4)*x+(n+2)*x^2)*P(n,x) = (2*n+4+(5*n+16)*x+(2*n+22)*x^2-(3*n-12)*x^3-(2*n-2)*x^4)*P(n-1,x) + (4*x+14*x^2+18*x^3+10*x^4+2*x^5)*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 + 4 + (5*n + 16)*x + (2*n + 22)*x^2 - (3*n - 12)*x^3 - (2*n - 2)*x^4)*P[n - 1, x] + (4*x + 14*x^2 + 18*x^3 + 10*x^4 + 2*x^5)*D[P[n - 1, x], x])/(n + 2 + (2*n + 4)*x + (n + 2)*x^2)]];\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 + 4 + (5*n + 16)*x + (2*n + 22)*x^2 - (3*n - 12)*x^3 - (2*n - 2)*x^4)*v[i - 1] + (4*x + 14*x^2 + 18*x^3 + 10*x^4 + 2*x^5)*deriv(v[i - 1], x))/(n + 2 + (2*n + 4)*x + (n + 2)*x^2)); 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","x \u21a6 x/(x+1)"],"edges":["e-0ad5e2ffb4ffd4ba","e-34ee51153b1773b2"],"text":"A114687 \u2192 reverse \u2192 x \u21a6 x/(x+1)"},"headline":"A114687 \u2192 reverse \u2192 x \u21a6 x/(x+1)","chain":null}