{"id":"n-68e54766ae0dd6bf","revision":0,"first_index":1,"fingerprint":"f6-3d3f3d7068653107","name":"reversal 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","3"],["9","24","13"],["27","135","171","63"],["81","648","1404","1152","321"],["243","2835","9180","12420","7515","1683"],["729","11664","52245","102600","100305","48024","8989"],["2187","45927","270459","717255","1000755","764127","302547","48639"],["6561","174960","1306368","4463424","8289540","8932896","5589360","1886208","265729"],["19683","649539","5983632","25474176","60194988","85505868","74907504","39679632","11665971","1462563"],["59049","2361960","26276805","135943920","395890740","709357824","813384180","599646240","275301585","71700120","8097453"],["177147","8444007","111504195","687428775","2409067980","5278971852","7587160812","7281840060","4631083875","1875702015","438439419","45046719"],["531441","29760696","459873612","3325639680","13766979105","36052012656","63005475456","75425815872","62184418065","34758658440","12592798812","2669784192","251595969"],["1594323","103630995","1851540444","15503196852","74687241915","229584106323","476992573200","691252683264","708097851747","511333446195","254875714236","83519432100","16199913483","1409933619"],["4782969","357128352","7302530781","70026917688","387807909489","1379345431464","3347860192677","5744281576176","7097823685953","6348303705744","4076429410053","1833110088264","548277193737","98004709656","7923848253"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","46","396","3606","33876","324556","3151896","30915046","305543556","3038019876","30354866856","304523343996","3065412858696","30946859111256"],"nonn":true,"definitions":[{"position":0,"source":"derived:reversal","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-3"],["3"]]},"terms":[{"coeff":{"coeffs":[["-9","3","8"],["9","3","-4"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","18","18","4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":184855,"position":0,"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-089d2e7227c9c50f"]},{"id":184856,"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-089d2e7227c9c50f"]},{"id":184857,"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-089d2e7227c9c50f"]}],"region_exact":{},"incoming_edges":[{"id":"e-089d2e7227c9c50f","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"reversal\",\"schedule\":{\"first_index\":1,\"first_degree\":0,\"step\":1}}"},"operation_detail":"reversal, shift 0","conclusion_id":"n-68e54766ae0dd6bf","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":"reversed","lean_declarations":["RealRooted.X_pow_mul_reverse_eq_zero_or_splits","RealRooted.reflect_eq_zero_or_splits"],"certificate_hash":"65216684d161131c6a7e70417d5e0c8ff04c32e372a1f9f10b77c7e964dd647e","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"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":[{"id":"l-1e721d40bd84633a","kind":"fingerprint_related","node_a_id":"n-68e54766ae0dd6bf","node_b_id":"n-862e5f3c5e2d148f","fingerprint":"f6-3d3f3d7068653107","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-3d3f3d7068653107"},"other_id":"n-862e5f3c5e2d148f","other":{"id":"n-862e5f3c5e2d148f","name":"basis_map_A013610 of basis_map_A007318 of Square the entries of Pascal's triangle.","first_index":0,"fingerprint":"f6-3d3f3d7068653107","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["3","3"],["13","24","9"]],"card_rows":[["1"],["3","3"],["13","24","9"],["63","171","135","27"]],"row_sums_preview":["1","6","46","396","3606","33876","324556","3151896"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b13531ad79e7c629","steps":["x \u21a6 x+1","basis A013610"],"edges":["e-041c07f9bf4043d7","e-8173c13613709dd0"],"text":"A008459 \u2192 x \u21a6 x+1 \u2192 basis A013610"},"headline":"A008459 \u2192 x \u21a6 x+1 \u2192 basis A013610","chain":null}},{"id":"l-58122c6d89f1d09b","kind":"fingerprint_related","node_a_id":"n-68e54766ae0dd6bf","node_b_id":"n-647a94c6d9dbf531","fingerprint":"f6-3d3f3d7068653107","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-3d3f3d7068653107"},"other_id":"n-647a94c6d9dbf531","other":{"id":"n-647a94c6d9dbf531","name":"basis_map_A013610 of basis_map_A007318 of Triangle T(n, k) of numbers of square lattice walks that start and end at origin after 2*n steps and contain exactly k steps to the east, possibly touching origin at intermediate stages.","first_index":0,"fingerprint":"f6-3d3f3d7068653107","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["6","6"],["78","144","54"]],"card_rows":[["1"],["6","6"],["78","144","54"],["1260","3420","2700","540"]],"row_sums_preview":["1","12","276","7920","252420","8536752","299889744","10817307072"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-fdc03fad975441d0","steps":["basis A007318","basis A013610"],"edges":["e-2cd9cd27e716475b","e-ab1c685224913bdf"],"text":"A069466 \u2192 basis A007318 \u2192 basis A013610"},"headline":"A069466 \u2192 basis A007318 \u2192 basis A013610","chain":null}},{"id":"l-83f38a984b1a3748","kind":"fingerprint_related","node_a_id":"n-914a474e9f3b0e2a","node_b_id":"n-68e54766ae0dd6bf","fingerprint":"f6-3d3f3d7068653107","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-3d3f3d7068653107"},"other_id":"n-914a474e9f3b0e2a","other":{"id":"n-914a474e9f3b0e2a","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.","first_index":1,"fingerprint":"f6-3d3f3d7068653107","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["3","3"],["13","24","9"]],"card_rows":[["1"],["3","3"],["13","24","9"],["63","171","135","27"]],"row_sums_preview":["1","6","46","396","3606","33876","324556","3151896"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-78ba05b4a3dd925d","steps":["basis A013610"],"edges":["e-35b37e0190870340"],"text":"A104684 \u2192 basis A013610"},"headline":"A104684 \u2192 basis A013610","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:     3,      3;\n   3:     9,     24,      13;\n   4:    27,    135,     171,       63;\n   5:    81,    648,    1404,     1152,      321;\n   6:   243,   2835,    9180,    12420,     7515,     1683;\n   7:   729,  11664,   52245,   102600,   100305,    48024,     8989;\n   8:  2187,  45927,  270459,   717255,  1000755,   764127,   302547,    48639;\n   9:  6561, 174960, 1306368,  4463424,  8289540,  8932896,  5589360,  1886208,   265729;\n  10: 19683, 649539, 5983632, 25474176, 60194988, 85505868, 74907504, 39679632, 11665971, 1462563;\n","recurrence_sentence":"The row polynomials satisfy (3*n-3)*P(n,x) = (9*n-9+(3*n+3)*x-(4*n-8)*x^2)*P(n-1,x) + (18*x+18*x^2+4*x^3)*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[((9*n - 9 + (3*n + 3)*x - (4*n - 8)*x^2)*P[n - 1, x] + (18*x + 18*x^2 + 4*x^3)*D[P[n - 1, x], x])/(3*n - 3)]];\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] = ((9*n - 9 + (3*n + 3)*x - (4*n - 8)*x^2)*v[i - 1] + (18*x + 18*x^2 + 4*x^3)*deriv(v[i - 1], x))/(3*n - 3)); 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","reverse"],"edges":["e-35b37e0190870340","e-089d2e7227c9c50f"],"text":"A104684 \u2192 basis A013610 \u2192 reverse"},"headline":"A104684 \u2192 basis A013610 \u2192 reverse","chain":null}