{"id":"n-ead5149323bf4a66","revision":1,"first_index":0,"fingerprint":"f6-edbd463fbc3726ee","name":"veronese_section_2_1 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":-1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[[],["1"],["3"],["11","1"],["50","10"],["274","85","1"],["1764","735","21"],["13068","6769","322","1"],["109584","67284","4536","36"],["1026576","723680","63273","870","1"],["10628640","8409500","902055","18150","55"],["120543840","105258076","13339535","357423","1925","1"],["1486442880","1414014888","206070150","6926634","55770","78"],["19802759040","20313753096","3336118786","135036473","1474473","3731","1"],["283465647360","310989260400","56663366760","2681453775","37312275","143325","105"]],"degrees":[-1,0,0,1,1,2,2,3,3,4,4,5,5,6,6],"row_sums":["0","1","3","12","60","360","2520","20160","181440","1814400","19958400","239500800","3113510400","43589145600","653837184000"],"nonn":true,"definitions":[{"position":0,"source":"derived:veronese_section_2_1","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["-1","0"],["2","0"],["0","0"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","1"],["2","0"],["-1","0"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":168673,"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-59d75b370e10c587"]},{"id":168674,"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-59d75b370e10c587"]},{"id":168675,"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-59d75b370e10c587"]},{"id":168676,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 1","region_exact":null,"edges":["e-59d75b370e10c587"]}],"region_exact":{},"incoming_edges":[{"id":"e-59d75b370e10c587","operation":{"index_shift":0,"modulus":2,"operation":"veronese_section","residue":1},"operation_detail":"r=2, j=1, shift 0","conclusion_id":"n-ead5149323bf4a66","premise_count":1,"theorem":"Veronese sections of Polya frequency sequences (Aissen--Schoenberg--Whitney--Edrei): if P is real-rooted with coefficients of one sign, equivalently nonzero with all roots in (-inf, 0], every section V_(r,j)(P) is zero or real-rooted with roots in (-inf, 0]","lean_route":null,"lean_declarations":[],"certificate_hash":"e3854bad55ff92fb810c6af3cfa30d1b307da32516bf7237cd8566b0aa745994","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":"previous_interlaces_next"}],"premises":[{"position":0,"node_id":"n-efe23a76953cf69d","role":"sequence","name":"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-80cca81ef2c5f14f","kind":"fingerprint_related","node_a_id":"n-24a064d270958fff","node_b_id":"n-ead5149323bf4a66","fingerprint":"f6-edbd463fbc3726ee","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-edbd463fbc3726ee"},"other_id":"n-24a064d270958fff","other":{"id":"n-24a064d270958fff","name":"veronese_section_2_0 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-edbd463fbc3726ee","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],[],["0","1"]],"card_rows":[["1"],["0","1"],["0","3"],["0","11","1"]],"row_sums_preview":["1","0","1","3","12","60","360","2520"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-b9fbfb57d9269e2f","steps":["Veronese 2"],"edges":["e-b3060fae442da909"],"text":"A132393 \u2192 Veronese 2"},"headline":"A132393 \u2192 Veronese 2","chain":null}},{"id":"l-52a3aa529ee01c98","kind":"oeis_match","node_a_id":"n-ead5149323bf4a66","node_b_id":null,"fingerprint":null,"oeis_id":"A001710","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":0,"oeis_term_position":2,"target":"row_sums","terms_compared":14},"in_catalog":false,"oeis_id":"A001710","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-6009542f233475c7","kind":"oeis_match","node_a_id":"n-ead5149323bf4a66","node_b_id":null,"fingerprint":null,"oeis_id":"A188588","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":2,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":2,"target":"row_sums","terms_compared":13},"in_catalog":false,"oeis_id":"A188588","oeis_nonn":true},"other_id":null,"other":null},{"id":"l-eba1fab08b2977cc","kind":"oeis_match","node_a_id":"n-ead5149323bf4a66","node_b_id":null,"fingerprint":null,"oeis_id":"A357711","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":3,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":3,"target":"row_sums","terms_compared":12},"in_catalog":false,"oeis_id":"A357711","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A001710","relation":"match_row_sums"},{"oeis_id":"A188588","relation":"match_row_sums"},{"oeis_id":"A357711","relation":"match_row_sums"}],"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:       0;\n  1:       1;\n  2:       3;\n  3:      11,      1;\n  4:      50,     10;\n  5:     274,     85,     1;\n  6:    1764,    735,    21;\n  7:   13068,   6769,   322,   1;\n  8:  109584,  67284,  4536,  36;\n  9: 1026576, 723680, 63273, 870, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (2*n-1)*P(n-1,x) - (n^2-2*n+1-x)*P(n-2,x) for n >= 2, with P(0,x) = 0, P(1,x) = 1.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(2*n - 1)*P[n - 1, x] - (n^2 - 2*n + 1 - x)*P[n - 2, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = (2*n - 1)*v[i - 1] - (n^2 - 2*n + 1 - x)*v[i - 2]); 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 (j=1)"],"edges":["e-59d75b370e10c587"],"text":"A130534 \u2192 Veronese 2 (j=1)"},"headline":"A130534 \u2192 Veronese 2 (j=1)","chain":null}