{"id":"n-fcede3bb0c43f0a9","revision":0,"first_index":1,"fingerprint":"f6-04f9880d32434ab5","name":"mobius_x_over_x_plus_one of basis_map_A013610 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.","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","6"],["13","50","46"],["63","360","666","396"],["321","2436","6786","8196","3606"],["1683","15930","59310","108360","96930","33876"],["8989","101958","475260","1163840","1576950","1119228","324556"],["48639","643020","3600828","11061960","20114850","21627648","12718020","3151896"],["265729","4012040","26233228","96960248","221412730","319635848","284654020","142866056","30915046"],["1462563","24829038","185659668","802167408","2205800478","4001024916","4784399676","3634819056","1591041906","305543556"],["8097453","152674650","1284988050","6354957600","20442627450","44673895980","67136852160","68479780320","45350399070","17599616460","3038019876"],["45046719","933953328","8737665750","48674884500","179333931150","458673221160","830698046640","1064927761920","946666142730","555546934800","193630612428","30354866856"],["251595969","5688935820","58565758878","362875890300","1506742686900","4415641512480","9362279923920","14466034978560","16161569496270","12727982830200","6705177879708","2120886006840","304523343996"],["1409933619","34529050530","387893216178","2646024772248","12225742857900","40393754046360","98160315430320","177592554453600","239148913476330","236678576422860","167282291770308","79940409522480","23144692847796","3065412858696"],["7923848253","208938585198","2543408610288","18941084530368","96388054230468","354491546889480","971459633584440","2014769929217760","3177080967690630","3789849028105140","3365665073706936","2157326713703616","943275608296476","251780283264216","30946859111256"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","9","109","1485","21345","316089","4770781","72966861","1126954945","17536748265","274521909069","4318223067981","68198220839841","1080702520659225","17174735053374525"],"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":[["-3","-6","-3"],["3","6","3"]]},"terms":[{"coeff":{"coeffs":[["-41","-212","-381","-290","-80"],["25","124","213","154","40"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-4","-38","-130","-202","-146","-40"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":184858,"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-7db318b761fd0965"]},{"id":184859,"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-7db318b761fd0965"]},{"id":184860,"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-7db318b761fd0965"]}],"region_exact":{},"incoming_edges":[{"id":"e-7db318b761fd0965","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-fcede3bb0c43f0a9","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":"c7444fc62581636d7a132d7924cd43a4035a93ca2ad784e00d61bc1d154206a6","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-914a474e9f3b0e2a","role":"sequence","name":"basis_map_A013610 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.","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":[],"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:       3,        6;\n   3:      13,       50,        46;\n   4:      63,      360,       666,       396;\n   5:     321,     2436,      6786,      8196,       3606;\n   6:    1683,    15930,     59310,    108360,      96930,      33876;\n   7:    8989,   101958,    475260,   1163840,    1576950,    1119228,     324556;\n   8:   48639,   643020,   3600828,  11061960,   20114850,   21627648,   12718020,    3151896;\n   9:  265729,  4012040,  26233228,  96960248,  221412730,  319635848,  284654020,  142866056,   30915046;\n  10: 1462563, 24829038, 185659668, 802167408, 2205800478, 4001024916, 4784399676, 3634819056, 1591041906, 305543556;\n","recurrence_sentence":"The row polynomials satisfy (3*n-3+(6*n-6)*x+(3*n-3)*x^2)*P(n,x) = (25*n-41+(124*n-212)*x+(213*n-381)*x^2+(154*n-290)*x^3+(40*n-80)*x^4)*P(n-1,x) - (4+38*x+130*x^2+202*x^3+146*x^4+40*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[((25*n - 41 + (124*n - 212)*x + (213*n - 381)*x^2 + (154*n - 290)*x^3 + (40*n - 80)*x^4)*P[n - 1, x] - (4 + 38*x + 130*x^2 + 202*x^3 + 146*x^4 + 40*x^5)*D[P[n - 1, x], x])/(3*n - 3 + (6*n - 6)*x + (3*n - 3)*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] = ((25*n - 41 + (124*n - 212)*x + (213*n - 381)*x^2 + (154*n - 290)*x^3 + (40*n - 80)*x^4)*v[i - 1] - (4 + 38*x + 130*x^2 + 202*x^3 + 146*x^4 + 40*x^5)*deriv(v[i - 1], x))/(3*n - 3 + (6*n - 6)*x + (3*n - 3)*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-78ba05b4a3dd925d","steps":["basis A013610","x \u21a6 x/(x+1)"],"edges":["e-35b37e0190870340","e-7db318b761fd0965"],"text":"A104684 \u2192 basis A013610 \u2192 x \u21a6 x/(x+1)"},"headline":"A104684 \u2192 basis A013610 \u2192 x \u21a6 x/(x+1)","chain":null}