{"id":"n-c797a96ea6c06aee","revision":0,"first_index":1,"fingerprint":"f6-9a4b425d2a954ae8","name":"mobius_x_over_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.","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":[["2"],["6","8"],["22","60","40"],["90","372","504","224"],["394","2184","4480","4032","1344"],["1806","12560","34560","47040","31680","8448"],["8558","71604","247320","451440","459360","247104","54912"],["41586","406700","1690920","3874640","5285280","4292288","1921920","366080"],["206098","2306832","11216128","30942912","52980928","57657600","38950912","14936064","2489344"],["1037718","13081752","72828288","235015872","484481088","661699584","598800384","346245120","116093952","17199104"],["5293446","74213100","465508680","1720424160","4148901120","6822047232","7746385920","5998187520","3031342080","902952960","120393728"],["27297738","421298724","2939955480","12245069760","33823722240","65061782016","88933920768","86390768640","58448839680","26231941120","7029141504","852017152"],["142078746","2393631000","18393281280","85246508160","265403445120","584783096832","935072286720","1093337118720","927813934080","557310504960","224932528128","54772531200","6085836800"],["745387038","13611535392","114205897728","582966713472","2019894484608","5016684102144","9188681508864","12567428290560","12835463427072","9668751499264","5221647974400","1914604257280","427225743360","43818024960"],["3937603038","77471954532","704733659448","3928611475152","14994044633568","41447318552640","85574669212032","134064995860224","160152838669824","145178131338240","98308401551360","48223105781760","16198976102400","3335647150080","317680680960"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["2","14","122","1190","12434","136094","1540298","17879414","211686818","2546482862","31035649946","382405754822","4755686781746","59615728846142","752510564225258"],"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":[["2"]],"recurrence":{"denominator":{"coeffs":[["1","2","1"],["1","2","1"]]},"terms":[{"coeff":{"coeffs":[["3","10","11","4"],["3","10","11","4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["2","10","18","14","4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":180539,"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-97c6c056462a8fe9"]},{"id":180540,"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-97c6c056462a8fe9"]},{"id":180541,"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-97c6c056462a8fe9"]}],"region_exact":{},"incoming_edges":[{"id":"e-97c6c056462a8fe9","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-c797a96ea6c06aee","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":"5fadb64e8d7ed4298162af77d3c3cb3e8f3d0201f8140e28d249097df22d2b6a","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-25065a706ad43d32","role":"sequence","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.","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-2778c5c0497c6152","kind":"fingerprint_related","node_a_id":"n-c797a96ea6c06aee","node_b_id":"n-8aa50ef542759ee0","fingerprint":"f6-9a4b425d2a954ae8","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-9a4b425d2a954ae8"},"other_id":"n-8aa50ef542759ee0","other":{"id":"n-8aa50ef542759ee0","name":"derivative of basis_map_A013609 of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.","first_index":1,"fingerprint":"f6-9a4b425d2a954ae8","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],["4"],["36","48"]],"card_rows":[["4"],["36","48"],["264","720","480"],["1800","7440","10080","4480"]],"row_sums_preview":["0","4","84","1464","23800","373020","5715948","86256688"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-4689fb1386d440ad","steps":["basis A013609","D"],"edges":["e-7c694c7111620c7d","e-752d48bd38b7d7a0"],"text":"A063007 \u2192 basis A013609 \u2192 D"},"headline":"A063007 \u2192 basis A013609 \u2192 D","chain":null}},{"id":"l-6fba89217bbea294","kind":"fingerprint_related","node_a_id":"n-8217f7f3de935aeb","node_b_id":"n-c797a96ea6c06aee","fingerprint":"f6-9a4b425d2a954ae8","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-9a4b425d2a954ae8"},"other_id":"n-8217f7f3de935aeb","other":{"id":"n-8217f7f3de935aeb","name":"basis_map_A013609 of Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.","first_index":0,"fingerprint":"f6-9a4b425d2a954ae8","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["3","4"],["11","30","20"]],"card_rows":[["1"],["3","4"],["11","30","20"],["45","186","252","112"]],"row_sums_preview":["1","7","61","595","6217","68047","770149","8939707"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-66e2c3448245b0b7","steps":["basis A013609"],"edges":["e-4e2df72103232439"],"text":"A033282 \u2192 basis A013609"},"headline":"A033282 \u2192 basis A013609","chain":null}},{"id":"l-7c5435cbdc41646f","kind":"fingerprint_related","node_a_id":"n-c797a96ea6c06aee","node_b_id":"n-1dd418d798e58c37","fingerprint":"f6-9a4b425d2a954ae8","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-9a4b425d2a954ae8"},"other_id":"n-1dd418d798e58c37","other":{"id":"n-1dd418d798e58c37","name":"reversal of basis_map_A013609 of Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.","first_index":0,"fingerprint":"f6-9a4b425d2a954ae8","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["4","3"],["20","30","11"]],"card_rows":[["1"],["4","3"],["20","30","11"],["112","252","186","45"]],"row_sums_preview":["1","7","61","595","6217","68047","770149","8939707"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-66e2c3448245b0b7","steps":["basis A013609","reverse"],"edges":["e-4e2df72103232439","e-37243cfec5f9f025"],"text":"A033282 \u2192 basis A013609 \u2192 reverse"},"headline":"A033282 \u2192 basis A013609 \u2192 reverse","chain":null}},{"id":"l-e5b6d405b41ee4b6","kind":"fingerprint_related","node_a_id":"n-a82935040c56619d","node_b_id":"n-c797a96ea6c06aee","fingerprint":"f6-9a4b425d2a954ae8","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-9a4b425d2a954ae8"},"other_id":"n-a82935040c56619d","other":{"id":"n-a82935040c56619d","name":"mobius_x_over_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).","first_index":1,"fingerprint":"f6-9a4b425d2a954ae8","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["3","4"],["11","30","20"]],"card_rows":[["1"],["3","4"],["11","30","20"],["45","186","252","112"]],"row_sums_preview":["1","7","61","595","6217","68047","770149","8939707"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-0d75f6272d2a2a84","steps":["basis A007318","x \u21a6 x/(x+1)"],"edges":["e-38a7985c4c1aa2e3","e-6813be3d909d70de"],"text":"A114656 \u2192 basis A007318 \u2192 x \u21a6 x/(x+1)"},"headline":"A114656 \u2192 basis A007318 \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:       2;\n   2:       6,        8;\n   3:      22,       60,       40;\n   4:      90,      372,      504,       224;\n   5:     394,     2184,     4480,      4032,      1344;\n   6:    1806,    12560,    34560,     47040,     31680,      8448;\n   7:    8558,    71604,   247320,    451440,    459360,    247104,     54912;\n   8:   41586,   406700,  1690920,   3874640,   5285280,   4292288,   1921920,    366080;\n   9:  206098,  2306832, 11216128,  30942912,  52980928,  57657600,  38950912,  14936064,   2489344;\n  10: 1037718, 13081752, 72828288, 235015872, 484481088, 661699584, 598800384, 346245120, 116093952, 17199104;\n","recurrence_sentence":"The row polynomials satisfy (n+1+(2*n+2)*x+(n+1)*x^2)*P(n,x) = (3*n+3+(10*n+10)*x+(11*n+11)*x^2+(4*n+4)*x^3)*P(n-1,x) + (2+10*x+18*x^2+14*x^3+4*x^4)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 2.","mathematica":"P[1, x_] := 2;\nP[n_, x_] := P[n, x] = Expand[Together[((3*n + 3 + (10*n + 10)*x + (11*n + 11)*x^2 + (4*n + 4)*x^3)*P[n - 1, x] + (2 + 10*x + 18*x^2 + 14*x^3 + 4*x^4)*D[P[n - 1, x], x])/(n + 1 + (2*n + 2)*x + (n + 1)*x^2)]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 2; for(n = 2, N, my(i = n); v[i] = ((3*n + 3 + (10*n + 10)*x + (11*n + 11)*x^2 + (4*n + 4)*x^3)*v[i - 1] + (2 + 10*x + 18*x^2 + 14*x^3 + 4*x^4)*deriv(v[i - 1], x))/(n + 1 + (2*n + 2)*x + (n + 1)*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-6a30765140629bd5","steps":["x \u21a6 x+1","x \u21a6 x/(x+1)"],"edges":["e-5ebd2cd7e542e718","e-97c6c056462a8fe9"],"text":"A114655 \u2192 x \u21a6 x+1 \u2192 x \u21a6 x/(x+1)"},"headline":"A114655 \u2192 x \u21a6 x+1 \u2192 x \u21a6 x/(x+1)","chain":null}