{"id":"n-67e1193c025dc08d","revision":1,"first_index":0,"fingerprint":"f6-a87ef1b254812a45","name":"theta_plus_one of Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.","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"],["1","2"],["1","6","3"],["1","12","18","4"],["1","20","63","40","5"],["1","30","165","220","75","6"],["1","42","360","860","600","126","7"],["1","56","693","2660","3325","1386","196","8"],["1","72","1218","6944","14175","10416","2842","288","9"],["1","90","1998","15960","49455","59346","27930","5328","405","10"],["1","110","3105","33240","147525","271782","206535","66480","9315","550","11"],["1","132","4620","64020","388575","1042272","1215984","621720","144045","15400","726","12"],["1","156","6633","115720","925650","3455892","5919837","4607856","1666170","289300","24321","936","13"],["1","182","9243","198484","2030600","10162152","24543519","28049736","15243228","4061200","545831","36972","1183","14"],["1","210","12558","325780","4159155","27039012","88813725","144051336","114189075","45065020","9150141","977340","54418","1470","15"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","3","10","35","129","497","1996","8325","35965","160523","738654","3497507","17012485","84882345","433839256"],"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":[["-2","4","0","0"],["0","-3","7","-2"],["0","-1","1","0"]]},"terms":[{"coeff":{"coeffs":[["-2","4","6","4","-2"],["0","-7","7","7","-2"],["0","-1","-4","3","0"],["0","0","-1","0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","0","4","4","-4"],["0","0","0","10","-4"],["0","0","0","2","0"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":163969,"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-54bc083045b2db5f"]},{"id":163970,"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-54bc083045b2db5f"]},{"id":163971,"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-54bc083045b2db5f"]},{"id":163972,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1","region_exact":null,"edges":["e-54bc083045b2db5f"]}],"region_exact":{},"incoming_edges":[{"id":"e-54bc083045b2db5f","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-67e1193c025dc08d","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":"5ec07a78134df8d0b1d0c01923c62c5ad728c3211ac8ac5ecb5643881ed2cf98","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-07e5356ad37f61ea","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'.","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: 1,  2;\n  2: 1,  6,    3;\n  3: 1, 12,   18,     4;\n  4: 1, 20,   63,    40,     5;\n  5: 1, 30,  165,   220,    75,     6;\n  6: 1, 42,  360,   860,   600,   126,     7;\n  7: 1, 56,  693,  2660,  3325,  1386,   196,    8;\n  8: 1, 72, 1218,  6944, 14175, 10416,  2842,  288,   9;\n  9: 1, 90, 1998, 15960, 49455, 59346, 27930, 5328, 405, 10;\n","recurrence_sentence":"The row polynomials satisfy -(2+(n^2+3*n-4)*x-(n^2+7*n)*x^2+2*n*x^3)*P(n,x) = -(2+(n^2+7*n-4)*x+(n^3+4*n^2-7*n-6)*x^2-(3*n^2+7*n+4)*x^3+(2*n+2)*x^4)*P(n-1,x) + (4*x^2+(2*n^2+10*n+4)*x^3-(4*n+4)*x^4)*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 + 7*n - 4)*x + (n^3 + 4*n^2 - 7*n - 6)*x^2 - (3*n^2 + 7*n + 4)*x^3 + (2*n + 2)*x^4)*P[n - 1, x] + (4*x^2 + (2*n^2 + 10*n + 4)*x^3 - (4*n + 4)*x^4)*D[P[n - 1, x], x])/(-2 - (n^2 + 3*n - 4)*x + (n^2 + 7*n)*x^2 - 2*n*x^3)]];\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 + 7*n - 4)*x + (n^3 + 4*n^2 - 7*n - 6)*x^2 - (3*n^2 + 7*n + 4)*x^3 + (2*n + 2)*x^4)*v[i - 1] + (4*x^2 + (2*n^2 + 10*n + 4)*x^3 - (4*n + 4)*x^4)*deriv(v[i - 1], x))/(-2 - (n^2 + 3*n - 4)*x + (n^2 + 7*n)*x^2 - 2*n*x^3)); 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-07e5356ad37f61ea","steps":["\u03b8+1"],"edges":["e-54bc083045b2db5f"],"text":"A100862 \u2192 \u03b8+1"},"headline":"A100862 \u2192 \u03b8+1","chain":null}