{"id":"n-388eab6589a0653d","revision":0,"first_index":1,"fingerprint":"f6-6f638175010ea5cb","name":"theta_plus_one of basis_map_A013609 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","4"],["13","32","12"],["63","228","180","32"],["321","1536","1872","768","80"],["1683","10020","16560","10880","2800","192"],["8989","64032","133740","121600","51600","9216","448"],["48639","403396","1018836","1186080","708400","213696","28224","1024"],["265729","2514944","7452480","10587136","8187200","3526656","802816","81920","2304"],["1462563","15554628","52906176","88779264","84450240","47561472","15654912","2801664","228096","5120"],["8097453","95600160","367068780","710691840","803342400","560480256","243290880","63651840","9227520","614400","11264"],["45046719","584585892","2500936020","5488692000","7191940800","5994793728","3244141824","1127976960","241401600","29004800","1610752","24576"],["251595969","3559712256","16790398416","41195447040","61416709200","59595706368","38719414272","16880320512","4834494720","865075200","87724032","4128768","53248"],["1409933619","21599884644","111359242800","302074920576","505020687600","559484722368","424802746368","223338086400","80622127872","19427865600","2957340672","256868352","10383360","114688"],["7923848253","130672946208","731036258316","2172574919424","4026103121040","5015943668736","4361899878336","2689595031552","1175654608128","358799400960","73977007104","9714991104","731680768","25690112","245760"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","7","57","503","4577","42135","389625","3608295","33421185","309404135","2862076793","26450155671","244200780001","2252364924919","20754653295801"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["-2","3","-2"],["2","-7","6"],["0","4","-6"],["0","0","2"]]},"terms":[{"coeff":{"coeffs":[["-22","9","38","8"],["14","-57","-58","8"],["0","32","-2","-28"],["0","0","14","12"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-2","0","16","18","4"],["0","-8","-22","-10","4"],["0","0","-4","-12","-8"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":183246,"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-253d4757de6b539e"]},{"id":183247,"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-253d4757de6b539e"]},{"id":183248,"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-253d4757de6b539e"]}],"region_exact":{},"incoming_edges":[{"id":"e-253d4757de6b539e","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-388eab6589a0653d","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":"9d7d33cf30a630335eca85194c1f6ff0b4e6f77f51b01138ef996c8ec4ac4180","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-60c7f085d1907563","role":"sequence","name":"basis_map_A013609 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-64e935917174cbd7","kind":"fingerprint_related","node_a_id":"n-388eab6589a0653d","node_b_id":"n-cfbcbd67ce2f033a","fingerprint":"f6-6f638175010ea5cb","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-6f638175010ea5cb"},"other_id":"n-cfbcbd67ce2f033a","other":{"id":"n-cfbcbd67ce2f033a","name":"theta_plus_one of basis_map_A007318 of Delannoy paths counted by number of weak peaks.","first_index":0,"fingerprint":"f6-6f638175010ea5cb","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["13","32","12"],["63","228","180","32"],["321","1536","1872","768","80"]],"card_rows":[["13","32","12"],["63","228","180","32"],["321","1536","1872","768","80"],["1683","10020","16560","10880","2800","192"]],"row_sums_preview":["57","503","4577","42135","389625","3608295","33421185","309404135"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b31aa1a3fd93d174","steps":["basis A007318","\u03b8+1"],"edges":["e-9a0dabc7f010818b","e-976053577b1d7133"],"text":"A133214 \u2192 basis A007318 \u2192 \u03b8+1"},"headline":"A133214 \u2192 basis A007318 \u2192 \u03b8+1","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,        4;\n   3:      13,       32,       12;\n   4:      63,      228,      180,       32;\n   5:     321,     1536,     1872,      768,       80;\n   6:    1683,    10020,    16560,    10880,     2800,      192;\n   7:    8989,    64032,   133740,   121600,    51600,     9216,      448;\n   8:   48639,   403396,  1018836,  1186080,   708400,   213696,    28224,    1024;\n   9:  265729,  2514944,  7452480, 10587136,  8187200,  3526656,   802816,   81920,   2304;\n  10: 1462563, 15554628, 52906176, 88779264, 84450240, 47561472, 15654912, 2801664, 228096, 5120;\n","recurrence_sentence":"The row polynomials satisfy (2*n-2+(4*n^2-7*n+3)*x+(2*n^3-6*n^2+6*n-2)*x^2)*P(n,x) = (14*n-22+(32*n^2-57*n+9)*x+(14*n^3-2*n^2-58*n+38)*x^2+(12*n^3-28*n^2+8*n+8)*x^3)*P(n-1,x) - (2+8*n*x+(4*n^2+22*n-16)*x^2+(12*n^2+10*n-18)*x^3+(8*n^2-4*n-4)*x^4)*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[((14*n - 22 + (32*n^2 - 57*n + 9)*x + (14*n^3 - 2*n^2 - 58*n + 38)*x^2 + (12*n^3 - 28*n^2 + 8*n + 8)*x^3)*P[n - 1, x] - (2 + 8*n*x + (4*n^2 + 22*n - 16)*x^2 + (12*n^2 + 10*n - 18)*x^3 + (8*n^2 - 4*n - 4)*x^4)*D[P[n - 1, x], x])/(2*n - 2 + (4*n^2 - 7*n + 3)*x + (2*n^3 - 6*n^2 + 6*n - 2)*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] = ((14*n - 22 + (32*n^2 - 57*n + 9)*x + (14*n^3 - 2*n^2 - 58*n + 38)*x^2 + (12*n^3 - 28*n^2 + 8*n + 8)*x^3)*v[i - 1] - (2 + 8*n*x + (4*n^2 + 22*n - 16)*x^2 + (12*n^2 + 10*n - 18)*x^3 + (8*n^2 - 4*n - 4)*x^4)*deriv(v[i - 1], x))/(2*n - 2 + (4*n^2 - 7*n + 3)*x + (2*n^3 - 6*n^2 + 6*n - 2)*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 A013609","\u03b8+1"],"edges":["e-2f2f885dba2c5644","e-253d4757de6b539e"],"text":"A104684 \u2192 basis A013609 \u2192 \u03b8+1"},"headline":"A104684 \u2192 basis A013609 \u2192 \u03b8+1","chain":null}