{"id":"n-eb866e3e5491780a","revision":0,"first_index":0,"fingerprint":"f6-31dfc9d837f82561","name":"theta_plus_one of basis_map_A008277 of Matrix product of unsigned Lah-triangle |A008297(n,k)| and unsigned Stirling1-triangle |A008275(n,k)|.","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","2"],["24","24","3"],["192","288","72","4"],["1920","3840","1440","160","5"],["23040","57600","28800","4800","300","6"],["322560","967680","604800","134400","12600","504","7"],["5160960","18063360","13547520","3763200","470400","28224","784","8"],["92897280","371589120","325140480","108380160","16934400","1354752","56448","1152","9"],["1857945600","8360755200","8360755200","3251404800","609638400","60963840","3386880","103680","1620","10"],["40874803200","204374016000","229920768000","102187008000","22353408000","2682408960","186278400","7603200","178200","2200","11"],["980995276800","5395474022400","6744342528000","3372171264000","843042816000","118025994240","9835499520","501811200","15681600","290400","2904","12"],["25505877196800","153035263180800","210423486873600","116901937152000","32878669824000","5260587171840","511445975040","31313018880","1223164800","30201600","453024","3744","13"],["714164561510400","4642069649817600","6963104474726400","4255230512332800","1329759535104000","239356716318720","26595190702080","1899656478720","89046397440","2748345600","54966912","681408","4732","14"],["21424936845312000","149974557917184000","243708656615424000","162472437743616000","55849900474368000","11169980094873600","1396247511859200","113979388723200","6233247820800","230861030400","5771525760","95397120","993720","5880","15"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","51","556","7365","114546","2042551","41034456","916353801","22504955230","602586474171","17464405187076","544549834216141","18172272147386826","646117166568133695"],"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"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","1"],["2","1"],["2","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","2"],["0","2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":187710,"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-6a06c894d6272209"]},{"id":187711,"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-6a06c894d6272209"]},{"id":187712,"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-6a06c894d6272209"]}],"region_exact":{},"incoming_edges":[{"id":"e-6a06c894d6272209","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-eb866e3e5491780a","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":"6a44f90d7aa424227d09cd7821b9b5f0ca006d45958b03cda062ad51b2b0de38","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-f1c436fe49d0588b","role":"sequence","name":"basis_map_A008277 of Matrix product of unsigned Lah-triangle |A008297(n,k)| and unsigned Stirling1-triangle |A008275(n,k)|.","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-5a26092f997bf1d7","kind":"fingerprint_related","node_a_id":"n-17e55966d5083866","node_b_id":"n-eb866e3e5491780a","fingerprint":"f6-31dfc9d837f82561","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-31dfc9d837f82561"},"other_id":"n-17e55966d5083866","other":{"id":"n-17e55966d5083866","name":"reversal of Triangle read by rows. A generalization of unsigned Lah numbers, called L[2,1].","first_index":1,"fingerprint":"f6-31dfc9d837f82561","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","2"],["1","8","8"]],"card_rows":[["1"],["1","2"],["1","8","8"],["1","18","72","48"]],"row_sums_preview":["1","3","17","139","1473","19091","291793","5129307"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-24ab55cfc575f41e","steps":["reverse"],"edges":["e-ea894ee43590ac57"],"text":"A286724 \u2192 reverse"},"headline":"A286724 \u2192 reverse","chain":null}},{"id":"l-ee2e8fa68ebe8571","kind":"fingerprint_related","node_a_id":"n-24ab55cfc575f41e","node_b_id":"n-eb866e3e5491780a","fingerprint":"f6-31dfc9d837f82561","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-31dfc9d837f82561"},"other_id":"n-24ab55cfc575f41e","other":{"id":"n-24ab55cfc575f41e","name":"Triangle read by rows. A generalization of unsigned Lah numbers, called L[2,1].","first_index":1,"fingerprint":"f6-31dfc9d837f82561","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2","1"],["8","8","1"]],"card_rows":[["1"],["2","1"],["8","8","1"],["48","72","18","1"]],"row_sums_preview":["1","3","17","139","1473","19091","291793","5129307"],"regions":["(-inf, 0]","(-inf, 0)"],"region_exact":{},"oeis_ids":["A286724"],"derivation":{"root":"n-24ab55cfc575f41e","steps":[],"edges":[],"text":"A286724"},"headline":"A286724: Triangle read by rows. A generalization of unsigned Lah numbers, called L[2,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,          2;\n  2:         24,         24,          3;\n  3:        192,        288,         72,          4;\n  4:       1920,       3840,       1440,        160,         5;\n  5:      23040,      57600,      28800,       4800,       300,        6;\n  6:     322560,     967680,     604800,     134400,     12600,      504,       7;\n  7:    5160960,   18063360,   13547520,    3763200,    470400,    28224,     784,      8;\n  8:   92897280,  371589120,  325140480,  108380160,  16934400,  1354752,   56448,   1152,    9;\n  9: 1857945600, 8360755200, 8360755200, 3251404800, 609638400, 60963840, 3386880, 103680, 1620, 10;\n","recurrence_sentence":"The row polynomials satisfy n*P(n,x) = (2*n^2+2*n+(n+1)*x)*P(n-1,x) + (2*n+2)*x*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 + 2*n + (n + 1)*x)*P[n - 1, x] + (2*n + 2)*x*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 + 2*n + (n + 1)*x)*v[i - 1] + (2*n + 2)*x*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-f1c436fe49d0588b","steps":["\u03b8+1"],"edges":["e-6a06c894d6272209"],"text":"A079621 \u2192 \u03b8+1"},"headline":"A079621 \u2192 \u03b8+1","chain":null}
