{"id":"n-57c77e76c5c7eb67","revision":0,"first_index":1,"fingerprint":"f6-c8aa5aaa0c2f2cd0","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 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","3"],["1","8","11"],["1","15","51","45"],["1","24","146","304","197"],["1","35","330","1190","1765","903"],["1","48","645","3520","8835","10128","4279"],["1","63","1141","8715","32515","62013","57799","20793"],["1","80","1876","19040","98014","274064","419524","329024","103049"],["1","99","2916","37884","256158","977130","2169300","2766060","1871145","518859"],["1","120","4335","70080","600810","2982000","8949150","16406400","17897925","10639320","2646723"],["1","143","6215","122265","1293930","8078070","31298190","76984050","119893125","114171915","60511803","13648869"],["1","168","8646","203280","2600235","19902960","96347460","303969600","631196775","853038120","720268758","344343024","71039373"],["1","195","11726","324610","4933643","45376617","267752628","1049448972","2779811463","4982835429","5941240734","4503830994","1960751949","372693519"],["1","224","15561","500864","8917909","96960864","683984301","3251449344","10647607971","24232240032","38150787675","40666254720","27960063495","11172756000","1968801519"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","20","112","672","4224","27456","183040","1244672","8599552","60196864","426008576","3042918400","21909012480","158840340480"],"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":[["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","-1","-4"],["1","5","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","2","0","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":180065,"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-7ea83929b8df6dc6"]},{"id":180066,"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-7ea83929b8df6dc6"]},{"id":180067,"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-7ea83929b8df6dc6"]}],"region_exact":{},"incoming_edges":[{"id":"e-7ea83929b8df6dc6","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-57c77e76c5c7eb67","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":"bae32de57b2cb6f4ec41007f36812221aec19ba62a39c24d6d5eb495316ecf25","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-6ad396ce174787e3","role":"sequence","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 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-9c8240e350dcf2c1","kind":"candidate_equal","node_a_id":"n-31d20c36c762bb76","node_b_id":"n-57c77e76c5c7eb67","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-31d20c36c762bb76","other":{"id":"n-31d20c36c762bb76","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 peaks (1 <= k <= n).","first_index":1,"fingerprint":"f6-c8aa5aaa0c2f2cd0","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","3"],["1","8","11"]],"card_rows":[["1"],["1","3"],["1","8","11"],["1","15","51","45"]],"row_sums_preview":["1","4","20","112","672","4224","27456","183040"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["reverse","x \u21a6 x/(x+1)"],"edges":["e-87267df0bda73e27","e-b524faa27b27477b"],"text":"A114656 \u2192 reverse \u2192 x \u21a6 x/(x+1)"},"headline":"A114656 \u2192 reverse \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-175c0b6bb7c23a3f","kind":"fingerprint_related","node_a_id":"n-2a5188b3bacc3f29","node_b_id":"n-57c77e76c5c7eb67","fingerprint":"f6-c8aa5aaa0c2f2cd0","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c8aa5aaa0c2f2cd0"},"other_id":"n-2a5188b3bacc3f29","other":{"id":"n-2a5188b3bacc3f29","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 double rises (0 <= k <= n-1).","first_index":0,"fingerprint":"f6-c8aa5aaa0c2f2cd0","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["3","1"],["11","8","1"]],"card_rows":[["1"],["3","1"],["11","8","1"],["45","51","15","1"]],"row_sums_preview":["1","4","20","112","672","4224","27456","183040"],"regions":["(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-8ce61d302cec295b","steps":["reverse","x \u21a6 x+1"],"edges":["e-0ad5e2ffb4ffd4ba","e-4d97c9c0745dee04"],"text":"A114687 \u2192 reverse \u2192 x \u21a6 x+1"},"headline":"A114687 \u2192 reverse \u2192 x \u21a6 x+1","chain":null}},{"id":"l-8bf45e9e74bd9b1f","kind":"fingerprint_related","node_a_id":"n-6ad396ce174787e3","node_b_id":"n-57c77e76c5c7eb67","fingerprint":"f6-c8aa5aaa0c2f2cd0","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c8aa5aaa0c2f2cd0"},"other_id":"n-6ad396ce174787e3","other":{"id":"n-6ad396ce174787e3","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 peaks (1 <= k <= n).","first_index":1,"fingerprint":"f6-c8aa5aaa0c2f2cd0","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["3","1"],["11","8","1"]],"card_rows":[["1"],["3","1"],["11","8","1"],["45","51","15","1"]],"row_sums_preview":["1","4","20","112","672","4224","27456","183040"],"regions":["(-inf, 0]","(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["basis A007318"],"edges":["e-38a7985c4c1aa2e3"],"text":"A114656 \u2192 basis A007318"},"headline":"A114656 \u2192 basis A007318","chain":null}},{"id":"l-c0836e33e2e02381","kind":"fingerprint_related","node_a_id":"n-57c77e76c5c7eb67","node_b_id":"n-76d02a8ed88dcf78","fingerprint":"f6-c8aa5aaa0c2f2cd0","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c8aa5aaa0c2f2cd0"},"other_id":"n-76d02a8ed88dcf78","other":{"id":"n-76d02a8ed88dcf78","name":"reversal of shift_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-c8aa5aaa0c2f2cd0","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["2"],["2","6"],["2","16","22"]],"card_rows":[["2"],["2","6"],["2","16","22"],["2","30","102","90"]],"row_sums_preview":["2","8","40","224","1344","8448","54912","366080"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-6a30765140629bd5","steps":["x \u21a6 x+1","reverse"],"edges":["e-5ebd2cd7e542e718","e-3883f0f1d619c95a"],"text":"A114655 \u2192 x \u21a6 x+1 \u2192 reverse"},"headline":"A114655 \u2192 x \u21a6 x+1 \u2192 reverse","chain":null}},{"id":"l-d722598bf698f65d","kind":"fingerprint_related","node_a_id":"n-7857580ebfc5510f","node_b_id":"n-57c77e76c5c7eb67","fingerprint":"f6-c8aa5aaa0c2f2cd0","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c8aa5aaa0c2f2cd0"},"other_id":"n-7857580ebfc5510f","other":{"id":"n-7857580ebfc5510f","name":"mobius_x_over_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-c8aa5aaa0c2f2cd0","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["2"],["2","6"],["2","16","22"]],"card_rows":[["2"],["2","6"],["2","16","22"],["2","30","102","90"]],"row_sums_preview":["2","8","40","224","1344","8448","54912","366080"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-6a30765140629bd5","steps":["reverse","x \u21a6 x/(x+1)"],"edges":["e-a35c7072fcaf677b","e-a3117fe3a3841740"],"text":"A114655 \u2192 reverse \u2192 x \u21a6 x/(x+1)"},"headline":"A114655 \u2192 reverse \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-ef81d500c88145b0","kind":"fingerprint_related","node_a_id":"n-968c9f27d7b2c4c9","node_b_id":"n-57c77e76c5c7eb67","fingerprint":"f6-c8aa5aaa0c2f2cd0","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c8aa5aaa0c2f2cd0"},"other_id":"n-968c9f27d7b2c4c9","other":{"id":"n-968c9f27d7b2c4c9","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 double rises (0 <= k <= n-1).","first_index":0,"fingerprint":"f6-c8aa5aaa0c2f2cd0","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","3"],["1","8","11"]],"card_rows":[["1"],["1","3"],["1","8","11"],["1","15","51","45"]],"row_sums_preview":["1","4","20","112","672","4224","27456","183040"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-8ce61d302cec295b","steps":["x \u21a6 x/(x+1)"],"edges":["e-c838eb74321cec2f"],"text":"A114687 \u2192 x \u21a6 x/(x+1)"},"headline":"A114687 \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-fdddb7bb3ce81ccd","kind":"fingerprint_related","node_a_id":"n-25065a706ad43d32","node_b_id":"n-57c77e76c5c7eb67","fingerprint":"f6-c8aa5aaa0c2f2cd0","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-c8aa5aaa0c2f2cd0"},"other_id":"n-25065a706ad43d32","other":{"id":"n-25065a706ad43d32","name":"shift_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-c8aa5aaa0c2f2cd0","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["2"],["6","2"],["22","16","2"]],"card_rows":[["2"],["6","2"],["22","16","2"],["90","102","30","2"]],"row_sums_preview":["2","8","40","224","1344","8448","54912","366080"],"regions":["(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-6a30765140629bd5","steps":["x \u21a6 x+1"],"edges":["e-5ebd2cd7e542e718"],"text":"A114655 \u2192 x \u21a6 x+1"},"headline":"A114655 \u2192 x \u21a6 x+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,  3;\n   3: 1,  8,   11;\n   4: 1, 15,   51,    45;\n   5: 1, 24,  146,   304,    197;\n   6: 1, 35,  330,  1190,   1765,    903;\n   7: 1, 48,  645,  3520,   8835,  10128,    4279;\n   8: 1, 63, 1141,  8715,  32515,  62013,   57799,   20793;\n   9: 1, 80, 1876, 19040,  98014, 274064,  419524,  329024,  103049;\n  10: 1, 99, 2916, 37884, 256158, 977130, 2169300, 2766060, 1871145, 518859;\n","recurrence_sentence":"The row polynomials satisfy (n+1)*P(n,x) = (n+1+(5*n-1)*x+(2*n-4)*x^2)*P(n-1,x) + (2*x-2*x^3)*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 + 1 + (5*n - 1)*x + (2*n - 4)*x^2)*P[n - 1, x] + (2*x - 2*x^3)*D[P[n - 1, x], x])/(n + 1)]];\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 + 1 + (5*n - 1)*x + (2*n - 4)*x^2)*v[i - 1] + (2*x - 2*x^3)*deriv(v[i - 1], x))/(n + 1)); 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":["basis A007318","reverse"],"edges":["e-38a7985c4c1aa2e3","e-7ea83929b8df6dc6"],"text":"A114656 \u2192 basis A007318 \u2192 reverse"},"headline":"A114656 \u2192 basis A007318 \u2192 reverse","chain":null}