{"id":"n-b455bb8d8c0e1d5c","revision":0,"first_index":1,"fingerprint":"f6-3ff6c47fdabd4f1c","name":"mobius_x_over_x_plus_one of theta_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).","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"],["2","4"],["4","20","19"],["8","72","156","96"],["16","224","816","1104","501"],["32","640","3440","7600","7430","2668"],["64","1728","12720","40480","63540","48516","14407"],["128","4480","43008","183680","409360","496272","310520","78592"],["256","11264","136192","745472","2201920","3753344","3699136","1959488","432073"],["512","27648","410112","2784768","10426752","23353344","32133696","26650944","12235626","2390004"],["1024","66560","1186560","9753600","44862720","126395136","227075520","261525120","187114500","75785940","13286043"],["2048","157696","3322880","32440320","179055360","615428352","1382836224","2069295360","2047223640","1287357720","466399956","74160672"],["4096","368640","9056256","103403520","672503040","2756312064","7516185600","14004486144","17932202640","15539098080","8713699632","2855365200","415382397"],["8192","851968","24121344","318050304","2401850880","11532837888","37322368512","84049844736","133527547296","149284037760","115031517744","58193971056","17405625198","2333445468"],["16384","1949696","62992384","948985856","8221717504","45598192640","172115623680","458258211840","877017261120","1212959267520","1202702605104","834086381856","384307382004","105716166276","13141557519"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","43","332","2661","21810","181455","1526040","12939145","110413406","947052723","8157680228","70518067309","611426078346","5315138311383"],"nonn":true,"definitions":[{"position":0,"source":"derived:mobius_x_over_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0","0","0"],["-1","-2","-1"],["1","2","1"]]},"terms":[{"coeff":{"coeffs":[["0","-2","-6","-6","-2"],["-2","-1","9","13","5"],["2","5","2","-3","-2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-2","-7","-9","-5","-1"],["0","4","14","18","10","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":178708,"position":0,"claim":"real_rooted","from_index":1,"region_key":"[-1, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":true,"value":"-1"},"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in [-1, 0]","region_exact":null,"edges":["e-6ef7ffa1390aca1b"]},{"id":178709,"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-6ef7ffa1390aca1b"]},{"id":178710,"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-6ef7ffa1390aca1b"]}],"region_exact":{},"incoming_edges":[{"id":"e-6ef7ffa1390aca1b","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"mobius\",\"a\":\"1\",\"b\":\"0\",\"c\":\"1\",\"e\":\"1\",\"schedule\":{\"first_index\":1,\"first_degree\":0,\"step\":1}}"},"operation_detail":"mobius, shift 0","conclusion_id":"n-b455bb8d8c0e1d5c","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":"39d368801a53fc7118a56d6a603a54aa6df309dff314ac21832e16cc05ffbc89","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":true,"value":"-1"},"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-9d80e1b19273e824","role":"sequence","name":"theta_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).","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-7ec68dfe9b8ac7ca","kind":"fingerprint_related","node_a_id":"n-b455bb8d8c0e1d5c","node_b_id":"n-e5037b63434d4540","fingerprint":"f6-3ff6c47fdabd4f1c","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-3ff6c47fdabd4f1c"},"other_id":"n-e5037b63434d4540","other":{"id":"n-e5037b63434d4540","name":"derivative of basis_map_A007318 of Delannoy paths counted by number of weak peaks.","first_index":0,"fingerprint":"f6-3ff6c47fdabd4f1c","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["16","8"],["114","120","24"],["768","1248","576","64"]],"card_rows":[["16","8"],["114","120","24"],["768","1248","576","64"],["5010","11040","8160","2240","160"]],"row_sums_preview":["24","258","2656","26610","261720","2540370","24416640","232904610"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b31aa1a3fd93d174","steps":["basis A007318","D"],"edges":["e-9a0dabc7f010818b","e-a29a4e3444e6e58b"],"text":"A133214 \u2192 basis A007318 \u2192 D"},"headline":"A133214 \u2192 basis A007318 \u2192 D","chain":null}},{"id":"l-add77b26b51f3e53","kind":"fingerprint_related","node_a_id":"n-b455bb8d8c0e1d5c","node_b_id":"n-a16d6c9bf5373530","fingerprint":"f6-3ff6c47fdabd4f1c","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-3ff6c47fdabd4f1c"},"other_id":"n-a16d6c9bf5373530","other":{"id":"n-a16d6c9bf5373530","name":"derivative of basis_map_A013609 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,1) (i.e., bilateral Schroeder paths), having k D=(1,1) steps.","first_index":1,"fingerprint":"f6-3ff6c47fdabd4f1c","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],["2"],["16","8"]],"card_rows":[["2"],["16","8"],["114","120","24"],["768","1248","576","64"]],"row_sums_preview":["0","2","24","258","2656","26610","261720","2540370"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-78ba05b4a3dd925d","steps":["basis A013609","D"],"edges":["e-2f2f885dba2c5644","e-fc1937f935577eac"],"text":"A104684 \u2192 basis A013609 \u2192 D"},"headline":"A104684 \u2192 basis A013609 \u2192 D","chain":null}},{"id":"l-b0ee6ed780246336","kind":"fingerprint_related","node_a_id":"n-b455bb8d8c0e1d5c","node_b_id":"n-cde9ae93bdb6208d","fingerprint":"f6-3ff6c47fdabd4f1c","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-3ff6c47fdabd4f1c"},"other_id":"n-cde9ae93bdb6208d","other":{"id":"n-cde9ae93bdb6208d","name":"mobius_x_over_x_plus_one of theta_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-3ff6c47fdabd4f1c","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["2"],["4","8"],["8","40","38"]],"card_rows":[["2"],["4","8"],["8","40","38"],["16","144","312","192"]],"row_sums_preview":["2","12","86","664","5322","43620","362910","3052080"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-6a30765140629bd5","steps":["\u03b8+1","x \u21a6 x/(x+1)"],"edges":["e-d14d9d630db1a5b2","e-966317e932a7cbd2"],"text":"A114655 \u2192 \u03b8+1 \u2192 x \u21a6 x/(x+1)"},"headline":"A114655 \u2192 \u03b8+1 \u2192 x \u21a6 x/(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:   2,     4;\n   3:   4,    20,     19;\n   4:   8,    72,    156,      96;\n   5:  16,   224,    816,    1104,      501;\n   6:  32,   640,   3440,    7600,     7430,     2668;\n   7:  64,  1728,  12720,   40480,    63540,    48516,    14407;\n   8: 128,  4480,  43008,  183680,   409360,   496272,   310520,    78592;\n   9: 256, 11264, 136192,  745472,  2201920,  3753344,  3699136,  1959488,   432073;\n  10: 512, 27648, 410112, 2784768, 10426752, 23353344, 32133696, 26650944, 12235626, 2390004;\n","recurrence_sentence":"The row polynomials satisfy (n^2-n+(2*n^2-2*n)*x+(n^2-n)*x^2)*P(n,x) = (2*n^2-2*n+(5*n^2-n-2)*x+(2*n^2+9*n-6)*x^2-(3*n^2-13*n+6)*x^3-(2*n^2-5*n+2)*x^4)*P(n-1,x) + ((4*n-2)*x+(14*n-7)*x^2+(18*n-9)*x^3+(10*n-5)*x^4+(2*n-1)*x^5)*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[((2*n^2 - 2*n + (5*n^2 - n - 2)*x + (2*n^2 + 9*n - 6)*x^2 - (3*n^2 - 13*n + 6)*x^3 - (2*n^2 - 5*n + 2)*x^4)*P[n - 1, x] + ((4*n - 2)*x + (14*n - 7)*x^2 + (18*n - 9)*x^3 + (10*n - 5)*x^4 + (2*n - 1)*x^5)*D[P[n - 1, x], x])/(n^2 - n + (2*n^2 - 2*n)*x + (n^2 - n)*x^2)]];\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] = ((2*n^2 - 2*n + (5*n^2 - n - 2)*x + (2*n^2 + 9*n - 6)*x^2 - (3*n^2 - 13*n + 6)*x^3 - (2*n^2 - 5*n + 2)*x^4)*v[i - 1] + ((4*n - 2)*x + (14*n - 7)*x^2 + (18*n - 9)*x^3 + (10*n - 5)*x^4 + (2*n - 1)*x^5)*deriv(v[i - 1], x))/(n^2 - n + (2*n^2 - 2*n)*x + (n^2 - n)*x^2)); 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":["\u03b8+1","x \u21a6 x/(x+1)"],"edges":["e-57c7b63013beaaa7","e-6ef7ffa1390aca1b"],"text":"A114656 \u2192 \u03b8+1 \u2192 x \u21a6 x/(x+1)"},"headline":"A114656 \u2192 \u03b8+1 \u2192 x \u21a6 x/(x+1)","chain":null}