{"id":"n-2752334636fec784","revision":0,"first_index":0,"fingerprint":"f6-59bab5701f3316b8","name":"theta_plus_one 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.","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"],["4","4"],["36","72","18"],["400","1200","720","80"],["4900","19600","18900","5600","350"],["63504","317520","423360","211680","37800","1512"],["853776","5122656","8731800","6209280","1940400","232848","6468"],["11778624","82450368","171243072","158558400","72072000","15567552","1345344","27456"],["165636900","1325095200","3246483240","3710266560","2229727500","713512800","113513400","7413120","115830"],["2363904400","21275139600","60070982400","81763281600","61322461200","26281054800","6289483200","770140800","39382200","486200"],["34134779536","341347795360","1091414661480","1724704650240","1553502350400","838891269216","271862911320","50726607360","4938527880","203231600","2032316"],["497634306624","5473977372864","19549919188800","35189854539840","37041952147200","24200742069504","9965011440384","2542094755200","381314213280","30263032800","1024287264","8465184"],["7312459672336","87749516068032","346229068833648","699452664310400","843090265017000","647493323533056","324693289432512","106022298590208","21925567263600","2706860156000","178652770296","5062180032","35154028"],["108172480360000","1406242244680000","6074966497017600","13612424928502400","18495142565900000","16342980521868000","9684729198144000","3873891679257600","1032188243486400","176987010200000","18323361056000","1022170968000","24607819600","145608400"],["1609341595560000","22530782337840000","105769505974860000","260355707015040000","393788006860248000","393788006860248000","269659178610822000","128075602457088000","42024807056232000","9338846012496000","1351675080756000","119155929984000","5694952536000","117942804000","601749000"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","8","126","2400","49350","1055376","23097228","513042816","11511764550","260176316400","5911728816708","134873795818944","3086859062981148","70827095654868000","1628416429288263000"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0","0"],["0","0"],["2","0"],["0","1"]]},"terms":[{"coeff":{"coeffs":[["8","16","6"],["-32","-52","-16"],["32","32","2"],["0","16","12"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","8","14","6"],["0","-16","-24","-8"],["0","0","-8","-8"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":189450,"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-d7b7c19658c9dcba"]},{"id":189451,"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-d7b7c19658c9dcba"]},{"id":189452,"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-d7b7c19658c9dcba"]},{"id":189453,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-d7b7c19658c9dcba"]}],"region_exact":{},"incoming_edges":[{"id":"e-d7b7c19658c9dcba","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-2752334636fec784","premise_count":1,"theorem":"Laguerre's theorem on multiplier sequences: if f is a real polynomial whose roots are all real and <= 0, then (f(k))_(k >= 0) is a multiplier sequence, so x^k -> f(k) x^k maps every real-rooted polynomial to a real-rooted polynomial or zero (Laguerre; see T. Craven and G. Csordas, Multiplier sequences for fields, Illinois J. Math. 21 (1977); Polya--Schur, Theorem 40 of P. Branden, arXiv:1410.6601: sum_k f(k) x^k / k! = f(theta) e^x = C e^x x^m prod (1 + x/a_j), a_j > 0); f(k) has one sign for k >= 0, so coefficients of one sign stay of one sign; applied to f(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.isMultiplierSequence_eval_of_roots_nonpos","RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos","RealRooted.isMultiplierSequence_iff_preserves"],"certificate_hash":"ab99deb1c5eb0899cfbf0b5786d5030686dae3ec8b1b2884b71255b4900a1108","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-ed80a7592b428c53","role":"sequence","name":"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.","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-ae47857248b2ff9c","kind":"fingerprint_related","node_a_id":"n-7a0ff194f56f2d4f","node_b_id":"n-2752334636fec784","fingerprint":"f6-59bab5701f3316b8","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-59bab5701f3316b8"},"other_id":"n-7a0ff194f56f2d4f","other":{"id":"n-7a0ff194f56f2d4f","name":"theta_plus_one of basis_map_A007318 of Square the entries of Pascal's triangle.","first_index":0,"fingerprint":"f6-59bab5701f3316b8","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","2"],["6","12","3"]],"card_rows":[["1"],["2","2"],["6","12","3"],["20","60","36","4"]],"row_sums_preview":["1","4","21","120","705","4188","24997","149488"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b13531ad79e7c629","steps":["x \u21a6 x+1","\u03b8+1"],"edges":["e-041c07f9bf4043d7","e-3a07c3bd974c9d19"],"text":"A008459 \u2192 x \u21a6 x+1 \u2192 \u03b8+1"},"headline":"A008459 \u2192 x \u21a6 x+1 \u2192 \u03b8+1","chain":null}},{"id":"l-f6ae656aff2d0ab6","kind":"fingerprint_related","node_a_id":"n-8ed5cfff0540233a","node_b_id":"n-2752334636fec784","fingerprint":"f6-59bab5701f3316b8","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-59bab5701f3316b8"},"other_id":"n-8ed5cfff0540233a","other":{"id":"n-8ed5cfff0540233a","name":"theta_plus_one 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-59bab5701f3316b8","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","2"],["6","12","3"]],"card_rows":[["1"],["2","2"],["6","12","3"],["20","60","36","4"]],"row_sums_preview":["1","4","21","120","705","4188","24997","149488"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-78ba05b4a3dd925d","steps":["\u03b8+1"],"edges":["e-33e8cdf9e54d9cd4"],"text":"A104684 \u2192 \u03b8+1"},"headline":"A104684 \u2192 \u03b8+1","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:          4,           4;\n  2:         36,          72,          18;\n  3:        400,        1200,         720,          80;\n  4:       4900,       19600,       18900,        5600,         350;\n  5:      63504,      317520,      423360,      211680,       37800,        1512;\n  6:     853776,     5122656,     8731800,     6209280,     1940400,      232848,       6468;\n  7:   11778624,    82450368,   171243072,   158558400,    72072000,    15567552,    1345344,     27456;\n  8:  165636900,  1325095200,  3246483240,  3710266560,  2229727500,   713512800,  113513400,   7413120,   115830;\n  9: 2363904400, 21275139600, 60070982400, 81763281600, 61322461200, 26281054800, 6289483200, 770140800, 39382200, 486200;\n","recurrence_sentence":"The row polynomials satisfy (2*n^2+n^3*x)*P(n,x) = (32*n^2-32*n+8+(16*n^3+32*n^2-52*n+16)*x+(12*n^3+2*n^2-16*n+6)*x^2)*P(n-1,x) - ((16*n-8)*x+(8*n^2+24*n-14)*x^2+(8*n^2+8*n-6)*x^3)*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[((32*n^2 - 32*n + 8 + (16*n^3 + 32*n^2 - 52*n + 16)*x + (12*n^3 + 2*n^2 - 16*n + 6)*x^2)*P[n - 1, x] - ((16*n - 8)*x + (8*n^2 + 24*n - 14)*x^2 + (8*n^2 + 8*n - 6)*x^3)*D[P[n - 1, x], x])/(2*n^2 + n^3*x)]];\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] = ((32*n^2 - 32*n + 8 + (16*n^3 + 32*n^2 - 52*n + 16)*x + (12*n^3 + 2*n^2 - 16*n + 6)*x^2)*v[i - 1] - ((16*n - 8)*x + (8*n^2 + 24*n - 14)*x^2 + (8*n^2 + 8*n - 6)*x^3)*deriv(v[i - 1], x))/(2*n^2 + n^3*x)); 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-fdc03fad975441d0","steps":["basis A007318","\u03b8+1"],"edges":["e-2cd9cd27e716475b","e-d7b7c19658c9dcba"],"text":"A069466 \u2192 basis A007318 \u2192 \u03b8+1"},"headline":"A069466 \u2192 basis A007318 \u2192 \u03b8+1","chain":null}