{"id":"n-b6cda967a092feb1","revision":2,"first_index":0,"fingerprint":"f6-acc791d1c44ba380","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).","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"],["3","2"],["11","14","4"],["45","84","48","8"],["197","484","416","144","16"],["903","2750","3160","1680","400","32"],["4279","15546","22380","16120","6000","1056","64"],["20793","87752","151872","138320","70560","19712","2688","128"],["103049","495368","1001728","1104320","718144","277760","60928","6656","256"],["518859","2798586","6475824","8385216","6640704","3298176","1010688","179712","16128","512"],["2646723","15827910","41246580","61368240","57355200","34882176","13816320","3459840","510720","38400","1024"],["13648869","89625756","259741680","436686360","470738400","339322368","165403392","53856000","11278080","1408000","90112","2048"],["71039373","508129452","1621094112","3039445200","3713838480","3098468736","1797210624","723469824","198063360","35312640","3784704","208896","4096"],["372693519","2884263798","10044902088","20781618000","28391570064","26926332576","18134907648","8718488064","2963380992","694160896","106895360","9957376","479232","8192"],["1968801519","16390465266","61875173724","140023292136","211548280944","224865697056","172616283840","96647041920","39364765440","11493081600","2336029696","314402816","25718784","1089536","16384"]],"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:basis_map_A007318","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["3","2"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["1","4","4"],["-1","-4","-4"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["3","2"],["6","4"]]},"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-fa78f1f74242ae8d","recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["2"],["1"]]},"terms":[{"coeff":{"coeffs":[["2","0"],["7","6"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-2","-6","-4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":161794,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-6804282af6df94ec","e-beda254f8b34ffbd"]},{"id":161795,"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-6804282af6df94ec","e-beda254f8b34ffbd","e-e0f21b832b616e71"]},{"id":161796,"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-6804282af6df94ec","e-beda254f8b34ffbd","e-e0f21b832b616e71"]},{"id":161797,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-6804282af6df94ec","e-beda254f8b34ffbd","e-e0f21b832b616e71"]},{"id":161798,"position":4,"claim":"real_rooted","from_index":0,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-e0f21b832b616e71"]}],"region_exact":{},"incoming_edges":[{"id":"e-6804282af6df94ec","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-b6cda967a092feb1","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":"4146c6c871a345d5f51f64545d4a9f4bdeebbd1f2071666df6f71055d14ddc5e","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-8ce61d302cec295b","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 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]"}]},{"id":"e-beda254f8b34ffbd","operation":{"map":"A013609","operation":"basis_map"},"operation_detail":"A013609","conclusion_id":"n-b6cda967a092feb1","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":"43e4859a77b0a0a55ac9d58864fc674c84bebe4d2460b3158a3923a7ed2d8b66","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-57b4b14604f4c0d7","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks at level one (n >= 1; 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]"}]},{"id":"e-fa78f1f74242ae8d","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-b6cda967a092feb1","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":"2b63a36589f8b430381f76a72e81f679b50331c71fad87323fd961e6ec1063c9","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-e0f21b832b616e71","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-b6cda967a092feb1","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":"aaa5b57db29211717c58ce94b66838fa44431d362f161c70be9db8bfc9ecb0b7","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-8ce61d302cec295b","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 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-1251c471af319085","kind":"fingerprint_related","node_a_id":"n-b6cda967a092feb1","node_b_id":"n-4a5cb5ea4703a9a6","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}},{"id":"l-6b8a4a114f406cf6","kind":"fingerprint_related","node_a_id":"n-b6cda967a092feb1","node_b_id":"n-40fe41bf121fa8b3","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-0ef4f125a00bfba4","kind":"oeis_match","node_a_id":"n-b6cda967a092feb1","node_b_id":null,"fingerprint":null,"oeis_id":"A059231","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A059231","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-9df03e22de47745e","kind":"oeis_match","node_a_id":"n-b6cda967a092feb1","node_b_id":null,"fingerprint":null,"oeis_id":"A127846","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A127846","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A059231","relation":"match_row_sums"},{"oeis_id":"A127846","relation":"match_row_sums"}],"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:      3,       2;\n  2:     11,      14,       4;\n  3:     45,      84,      48,       8;\n  4:    197,     484,     416,     144,      16;\n  5:    903,    2750,    3160,    1680,     400,      32;\n  6:   4279,   15546,   22380,   16120,    6000,    1056,      64;\n  7:  20793,   87752,  151872,  138320,   70560,   19712,    2688,    128;\n  8: 103049,  495368, 1001728, 1104320,  718144,  277760,   60928,   6656,   256;\n  9: 518859, 2798586, 6475824, 8385216, 6640704, 3298176, 1010688, 179712, 16128, 512;\n","recurrence_sentence":"The row polynomials satisfy (n+2)*P(n,x) = -(n-1+(4*n-4)*x+(4*n-4)*x^2)*P(n-2,x) + (6*n+3+(4*n+2)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 2*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 3 + 2*x;\nP[n_, x_] := P[n, x] = Expand[Together[(-(n - 1 + (4*n - 4)*x + (4*n - 4)*x^2)*P[n - 2, x] + (6*n + 3 + (4*n + 2)*x)*P[n - 1, x])/(n + 2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 3 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n - 1 + (4*n - 4)*x + (4*n - 4)*x^2)*v[i - 2] + (6*n + 3 + (4*n + 2)*x)*v[i - 1])/(n + 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":["basis A007318"],"edges":["e-6804282af6df94ec"],"text":"A114687 \u2192 basis A007318"},"headline":"A114687 \u2192 basis A007318","chain":null}