{"id":"n-75813ed3ff97a62c","revision":0,"first_index":0,"fingerprint":"f6-a6dfa0000f2b0fe9","name":"reversal of basis_map_A013609 of Square the entries of Pascal's triangle.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["2","2"],["4","12","6"],["8","48","60","20"],["16","160","360","280","70"],["32","480","1680","2240","1260","252"],["64","1344","6720","13440","12600","5544","924"],["128","3584","24192","67200","92400","66528","24024","3432"],["256","9216","80640","295680","554400","576576","336336","102960","12870"],["512","23040","253440","1182720","2882880","4036032","3363360","1647360","437580","48620"],["1024","56320","760320","4392960","13453440","24216192","26906880","18670080","7876440","1847560","184756"],["2048","135168","2196480","15375360","57657600","129153024","182966784","168030720","99768240","36951200","7759752","705432"],["4096","319488","6150144","51251200","230630400","627314688","1097800704","1277033472","997682400","517316800","170714544","32449872","2704156"],["8192","745472","16773120","164003840","871270400","2822916096","5959489536","8513556480","8380532160","5690484800","2617623008","778796928","135207800","10400600"],["16384","1720320","44728320","506920960","3136573440","11918979072","29797447680","51081338880","61457235840","52352460160","31411476096","12979948800","3515402800","561632400","40116600"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","22","136","886","5944","40636","281488","1968934","13875544","98365972","700701808","5011371964","35961808432","258805997752"],"nonn":true,"definitions":[{"position":0,"source":"derived:reversal","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0"],["2","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","4","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":181515,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-fc3d17e0986a6ce3"]},{"id":181516,"position":1,"claim":"one_signed_coefficients","from_index":0,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":0},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 0: the coefficients of P_n have one sign","region_exact":null,"edges":["e-fc3d17e0986a6ce3"]},{"id":181517,"position":2,"claim":"hadamard_kernel","from_index":0,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":0},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-fc3d17e0986a6ce3"]}],"region_exact":{},"incoming_edges":[{"id":"e-fc3d17e0986a6ce3","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"reversal\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}"},"operation_detail":"reversal, shift 0","conclusion_id":"n-75813ed3ff97a62c","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":"6fb724ef41a50fe9cca78de8e8c3ccfee844d5fdfb4381b657166054f0f13a93","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-fe801e460afa1e3b","role":"sequence","name":"basis_map_A013609 of Square the entries of Pascal's triangle.","uses":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]"}]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-cc73e2ece3bc6438","kind":"fingerprint_related","node_a_id":"n-db27c4ac13806435","node_b_id":"n-75813ed3ff97a62c","fingerprint":"f6-a6dfa0000f2b0fe9","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-a6dfa0000f2b0fe9"},"other_id":"n-db27c4ac13806435","other":{"id":"n-db27c4ac13806435","name":"basis_map_A013609 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-a6dfa0000f2b0fe9","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["4","4"],["36","72","24"]],"card_rows":[["1"],["4","4"],["36","72","24"],["400","1200","960","160"]],"row_sums_preview":["1","8","132","2720","62020","1497888","37547664","966066816"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-fdc03fad975441d0","steps":["basis A013609"],"edges":["e-aca51a80a394c762"],"text":"A069466 \u2192 basis A013609"},"headline":"A069466 \u2192 basis A013609","chain":null}},{"id":"l-d86244c986112fa0","kind":"fingerprint_related","node_a_id":"n-fe801e460afa1e3b","node_b_id":"n-75813ed3ff97a62c","fingerprint":"f6-a6dfa0000f2b0fe9","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-a6dfa0000f2b0fe9"},"other_id":"n-fe801e460afa1e3b","other":{"id":"n-fe801e460afa1e3b","name":"basis_map_A013609 of Square the entries of Pascal's triangle.","first_index":0,"fingerprint":"f6-a6dfa0000f2b0fe9","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","2"],["6","12","4"]],"card_rows":[["1"],["2","2"],["6","12","4"],["20","60","48","8"]],"row_sums_preview":["1","4","22","136","886","5944","40636","281488"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b13531ad79e7c629","steps":["basis A013609"],"edges":["e-4579edc5f7a4d216"],"text":"A008459 \u2192 basis A013609"},"headline":"A008459 \u2192 basis A013609","chain":null}}],"oeis":[],"bfiles":[],"oeis_texts":[{"oeis_id":"","target":"node","first_row":0,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0:   1;\n  1:   2,     2;\n  2:   4,    12,      6;\n  3:   8,    48,     60,      20;\n  4:  16,   160,    360,     280,      70;\n  5:  32,   480,   1680,    2240,    1260,     252;\n  6:  64,  1344,   6720,   13440,   12600,    5544,     924;\n  7: 128,  3584,  24192,   67200,   92400,   66528,   24024,    3432;\n  8: 256,  9216,  80640,  295680,  554400,  576576,  336336,  102960,  12870;\n  9: 512, 23040, 253440, 1182720, 2882880, 4036032, 3363360, 1647360, 437580, 48620;\n","recurrence_sentence":"The row polynomials satisfy n*P(n,x) = (2*n+2*n*x)*P(n-1,x) + (4*x+2*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[((2*n + 2*n*x)*P[n - 1, x] + (4*x + 2*x^2)*D[P[n - 1, x], x])/(n)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((2*n + 2*n*x)*v[i - 1] + (4*x + 2*x^2)*deriv(v[i - 1], x))/(n)); v};\nrow(n, p) = {my(c = Vecrev(p)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};\nT(9)","reading":{"first_row":0,"offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-b13531ad79e7c629","steps":["basis A013609","reverse"],"edges":["e-4579edc5f7a4d216","e-fc3d17e0986a6ce3"],"text":"A008459 \u2192 basis A013609 \u2192 reverse"},"headline":"A008459 \u2192 basis A013609 \u2192 reverse","chain":null}