{"id":"n-5a739e9e90502f2d","revision":1,"first_index":1,"fingerprint":"f6-a33ed99ce72b6651","name":"shift_x_plus_one of Triangle read by rows: T(n,k) is the number of permutations of 1..n arranged in a circle with exactly k descents.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"irregular","degree_slope":null,"degree_intercept":null,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["1"],["2","2"],["6","9","3"],["24","48","28","4"],["120","300","250","75","5"],["720","2160","2340","1080","186","6"],["5040","17640","23520","14700","4214","441","7"],["40320","161280","255360","201600","81648","15456","1016","8"],["362880","1632960","2993760","2857680","1501416","419580","54450","2295","9"],["3628800","18144000","37800000","42336000","27392400","10206000","2046300","186600","5110","10"],["39916800","219542400","512265600","658627200","506777040","236922840","65136720","9619500","627022","11253","11"],["479001600","2874009600","7424524800","10777536000","9617952960","5420701440","1906058880","397267200","44028072","2076624","24564","12"],["6227020800","40475635200","114680966400","185513328000","188436568320","124462578240","53496368640","14541246720","2342652312","197537340","6802250","53235","13"],["87178291200","610248038400","1881598118400","3356364211200","3824221040640","2898678182400","1475573299200","497239142400","106573106640","13465211760","872906580","22091160","114674","14"]],"degrees":[0,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["1","1","4","18","104","750","6492","65562","756688","9825030","141745220","2249446386","38943181752","730380757470","14752033754668"],"nonn":true,"definitions":[{"position":0,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"],["1"]],"recurrence":{"denominator":{"coeffs":[["-2"],["1"]]},"terms":[{"coeff":{"coeffs":[["2","2"],["-3","-3"],["1","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","1"],["0","-1","-1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":164723,"position":0,"claim":"real_rooted","from_index":1,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-5885e4696854d233"]},{"id":164724,"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-5885e4696854d233"]},{"id":164725,"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-5885e4696854d233"]},{"id":164726,"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-5885e4696854d233"]}],"region_exact":{},"incoming_edges":[{"id":"e-5885e4696854d233","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-5a739e9e90502f2d","premise_count":1,"theorem":"a real affine substitution x -> a x + b (a != 0), the reversal x^d p(1/x) (d >= deg p) and a real Mobius map (c x + e)^d p((a x + b)/(c x + e)) (a e - b c != 0, d >= deg p) map real roots to real roots: a root r of p gives the root (r - b)/a, 1/r (and 0) or (e r - b)/(a - c r) (and -e/c); for an input row that is a polynomial the degree condition holds automatically","lean_route":null,"lean_declarations":["Polynomial.Splits.comp_of_degree_le_one"],"certificate_hash":"216074aba97618879eb9ace0fa4e0f4fe2d9a926ebd6069627e6f5333fa33e8c","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"-1"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-3ffff24fcb4f40a0","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of permutations of 1..n arranged in a circle with exactly k descents.","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-13975ebb053f7edf","kind":"fingerprint_related","node_a_id":"n-45ec3349543b0d37","node_b_id":"n-5a739e9e90502f2d","fingerprint":"f6-a33ed99ce72b6651","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-a33ed99ce72b6651"},"other_id":"n-45ec3349543b0d37","other":{"id":"n-45ec3349543b0d37","name":"Triangle read by rows, 0 <= k <= n, T(n,k) = Sum_{j=0..n} A(n,j)*binomial(n-j,k) where A(n,j) are the Eulerian numbers A173018.","first_index":0,"fingerprint":"f6-a33ed99ce72b6651","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","1"],["2","3","1"]],"card_rows":[["1"],["1","1"],["2","3","1"],["6","12","7","1"]],"row_sums_preview":["1","2","6","26","150","1082","9366","94586"],"regions":["(-inf, 0]","(-inf, -1]"],"region_exact":{},"oeis_ids":["A130850"],"derivation":{"root":"n-677d34c7af372519","steps":["reverse"],"edges":["e-222fddff0a5b4a86"],"text":"A028246 \u2192 reverse"},"headline":"A130850: Triangle read by rows, 0 <= k <= n, T(n,k) = Sum_{j=0..n} A(n,j)*binomial(n-j,k) where A(n,j) are the Eulerian numbers A173018.","chain":"A028246 \u2192 reverse"}},{"id":"l-3e581bb02162afec","kind":"fingerprint_related","node_a_id":"n-677d34c7af372519","node_b_id":"n-5a739e9e90502f2d","fingerprint":"f6-a33ed99ce72b6651","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-a33ed99ce72b6651"},"other_id":"n-677d34c7af372519","other":{"id":"n-677d34c7af372519","name":"Triangular array a(n,k) = (1/k)*Sum_{i=0..k} (-1)^(k-i)*binomial(k,i)*i^n; n >= 1, 1 <= k <= n, read by rows.","first_index":0,"fingerprint":"f6-a33ed99ce72b6651","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","1"],["1","3","2"]],"card_rows":[["1"],["1","1"],["1","3","2"],["1","7","12","6"]],"row_sums_preview":["1","2","6","26","150","1082","9366","94586"],"regions":["[-1, 0)"],"region_exact":{},"oeis_ids":["A028246"],"derivation":{"root":"n-677d34c7af372519","steps":[],"edges":[],"text":"A028246"},"headline":"A028246: Triangular array a(n,k) = (1/k)*Sum_{i=0..k} (-1)^(k-i)*binomial(k,i)*i^n; n >= 1, 1 <= k <= n, read by rows.","chain":null}}],"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;\n   3:      2,       2;\n   4:      6,       9,       3;\n   5:     24,      48,      28,       4;\n   6:    120,     300,     250,      75,       5;\n   7:    720,    2160,    2340,    1080,     186,      6;\n   8:   5040,   17640,   23520,   14700,    4214,    441,     7;\n   9:  40320,  161280,  255360,  201600,   81648,  15456,  1016,    8;\n  10: 362880, 1632960, 2993760, 2857680, 1501416, 419580, 54450, 2295, 9;\n","recurrence_sentence":"The row polynomials satisfy (n-2)*P(n,x) = (n^2-3*n+2+(n^2-3*n+2)*x)*P(n-1,x) - ((n-1)*x+(n-1)*x^2)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 1.","mathematica":"P[1, x_] := 1;\nP[2, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[((n^2 - 3*n + 2 + (n^2 - 3*n + 2)*x)*P[n - 1, x] - ((n - 1)*x + (n - 1)*x^2)*D[P[n - 1, x], x])/(n - 2)]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1; for(n = 3, N, my(i = n); v[i] = ((n^2 - 3*n + 2 + (n^2 - 3*n + 2)*x)*v[i - 1] - ((n - 1)*x + (n - 1)*x^2)*deriv(v[i - 1], x))/(n - 2)); 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-3ffff24fcb4f40a0","steps":["x \u21a6 x+1"],"edges":["e-5885e4696854d233"],"text":"A334218 \u2192 x \u21a6 x+1"},"headline":"A334218 \u2192 x \u21a6 x+1","chain":null}