{"id":"n-1fb634a2ec72e223","revision":1,"first_index":1,"fingerprint":"f6-832f8058e55c8435","name":"theta_plus_one of Triangle read by rows: T(n, k) = binomial(n+k-1, 2*k-1).","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"],["2","2"],["3","8","3"],["4","20","18","4"],["5","40","63","32","5"],["6","70","168","144","50","6"],["7","112","378","480","275","72","7"],["8","168","756","1320","1100","468","98","8"],["9","240","1386","3168","3575","2184","735","128","9"],["10","330","2376","6864","10010","8190","3920","1088","162","10"],["11","440","3861","13728","25025","26208","16660","6528","1539","200","11"],["12","572","6006","25740","57200","74256","59976","31008","10260","2100","242","12"],["13","728","9009","45760","121550","190944","189924","124032","53865","15400","2783","288","13"],["14","910","13104","77792","243100","453492","542640","434112","237006","88550","22264","3600","338","14"],["15","1120","18564","127296","461890","1007760","1424430","1364352","908523","425040","139150","31200","4563","392","15"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","14","46","145","444","1331","3926","11434","32960","94211","267384","754309","2116936","5914310"],"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":[["4","-2"],["-4","6"],["0","-6"],["0","2"]]},"terms":[{"coeff":{"coeffs":[["0","0","0"],["-4","-2","0"],["0","-4","-1"],["0","2","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-8","-2","0"],["0","0","-4","-1"],["0","0","4","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":163589,"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-2147a0005767de5d"]},{"id":163590,"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-2147a0005767de5d"]},{"id":163591,"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-2147a0005767de5d"]},{"id":163592,"position":3,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2","region_exact":null,"edges":["e-2147a0005767de5d"]}],"region_exact":{},"incoming_edges":[{"id":"e-2147a0005767de5d","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-1fb634a2ec72e223","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":"1a6ae616d59b6874a7b992da4ba15e8d57533c6d668afc7688d7b8ab2b06dac2","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-976cdb6e4a693ec8","role":"sequence","name":"Triangle read by rows: T(n, k) = binomial(n+k-1, 2*k-1).","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-306bc0b9fd528e07","kind":"oeis_match","node_a_id":"n-1fb634a2ec72e223","node_b_id":null,"fingerprint":null,"oeis_id":"A030267","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":15},"in_catalog":false,"oeis_id":"A030267","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A030267","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-1fb634a2ec72e223","oeis_id":"A030267","target":"row_sums","oeis_offset":1,"first_row":1,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":28,"oeis_terms_available":28,"term_count":200,"raw_size":9632}],"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:  2,   2;\n   3:  3,   8,    3;\n   4:  4,  20,   18,    4;\n   5:  5,  40,   63,   32,     5;\n   6:  6,  70,  168,  144,    50,    6;\n   7:  7, 112,  378,  480,   275,   72,    7;\n   8:  8, 168,  756, 1320,  1100,  468,   98,    8;\n   9:  9, 240, 1386, 3168,  3575, 2184,  735,  128,   9;\n  10: 10, 330, 2376, 6864, 10010, 8190, 3920, 1088, 162, 10;\n","recurrence_sentence":"The row polynomials satisfy -(4*n-4-(2*n^3-6*n^2+6*n-2)*x)*P(n,x) = -(4*n-(2*n^3-4*n^2-2*n)*x-(n^3-n^2)*x^2)*P(n-1,x) - (8*x-(4*n^2-4*n-2)*x^2-(n^2-n)*x^3)*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[(-(4*n - (2*n^3 - 4*n^2 - 2*n)*x - (n^3 - n^2)*x^2)*P[n - 1, x] - (8*x - (4*n^2 - 4*n - 2)*x^2 - (n^2 - n)*x^3)*D[P[n - 1, x], x])/(-4*n + 4 + (2*n^3 - 6*n^2 + 6*n - 2)*x)]];\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] = (-(4*n - (2*n^3 - 4*n^2 - 2*n)*x - (n^3 - n^2)*x^2)*v[i - 1] - (8*x - (4*n^2 - 4*n - 2)*x^2 - (n^2 - n)*x^3)*deriv(v[i - 1], x))/(-4*n + 4 + (2*n^3 - 6*n^2 + 6*n - 2)*x)); 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-976cdb6e4a693ec8","steps":["\u03b8+1"],"edges":["e-2147a0005767de5d"],"text":"A078812 \u2192 \u03b8+1"},"headline":"A078812 \u2192 \u03b8+1","chain":null}