{"id":"n-bb96aa87bc97cfc5","revision":0,"first_index":0,"fingerprint":"f6-47ec9182b50ec5d2","name":"basis_map_A008277 of veronese_section_2_0 of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers of x. T(n,k) is also the unsigned Stirling number |s(n+1, k+1)|, denoting the number of permutations on n+1 elements that contain exactly k+1 cycles.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"half_affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["3","1"],["12","6"],["60","38","1"],["360","270","15"],["2520","2156","181","1"],["20160","19208","2128","28"],["181440","189308","25750","556","1"],["1814400","2047500","327150","9900","45"],["19958400","24128608","4396658","171038","1335","1"],["239500800","307860168","62643768","2968548","33660","66"],["3113510400","4229437912","946129628","52661816","790358","2738","1"],["43589145600","62259304744","15128329580","963592448","18048758","93002","91"],["653837184000","977798607184","255636818324","18273926084","410359570","2855118","5033","1"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","4","18","99","645","4858","41524","397055","4198995","48656040","613007010","8342532853","121958514223","1905959755314"],"nonn":true,"definitions":[{"position":0,"source":"derived:basis_map_A008277","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","1"],["2","0"],["-1","0"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0","1"]]},"deriv_order":1,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["-1"],["2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":196768,"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-ae4df5c4521332ce"]},{"id":196769,"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-ae4df5c4521332ce"]},{"id":196770,"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-ae4df5c4521332ce"]}],"region_exact":{},"incoming_edges":[{"id":"e-ae4df5c4521332ce","operation":{"map":"A008277","operation":"basis_map"},"operation_detail":"A008277","conclusion_id":"n-bb96aa87bc97cfc5","premise_count":1,"theorem":"ray basis maps: for L f = (a + b t) f + kappa (t - h) f', b > 0, kappa >= 0, and g real-rooted with every root <= h, of multiplicity m at h, T(u^k) = L^k g sends every real polynomial with all roots in S to one with all roots in (-inf, h] if and only if S lies in (-inf, a + b h + kappa m] (RealRooted rayBasisMap_maps_realRootedIn_iff; the step is Ma and Wang, EJC 15 (2008) R17, Theorem 2)","lean_route":null,"lean_declarations":[],"certificate_hash":"220b2031573bb121c556c37f399acb446e029839d7ed44d2f0d0ad21dd6d334e","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-45bd09bce82616a5","role":"sequence","name":"veronese_section_2_0 of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in increasing powers of x. T(n,k) is also the unsigned Stirling number |s(n+1, k+1)|, denoting the number of permutations on n+1 elements that contain exactly k+1 cycles.","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-bce6927fd71028e6","kind":"fingerprint_related","node_a_id":"n-5ba012c0f05923f2","node_b_id":"n-bb96aa87bc97cfc5","fingerprint":"f6-47ec9182b50ec5d2","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-47ec9182b50ec5d2"},"other_id":"n-5ba012c0f05923f2","other":{"id":"n-5ba012c0f05923f2","name":"basis_map_A008277 of veronese_section_2_1 of Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.","first_index":0,"fingerprint":"f6-47ec9182b50ec5d2","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],["1"],["1"]],"card_rows":[["1"],["1"],["3","1"],["12","6"]],"row_sums_preview":["0","1","1","4","18","99","645","4858"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b9fbfb57d9269e2f","steps":["Veronese 2 (j=1)","basis A008277"],"edges":["e-b4f12c588dbcf356","e-b16057d1057ad6f9"],"text":"A132393 \u2192 Veronese 2 (j=1) \u2192 basis A008277"},"headline":"A132393 \u2192 Veronese 2 (j=1) \u2192 basis A008277","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:       1;\n  2:       3,       1;\n  3:      12,       6;\n  4:      60,      38,      1;\n  5:     360,     270,     15;\n  6:    2520,    2156,    181,    1;\n  7:   20160,   19208,   2128,   28;\n  8:  181440,  189308,  25750,  556,  1;\n  9: 1814400, 2047500, 327150, 9900, 45;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = -(n^2-2*n-x)*P(n-2,x) + x*d/dx P(n-2,x) + (2*n-1)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[-(n^2 - 2*n - x)*P[n - 2, x] + x*D[P[n - 2, x], x] + (2*n - 1)*P[n - 1, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 - 2*n - x)*v[i - 2] + x*deriv(v[i - 2], x) + (2*n - 1)*v[i - 1]); 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-efe23a76953cf69d","steps":["Veronese 2","basis A008277"],"edges":["e-4d965342a2d26168","e-ae4df5c4521332ce"],"text":"A130534 \u2192 Veronese 2 \u2192 basis A008277"},"headline":"A130534 \u2192 Veronese 2 \u2192 basis A008277","chain":null}
