{"id":"n-b4f19b398a718e0e","revision":0,"first_index":1,"fingerprint":"f6-77e051dbf841d62e","name":"shift_x_plus_one 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"],["4","1"],["20","10","1"],["112","84","18","1"],["672","672","224","28","1"],["4224","5280","2400","480","40","1"],["27456","41184","23760","6600","900","54","1"],["183040","320320","224224","80080","15400","1540","70","1"],["1244672","2489344","2050048","896896","224224","32032","2464","88","1"],["8599552","19348992","18330624","9504768","2935296","550368","61152","3744","108","1"],["60196864","150492160","161241600","96744960","35642880","8316672","1223040","109200","5460","130","1"],["426008576","1171523584","1400734720","955046400","409305600","114605568","21111552","2513280","184800","7700","154","1"],["3042918400","9128755200","12049956864","9204828160","4502361600","1473500160","327444480","49116672","4847040","299200","10560","180","1"],["21909012480","71204290560","102850641920","87027466240","47865106432","17949414912","4682456064","851355648","106419456","8868288","466752","14144","208","1"],["158840340480","555941191680","872252559360","809948805120","494968714240","209409840640","62822952192","13462061184","2048574528","217273056","15519504","705432","18564","238","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","31","215","1597","12425","99955","824675","6939769","59334605","513972967","4501041935","39784038517","354455513105","3179928556219"],"nonn":true,"definitions":[{"position":0,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-4","-3"],["8","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-4","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}},{"position":1,"source":"derived:basis_map_A007318","source_kind":"derived","equality_edge_id":"e-43ded58dbe73c25e","recurrence":{"first_index":1,"initial_polynomials":[["1"],["4","1"]],"recurrence":{"denominator":{"coeffs":[["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","2"],["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-4","-1"],["8","2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":180060,"position":0,"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-5ed4aa7494f18ecc"]},{"id":180061,"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-5ed4aa7494f18ecc","e-a6e05d3b19b71004"]},{"id":180062,"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-5ed4aa7494f18ecc","e-a6e05d3b19b71004"]},{"id":180063,"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-5ed4aa7494f18ecc","e-a6e05d3b19b71004"]},{"id":180064,"position":4,"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-a6e05d3b19b71004"]}],"region_exact":{},"incoming_edges":[{"id":"e-a6e05d3b19b71004","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-b4f19b398a718e0e","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":"b7b6926c911670d937bbbad956bcf6b25c8398c501354b2555238929468d775f","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-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]"}]},{"id":"e-43ded58dbe73c25e","operation":{"operation":"definition_equality"},"operation_detail":null,"conclusion_id":"n-b4f19b398a718e0e","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":"ab619a55306b3f126be826866d96d861d4d29bd971ad5e8b658bddaf3c73a71f","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[],"premises":[]},{"id":"e-5ed4aa7494f18ecc","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-b4f19b398a718e0e","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":"e9e4d5007bc25ddb47f844a30f0a687e41c8754c1ca16e85b0c878db872b66ec","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-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-974ebf1b0ab2e18b","kind":"fingerprint_related","node_a_id":"n-b4f19b398a718e0e","node_b_id":"n-8a7f4c5c028e757f","fingerprint":"f6-77e051dbf841d62e","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-77e051dbf841d62e"},"other_id":"n-8a7f4c5c028e757f","other":{"id":"n-8a7f4c5c028e757f","name":"shift_x_plus_one 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-77e051dbf841d62e","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["2"],["8","2"],["40","20","2"]],"card_rows":[["2"],["8","2"],["40","20","2"],["224","168","36","2"]],"row_sums_preview":["2","10","62","430","3194","24850","199910","1649350"],"regions":["(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-6a30765140629bd5","steps":["x \u21a6 x+1","x \u21a6 x+1"],"edges":["e-5ebd2cd7e542e718","e-2c7c6c8ed6291ecb"],"text":"A114655 \u2192 x \u21a6 x+1 \u2192 x \u21a6 x+1"},"headline":"A114655 \u2192 x \u21a6 x+1 \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:       4,        1;\n   3:      20,       10,        1;\n   4:     112,       84,       18,       1;\n   5:     672,      672,      224,      28,       1;\n   6:    4224,     5280,     2400,     480,      40,      1;\n   7:   27456,    41184,    23760,    6600,     900,     54,     1;\n   8:  183040,   320320,   224224,   80080,   15400,   1540,    70,    1;\n   9: 1244672,  2489344,  2050048,  896896,  224224,  32032,  2464,   88,   1;\n  10: 8599552, 19348992, 18330624, 9504768, 2935296, 550368, 61152, 3744, 108, 1;\n","recurrence_sentence":"The row polynomials satisfy (n+1)*P(n,x) = (8*n-4+(3*n-3)*x)*P(n-1,x) - (4*x+2*x^2)*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[((8*n - 4 + (3*n - 3)*x)*P[n - 1, x] - (4*x + 2*x^2)*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] = ((8*n - 4 + (3*n - 3)*x)*v[i - 1] - (4*x + 2*x^2)*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","x \u21a6 x+1"],"edges":["e-38a7985c4c1aa2e3","e-5ed4aa7494f18ecc"],"text":"A114656 \u2192 basis A007318 \u2192 x \u21a6 x+1"},"headline":"A114656 \u2192 basis A007318 \u2192 x \u21a6 x+1","chain":null}