{"id":"n-8107172ab43297c1","revision":0,"first_index":0,"fingerprint":"f6-1793c0ef809343ce","name":"theta_plus_one of Triangle read by rows: T(n,k) is the number of flattened Catalan words of length n with exactly k runs of descents.","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"],["0","4"],["0","2","12"],["0","0","18","32"],["0","0","3","96","80"],["0","0","0","40","400","192"],["0","0","0","4","300","1440","448"],["0","0","0","0","70","1680","4704","1024"],["0","0","0","0","5","672","7840","14336","2304"],["0","0","0","0","0","108","4704","32256","41472","5120"],["0","0","0","0","0","6","1260","26880","120960","115200","11264"],["0","0","0","0","0","0","154","10560","133056","422400","309760","24576"],["0","0","0","0","0","0","7","2112","71280","591360","1393920","811008","53248"],["0","0","0","0","0","0","0","208","20592","411840","2416128","4392960","2076672","114688"],["0","0","0","0","0","0","0","8","3276","160160","2114112","9225216","13325312","5218304","245760"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","14","50","179","632","2192","7478","25157","83660","275570","900506","2922935","9433088","30292148"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["0","4"]],"recurrence":{"denominator":{"coeffs":[["4","0"],["2","16"],["-4","-48"],["-2","32"]]},"terms":[{"coeff":{"coeffs":[["-2","48","96"],["-1","20","-256"],["2","-40","-32"],["1","-28","192"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-4","0","64"],["0","-6","56","-128"],["0","-2","40","-128"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":173736,"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-9563ce3fb7cd4d4a"]},{"id":173737,"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-9563ce3fb7cd4d4a"]},{"id":173738,"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-9563ce3fb7cd4d4a"]}],"region_exact":{},"incoming_edges":[{"id":"e-9563ce3fb7cd4d4a","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-8107172ab43297c1","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":"ef3cb81fdf2d3aa399f627b63313b7a72ca18b7490a9887971373c183a69644b","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-5576233c61c40153","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of flattened Catalan words of length n with exactly k runs of descents.","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":[],"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: 0, 4;\n  2: 0, 2, 12;\n  3: 0, 0, 18, 32;\n  4: 0, 0,  3, 96,  80;\n  5: 0, 0,  0, 40, 400,  192;\n  6: 0, 0,  0,  4, 300, 1440,  448;\n  7: 0, 0,  0,  0,  70, 1680, 4704,  1024;\n  8: 0, 0,  0,  0,   5,  672, 7840, 14336,  2304;\n  9: 0, 0,  0,  0,   0,  108, 4704, 32256, 41472, 5120;\n","recurrence_sentence":"The row polynomials satisfy -(2*n^3+4*n^2-2*n-4-(32*n^3-48*n^2+16*n)*x)*P(n,x) = (n^3+2*n^2-n-2-(28*n^3+40*n^2-20*n-48)*x+(192*n^3-32*n^2-256*n+96)*x^2)*P(n-1,x) - ((2*n^2+6*n+4)*x-(40*n^2+56*n)*x^2+(128*n^2+128*n-64)*x^3)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 4*x;\nP[n_, x_] := P[n, x] = Expand[Together[((n^3 + 2*n^2 - n - 2 - (28*n^3 + 40*n^2 - 20*n - 48)*x + (192*n^3 - 32*n^2 - 256*n + 96)*x^2)*P[n - 1, x] - ((2*n^2 + 6*n + 4)*x - (40*n^2 + 56*n)*x^2 + (128*n^2 + 128*n - 64)*x^3)*D[P[n - 1, x], x])/(-2*n^3 - 4*n^2 + 2*n + 4 + (32*n^3 - 48*n^2 + 16*n)*x)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 4*x; for(n = 2, N, my(i = n + 1); v[i] = ((n^3 + 2*n^2 - n - 2 - (28*n^3 + 40*n^2 - 20*n - 48)*x + (192*n^3 - 32*n^2 - 256*n + 96)*x^2)*v[i - 1] - ((2*n^2 + 6*n + 4)*x - (40*n^2 + 56*n)*x^2 + (128*n^2 + 128*n - 64)*x^3)*deriv(v[i - 1], x))/(-2*n^3 - 4*n^2 + 2*n + 4 + (32*n^3 - 48*n^2 + 16*n)*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-5576233c61c40153","steps":["\u03b8+1"],"edges":["e-9563ce3fb7cd4d4a"],"text":"A372873 \u2192 \u03b8+1"},"headline":"A372873 \u2192 \u03b8+1","chain":null}