{"id":"n-6ad396ce174787e3","revision":2,"first_index":1,"fingerprint":"f6-c8aa5aaa0c2f2cd0","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).","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"],["3","1"],["11","8","1"],["45","51","15","1"],["197","304","146","24","1"],["903","1765","1190","330","35","1"],["4279","10128","8835","3520","645","48","1"],["20793","57799","62013","32515","8715","1141","63","1"],["103049","329024","419524","274064","98014","19040","1876","80","1"],["518859","1871145","2766060","2169300","977130","256158","37884","2916","99","1"],["2646723","10639320","17897925","16406400","8949150","2982000","600810","70080","4335","120","1"],["13648869","60511803","114171915","119893125","76984050","31298190","8078070","1293930","122265","6215","143","1"],["71039373","344343024","720268758","853038120","631196775","303969600","96347460","19902960","2600235","203280","8646","168","1"],["372693519","1960751949","4503830994","5941240734","4982835429","2779811463","1049448972","267752628","45376617","4933643","324610","11726","195","1"],["1968801519","11172756000","27960063495","40666254720","38150787675","24232240032","10647607971","3251449344","683984301","96960864","8917909","500864","15561","224","1"]],"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:basis_map_A007318","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["3","1"]],"recurrence":{"denominator":{"coeffs":[["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["2","-4","2"],["-1","2","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-3","-1"],["6","2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},{"position":1,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":"e-21dd78e181b91ed1","recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-1","-3"],["5","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["2","0","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":161774,"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-38a7985c4c1aa2e3"]},{"id":161775,"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-38a7985c4c1aa2e3","e-f0928c2ecfeb4b08"]},{"id":161776,"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-38a7985c4c1aa2e3","e-f0928c2ecfeb4b08"]},{"id":161777,"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-38a7985c4c1aa2e3","e-f0928c2ecfeb4b08"]},{"id":161778,"position":4,"claim":"real_rooted","from_index":1,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-f0928c2ecfeb4b08"]}],"region_exact":{},"incoming_edges":[{"id":"e-38a7985c4c1aa2e3","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-6ad396ce174787e3","premise_count":1,"theorem":"geometric family P_k = g(t) (a + d t)^k: T(p) = g(t) p(a + d t), so the roots of T(p) are those of g and the points (r - a)/d for the roots r of p (elementary)","lean_route":null,"lean_declarations":[],"certificate_hash":"30e69d3c1d2a11957fc94ed2374bbfc3a847c8e9861841d75bc59aafd44504c1","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-0d75f6272d2a2a84","role":"sequence","name":"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]"}]},{"id":"e-21dd78e181b91ed1","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-6ad396ce174787e3","premise_count":0,"theorem":"all-index identity Q_n = P_n certified by exact Ore-algebra division and identifying rows (polytool preserver-image certificate of the identity map)","lean_route":null,"lean_declarations":[],"certificate_hash":"fce3611117cc660cab010a0714a450737a786885a739548a775c9d1b820104dc","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-f0928c2ecfeb4b08","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-6ad396ce174787e3","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":null,"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"certificate_hash":"07088823e195101b4c794b717764a12d3105dbf7921f6dc1a9faa4a06f270a53","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"-1"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-0d75f6272d2a2a84","role":"sequence","name":"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-168c1da812505968","kind":"fingerprint_related","node_a_id":"n-6ad396ce174787e3","node_b_id":"n-968c9f27d7b2c4c9","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-77c7d396c1059f0b","kind":"fingerprint_related","node_a_id":"n-6ad396ce174787e3","node_b_id":"n-25065a706ad43d32","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}},{"id":"l-6f962830067adb11","kind":"oeis_match","node_a_id":"n-6ad396ce174787e3","node_b_id":null,"fingerprint":null,"oeis_id":"A003645","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A003645","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A003645","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-6ad396ce174787e3","oeis_id":"A003645","target":"row_sums","oeis_offset":0,"first_row":1,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":23,"oeis_terms_available":23,"term_count":200,"raw_size":18469}],"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:      3,       1;\n   3:     11,       8,       1;\n   4:     45,      51,      15,       1;\n   5:    197,     304,     146,      24,      1;\n   6:    903,    1765,    1190,     330,     35,      1;\n   7:   4279,   10128,    8835,    3520,    645,     48,     1;\n   8:  20793,   57799,   62013,   32515,   8715,   1141,    63,    1;\n   9: 103049,  329024,  419524,  274064,  98014,  19040,  1876,   80,  1;\n  10: 518859, 1871145, 2766060, 2169300, 977130, 256158, 37884, 2916, 99, 1;\n","recurrence_sentence":"The row polynomials satisfy (n+1)*P(n,x) = -(n-2-(2*n-4)*x+(n-2)*x^2)*P(n-2,x) + (6*n-3+(2*n-1)*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 3 + x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 3 + x;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n - 2 - (2*n - 4)*x + (n - 2)*x^2)*P[n - 2, x] + (6*n - 3 + (2*n - 1)*x)*P[n - 1, x])/(n + 1)]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 3 + x; for(n = 3, N, my(i = n); v[i] = (-(n - 2 - (2*n - 4)*x + (n - 2)*x^2)*v[i - 2] + (6*n - 3 + (2*n - 1)*x)*v[i - 1])/(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"],"edges":["e-38a7985c4c1aa2e3"],"text":"A114656 \u2192 basis A007318"},"headline":"A114656 \u2192 basis A007318","chain":null}