{"id":"n-088546209518cf87","revision":1,"first_index":0,"fingerprint":"f6-134496fa7b090659","name":"theta_plus_one of Triangle of Eulerian numbers T(n,k), 0 <= k <= n, read by rows.","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","2"],["0","2","3"],["0","2","12","4"],["0","2","33","44","5"],["0","2","78","264","130","6"],["0","2","171","1208","1510","342","7"],["0","2","360","4764","12080","7146","840","8"],["0","2","741","17172","78095","93714","30051","1976","9"],["0","2","1506","58432","441170","937140","617638","116864","4518","10"],["0","2","3039","191360","2275960","7862124","9172478","3641536","430560","10130","11"],["0","2","6108","610548","11017440","58428684","110069736","77904912","19831392","1526370","22396","12"],["0","2","12249","1913084","50938425","397910844","1137586002","1300098288","596866266","101876850","5260981","48996","13"],["0","2","24534","5918904","227667250","2539689210","10539350556","18201376032","13550593572","4232815350","500867950","17756712","106314","14"],["0","2","49107","18149256","992053930","15430453050","89902840041","223769408736","251740584828","128432628630","28289163925","2380929432","58985082","229166","15"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","2","5","18","84","480","3240","25200","221760","2177280","23587200","279417600","3592512000","49816166400","741015475200"],"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","2"]],"recurrence":{"denominator":{"coeffs":[["0"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","-2","0"],["0","0","1"],["0","2","0"],["0","0","-1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","1","-1","0"],["0","1","-2","1"],["0","0","-1","1"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-1","0"],["-1","0"],["0","2"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","0"],["0","1","-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":164504,"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-bf324d0a6ff5828b"]},{"id":164505,"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-bf324d0a6ff5828b"]},{"id":164506,"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-bf324d0a6ff5828b"]}],"region_exact":{},"incoming_edges":[{"id":"e-bf324d0a6ff5828b","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-088546209518cf87","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":"a206967d2269b976255ffe52b19e9692f67af7adc15731f111f91a56bac4ff68","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-e24b36ff0794dfbd","role":"sequence","name":"Triangle of Eulerian numbers T(n,k), 0 <= k <= n, read by rows.","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-c146fb3e2d8647c3","kind":"fingerprint_related","node_a_id":"n-088546209518cf87","node_b_id":"n-371ab4c129aed7f5","fingerprint":"f6-134496fa7b090659","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-134496fa7b090659"},"other_id":"n-371ab4c129aed7f5","other":{"id":"n-371ab4c129aed7f5","name":"theta_plus_one of Triangle read by rows: T(n,k) is the number of permutations of 1..n arranged in a circle with exactly k descents.","first_index":1,"fingerprint":"f6-134496fa7b090659","polytool_family":null,"degree_pattern":"irregular","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1"],["0","4"]],"card_rows":[["1"],["1"],["0","4"],["0","6","9"]],"row_sums_preview":["1","1","4","15","72","420","2880","22680"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-3ffff24fcb4f40a0","steps":["\u03b8+1"],"edges":["e-ad337510ccdadb92"],"text":"A334218 \u2192 \u03b8+1"},"headline":"A334218 \u2192 \u03b8+1","chain":null}},{"id":"l-7c740038fad50b54","kind":"oeis_match","node_a_id":"n-088546209518cf87","node_b_id":null,"fingerprint":null,"oeis_id":"A038720","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":1,"low_zeros_dropped":false,"oeis_offset":1,"oeis_term_position":0,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A038720","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A038720","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-088546209518cf87","oeis_id":"A038720","target":"row_sums","oeis_offset":1,"first_row":1,"rows_used":200,"terms_matched":14,"oeis_terms_agreeing":21,"oeis_terms_available":21,"term_count":200,"raw_size":34758}],"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, 2;\n  2: 0, 2,    3;\n  3: 0, 2,   12,     4;\n  4: 0, 2,   33,    44,      5;\n  5: 0, 2,   78,   264,    130,      6;\n  6: 0, 2,  171,  1208,   1510,    342,      7;\n  7: 0, 2,  360,  4764,  12080,   7146,    840,      8;\n  8: 0, 2,  741, 17172,  78095,  93714,  30051,   1976,    9;\n  9: 0, 2, 1506, 58432, 441170, 937140, 617638, 116864, 4518, 10;\n","recurrence_sentence":"The row polynomials satisfy n*P(n,x) = ((2*n^2-2)*x-(n^3-n)*x^2)*P(n-2,x) + ((n+1)*x-(n^2+2*n+1)*x^2+(n^2+n)*x^3)*d/dx P(n-2,x) - (n+1-2*n^2*x)*P(n-1,x) + (n*x-n*x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2*x;\nP[n_, x_] := P[n, x] = Expand[Together[(((2*n^2 - 2)*x - (n^3 - n)*x^2)*P[n - 2, x] + ((n + 1)*x - (n^2 + 2*n + 1)*x^2 + (n^2 + n)*x^3)*D[P[n - 2, x], x] - (n + 1 - 2*n^2*x)*P[n - 1, x] + (n*x - n*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; v[2] = 2*x; for(n = 2, N, my(i = n + 1); v[i] = (((2*n^2 - 2)*x - (n^3 - n)*x^2)*v[i - 2] + ((n + 1)*x - (n^2 + 2*n + 1)*x^2 + (n^2 + n)*x^3)*deriv(v[i - 2], x) - (n + 1 - 2*n^2*x)*v[i - 1] + (n*x - n*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-efd1fdf07e5468d8","steps":["reverse (shift +1)","\u03b8+1"],"edges":["e-61bc78adfe1eb25a","e-bf324d0a6ff5828b"],"text":"A173018 \u2192 reverse (shift +1) \u2192 \u03b8+1"},"headline":"A173018 \u2192 reverse (shift +1) \u2192 \u03b8+1","chain":null}