{"id":"n-3bf3b2c1960395d5","revision":0,"first_index":1,"fingerprint":"f6-e88a2f797c4f541a","name":"reversal of basis_map_A013611 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"],["4","3"],["16","32","13"],["64","240","228","63"],["256","1536","2496","1536","321"],["1024","8960","21760","22080","10020","1683"],["4096","49152","165120","243200","178320","64032","8989"],["16384","258048","1139712","2266880","2372160","1358448","403396","48639"],["65536","1310720","7340032","18808832","26199040","21174272","9936640","2514944","265729"],["262144","6488064","44826624","143130624","253661184","270240768","177558528","70541568","15554628","1462563"],["1048576","31457280","262471680","1018429440","2224373760","2989228032","2570695680","1421383680","489425040","95600160","8097453"],["4194304","149946368","1485045760","6866534400","18047631360","29660725248","31972233216","23014210560","10977384000","3334581360","584585892","45046719"],["16777216","704643072","8166309888","44291850240","137514516480","270085128192","354006073344","317843767296","196533469440","82390894080","22387197888","3559712256","251595969"],["67108864","3271557120","43838865408","275301531648","994706718720","2293251637248","3573409382400","3883910823936","2983918519296","1616066200320","604149841152","148478990400","21599884644","1409933619"],["268435456","15032385536","230535725056","1658025148416","6886586843136","18370529329152","33440842186752","43033520504832","39880227459072","26751699566592","12883529987328","4345149838848","974715011088","130672946208","7923848253"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","7","61","595","6145","65527","712909","7863667","87615745","983726695","11112210781","126142119187","1437751935361","16443380994775","188609259215725"],"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":[["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["-4","1","2"],["4","1","-1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","8","6","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":185614,"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-6bcef3ca45ff1e76"]},{"id":185615,"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-6bcef3ca45ff1e76"]},{"id":185616,"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-6bcef3ca45ff1e76"]}],"region_exact":{},"incoming_edges":[{"id":"e-6bcef3ca45ff1e76","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-3bf3b2c1960395d5","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":"fd48c64287468c0a272cd8b712aee94c1bc8d832452e28d716e9402572288271","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-6373ae06480cbab5","role":"sequence","name":"basis_map_A013611 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-44fd7baeac34f9b5","kind":"fingerprint_related","node_a_id":"n-e1b5185a7301abc6","node_b_id":"n-3bf3b2c1960395d5","fingerprint":"f6-e88a2f797c4f541a","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-e88a2f797c4f541a"},"other_id":"n-e1b5185a7301abc6","other":{"id":"n-e1b5185a7301abc6","name":"basis_map_A013609 of Delannoy paths counted by number of weak peaks.","first_index":0,"fingerprint":"f6-e88a2f797c4f541a","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["13","32","16"],["63","228","240","64"],["321","1536","2496","1536","256"]],"card_rows":[["13","32","16"],["63","228","240","64"],["321","1536","2496","1536","256"],["1683","10020","22080","21760","8960","1024"]],"row_sums_preview":["61","595","6145","65527","712909","7863667","87615745","983726695"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b31aa1a3fd93d174","steps":["basis A013609"],"edges":["e-060b1f8a928003b3"],"text":"A133214 \u2192 basis A013609"},"headline":"A133214 \u2192 basis A013609","chain":null}},{"id":"l-88def7b65d075962","kind":"fingerprint_related","node_a_id":"n-6373ae06480cbab5","node_b_id":"n-3bf3b2c1960395d5","fingerprint":"f6-e88a2f797c4f541a","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-e88a2f797c4f541a"},"other_id":"n-6373ae06480cbab5","other":{"id":"n-6373ae06480cbab5","name":"basis_map_A013611 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-e88a2f797c4f541a","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["3","4"],["13","32","16"]],"card_rows":[["1"],["3","4"],["13","32","16"],["63","228","240","64"]],"row_sums_preview":["1","7","61","595","6145","65527","712909","7863667"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-78ba05b4a3dd925d","steps":["basis A013611"],"edges":["e-99f7e1fd97b5ca9c"],"text":"A104684 \u2192 basis A013611"},"headline":"A104684 \u2192 basis A013611","chain":null}},{"id":"l-e0d996f56f7b01e6","kind":"fingerprint_related","node_a_id":"n-3bf3b2c1960395d5","node_b_id":"n-82c3c8329527823d","fingerprint":"f6-e88a2f797c4f541a","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-e88a2f797c4f541a"},"other_id":"n-82c3c8329527823d","other":{"id":"n-82c3c8329527823d","name":"reversal of basis_map_A013609 of Delannoy paths counted by number of weak peaks.","first_index":0,"fingerprint":"f6-e88a2f797c4f541a","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["16","32","13"],["64","240","228","63"],["256","1536","2496","1536","321"]],"card_rows":[["16","32","13"],["64","240","228","63"],["256","1536","2496","1536","321"],["1024","8960","21760","22080","10020","1683"]],"row_sums_preview":["61","595","6145","65527","712909","7863667","87615745","983726695"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b31aa1a3fd93d174","steps":["basis A013609","reverse"],"edges":["e-060b1f8a928003b3","e-1bafbf22543673ac"],"text":"A133214 \u2192 basis A013609 \u2192 reverse"},"headline":"A133214 \u2192 basis A013609 \u2192 reverse","chain":null}},{"id":"l-fdf233470da6d0a9","kind":"fingerprint_related","node_a_id":"n-3bf3b2c1960395d5","node_b_id":"n-ad285e734b9b3fbb","fingerprint":"f6-e88a2f797c4f541a","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-e88a2f797c4f541a"},"other_id":"n-ad285e734b9b3fbb","other":{"id":"n-ad285e734b9b3fbb","name":"basis_map_A013611 of basis_map_A007318 of Square the entries of Pascal's triangle.","first_index":0,"fingerprint":"f6-e88a2f797c4f541a","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["3","4"],["13","32","16"]],"card_rows":[["1"],["3","4"],["13","32","16"],["63","228","240","64"]],"row_sums_preview":["1","7","61","595","6145","65527","712909","7863667"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b13531ad79e7c629","steps":["x \u21a6 x+1","basis A013611"],"edges":["e-041c07f9bf4043d7","e-028dec7ea7c416eb"],"text":"A008459 \u2192 x \u21a6 x+1 \u2192 basis A013611"},"headline":"A008459 \u2192 x \u21a6 x+1 \u2192 basis A013611","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,       3;\n   3:     16,      32,       13;\n   4:     64,     240,      228,        63;\n   5:    256,    1536,     2496,      1536,       321;\n   6:   1024,    8960,    21760,     22080,     10020,      1683;\n   7:   4096,   49152,   165120,    243200,    178320,     64032,      8989;\n   8:  16384,  258048,  1139712,   2266880,   2372160,   1358448,    403396,    48639;\n   9:  65536, 1310720,  7340032,  18808832,  26199040,  21174272,   9936640,  2514944,   265729;\n  10: 262144, 6488064, 44826624, 143130624, 253661184, 270240768, 177558528, 70541568, 15554628, 1462563;\n","recurrence_sentence":"The row polynomials satisfy (n-1)*P(n,x) = (4*n-4+(n+1)*x-(n-2)*x^2)*P(n-1,x) + (8*x+6*x^2+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[((4*n - 4 + (n + 1)*x - (n - 2)*x^2)*P[n - 1, x] + (8*x + 6*x^2 + x^3)*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] = ((4*n - 4 + (n + 1)*x - (n - 2)*x^2)*v[i - 1] + (8*x + 6*x^2 + x^3)*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-78ba05b4a3dd925d","steps":["basis A013611","reverse"],"edges":["e-99f7e1fd97b5ca9c","e-6bcef3ca45ff1e76"],"text":"A104684 \u2192 basis A013611 \u2192 reverse"},"headline":"A104684 \u2192 basis A013611 \u2192 reverse","chain":null}