{"id":"n-b7536fd26109db74","revision":1,"first_index":1,"fingerprint":"f6-5953f24a720dd506","name":"theta_plus_one of Triangle read by rows: T(n, k) = binomial(2n, 2k).","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"],["1","2"],["1","12","3"],["1","30","45","4"],["1","56","210","112","5"],["1","90","630","840","225","6"],["1","132","1485","3696","2475","396","7"],["1","182","3003","12012","15015","6006","637","8"],["1","240","5460","32032","64350","48048","12740","960","9"],["1","306","9180","74256","218790","262548","129948","24480","1377","10"],["1","380","14535","155040","629850","1108536","881790","310080","43605","1900","11"],["1","462","21945","298452","1598850","3879876","4526522","2558160","671517","73150","2541","12"],["1","552","31878","538384","3677355","11767536","18929092","15690048","6619239","1345960","116886","3312","13"],["1","650","44850","920920","7811375","31870410","67603900","77261600","47805615","15622750","2532530","179400","4225","14"],["1","756","61425","1506960","15540525","78738660","212952285","320932800","273795795","131231100","34189155","4520880","266175","5292","15"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","3","16","80","384","1792","8192","36864","163840","720896","3145728","13631488","58720256","251658240","1073741824"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["1","2"]],"recurrence":{"denominator":{"coeffs":[["6","-6"],["-3","13"],["0","-9"],["0","2"]]},"terms":[{"coeff":{"coeffs":[["6","30","4"],["-3","-5","12"],["0","-9","-19"],["0","2","6"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-6","4","2"],["0","0","-4","4"],["0","0","4","-4"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":164680,"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-731bf5f7395212d6"]},{"id":164681,"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-731bf5f7395212d6"]},{"id":164682,"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-731bf5f7395212d6"]},{"id":164683,"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-731bf5f7395212d6"]}],"region_exact":{},"incoming_edges":[{"id":"e-731bf5f7395212d6","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-b7536fd26109db74","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":"6d768097ee4066db1985ebe800c6e354355206e27edd62b28a2afe6eda763c6d","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-f7935c36a3c0ec8c","role":"sequence","name":"Triangle read by rows: T(n, k) = binomial(2n, 2k).","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":[],"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: 1,   2;\n   3: 1,  12,    3;\n   4: 1,  30,   45,     4;\n   5: 1,  56,  210,   112,      5;\n   6: 1,  90,  630,   840,    225,      6;\n   7: 1, 132, 1485,  3696,   2475,    396,      7;\n   8: 1, 182, 3003, 12012,  15015,   6006,    637,     8;\n   9: 1, 240, 5460, 32032,  64350,  48048,  12740,   960,    9;\n  10: 1, 306, 9180, 74256, 218790, 262548, 129948, 24480, 1377, 10;\n","recurrence_sentence":"The row polynomials satisfy -(3*n-6-(2*n^3-9*n^2+13*n-6)*x)*P(n,x) = -(3*n-6-(2*n^3-9*n^2-5*n+30)*x-(6*n^3-19*n^2+12*n+4)*x^2)*P(n-1,x) - (6*x-(4*n^2-4*n+4)*x^2+(4*n^2-4*n-2)*x^3)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 1 + 2*x.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 1 + 2*x;\nP[n_, x_] := P[n, x] = Expand[Together[(-(3*n - 6 - (2*n^3 - 9*n^2 - 5*n + 30)*x - (6*n^3 - 19*n^2 + 12*n + 4)*x^2)*P[n - 1, x] - (6*x - (4*n^2 - 4*n + 4)*x^2 + (4*n^2 - 4*n - 2)*x^3)*D[P[n - 1, x], x])/(-3*n + 6 + (2*n^3 - 9*n^2 + 13*n - 6)*x)]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1 + 2*x; for(n = 3, N, my(i = n); v[i] = (-(3*n - 6 - (2*n^3 - 9*n^2 - 5*n + 30)*x - (6*n^3 - 19*n^2 + 12*n + 4)*x^2)*v[i - 1] - (6*x - (4*n^2 - 4*n + 4)*x^2 + (4*n^2 - 4*n - 2)*x^3)*deriv(v[i - 1], x))/(-3*n + 6 + (2*n^3 - 9*n^2 + 13*n - 6)*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-f7935c36a3c0ec8c","steps":["\u03b8+1"],"edges":["e-731bf5f7395212d6"],"text":"A086645 \u2192 \u03b8+1"},"headline":"A086645 \u2192 \u03b8+1","chain":null}