{"id":"n-544f9159ada5f1ab","revision":0,"first_index":0,"fingerprint":"f6-d0a612563fb7dda7","name":"reversal of Triangle read by rows, Stirling cycle numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k > n, otherwise T(n, k) = T(n-1, k-1) + (n-1)^2*T(n-1, k), for 0 <= k <= n.","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":true,"rows":[["1"],["1"],["1","1"],["1","5","4"],["1","14","49","36"],["1","30","273","820","576"],["1","55","1023","7645","21076","14400"],["1","91","3003","44473","296296","773136","518400"],["1","140","7462","191620","2475473","15291640","38402064","25401600"],["1","204","16422","669188","14739153","173721912","1017067024","2483133696","1625702400"],["1","285","32946","1999370","68943381","1367593305","15088541896","84865562640","202759531776","131681894400"],["1","385","61446","5293970","268880381","8261931405","151847872396","1593719752240","8689315795776","20407635072000","13168189440000"],["1","506","108031","12728936","909450751","40796457506","1151541572401","19967312312156","201529405816816","1071814846360896","2482492033152000","1593350922240000"],["1","650","180895","28285400","2742417535","171757365650","7026231453265","185789298737900","3076822378767280","30092049283982400","156823829909121024","359072203696128000","229442532802560000"],["1","819","290745","58856655","7522650135","635225929065","36053226248115","1373222414339685","34475213865472380","550075031295652720","5242380158902146624","26862299458337581056","60912644957448192000","38775788043632640000"]],"degrees":[0,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["1","1","2","10","100","1700","44200","1635400","81770000","5315050000","435834100000","44019244100000","5370347780200000","778700428129000000","132379072781930000000"],"nonn":true,"definitions":[{"position":0,"source":"derived:reversal","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","1"],["0","-2"],["0","1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":185963,"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-a512ac08237ec568"]},{"id":185964,"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-a512ac08237ec568"]},{"id":185965,"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-a512ac08237ec568"]}],"region_exact":{},"incoming_edges":[{"id":"e-a512ac08237ec568","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"reversal\",\"schedule\":{\"first_index\":0,\"first_degree\":0,\"step\":1}}"},"operation_detail":"reversal, shift 0","conclusion_id":"n-544f9159ada5f1ab","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":"reversed","lean_declarations":["RealRooted.X_pow_mul_reverse_eq_zero_or_splits","RealRooted.reflect_eq_zero_or_splits"],"certificate_hash":"19d92344ef922589571033047ba5f2e50d04227d3366a25c789e6baae78b05b9","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-54284d24a094e2d3","role":"sequence","name":"Triangle read by rows, Stirling cycle numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k > n, otherwise T(n, k) = T(n-1, k-1) + (n-1)^2*T(n-1, k), for 0 <= k <= n.","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-199f6917030f5d71","kind":"fingerprint_related","node_a_id":"n-544f9159ada5f1ab","node_b_id":"n-04f83371218a2837","fingerprint":"f6-d0a612563fb7dda7","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-d0a612563fb7dda7"},"other_id":"n-04f83371218a2837","other":{"id":"n-04f83371218a2837","name":"reversal of Triangle of central factorial numbers |t(2n,2n-2k)| read by rows.","first_index":0,"fingerprint":"f6-d0a612563fb7dda7","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["1","1"],["4","5","1"]],"card_rows":[["1"],["1","1"],["4","5","1"],["36","49","14","1"]],"row_sums_preview":["1","2","10","100","1700","44200","1635400","81770000"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-e734a631f8279507","steps":["reverse"],"edges":["e-f36ad1c2e4c5071a"],"text":"A008955 \u2192 reverse"},"headline":"A008955 \u2192 reverse","chain":null}},{"id":"l-82486b8eaa878db4","kind":"fingerprint_related","node_a_id":"n-54284d24a094e2d3","node_b_id":"n-544f9159ada5f1ab","fingerprint":"f6-d0a612563fb7dda7","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-d0a612563fb7dda7"},"other_id":"n-54284d24a094e2d3","other":{"id":"n-54284d24a094e2d3","name":"Triangle read by rows, Stirling cycle numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k > n, otherwise T(n, k) = T(n-1, k-1) + (n-1)^2*T(n-1, k), for 0 <= k <= n.","first_index":0,"fingerprint":"f6-d0a612563fb7dda7","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["0","1"],["0","1","1"]],"card_rows":[["1"],["0","1"],["0","1","1"],["0","4","5","1"]],"row_sums_preview":["1","1","2","10","100","1700","44200","1635400"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A269944"],"derivation":{"root":"n-54284d24a094e2d3","steps":[],"edges":[],"text":"A269944"},"headline":"A269944: Triangle read by rows, Stirling cycle numbers of order 2, T(n, n) = 1, T(n, k) = 0 if k < 0 or k > n, otherwise T(n, k) = T(n-1, k-1) + (n-1)^2*T(n-1, k), for 0 <= k <= n.","chain":null}},{"id":"l-92d034ef89a5f3ed","kind":"fingerprint_related","node_a_id":"n-e734a631f8279507","node_b_id":"n-544f9159ada5f1ab","fingerprint":"f6-d0a612563fb7dda7","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-d0a612563fb7dda7"},"other_id":"n-e734a631f8279507","other":{"id":"n-e734a631f8279507","name":"Triangle of central factorial numbers |t(2n,2n-2k)| read by rows.","first_index":0,"fingerprint":"f6-d0a612563fb7dda7","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["1","1"],["1","5","4"]],"card_rows":[["1"],["1","1"],["1","5","4"],["1","14","49","36"]],"row_sums_preview":["1","2","10","100","1700","44200","1635400","81770000"],"regions":["(-inf, 0)","(-inf, 0]"],"region_exact":{},"oeis_ids":["A008955"],"derivation":{"root":"n-e734a631f8279507","steps":[],"edges":[],"text":"A008955"},"headline":"A008955: Triangle of central factorial numbers |t(2n,2n-2k)| read by rows.","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: 1,   1;\n  3: 1,   5,     4;\n  4: 1,  14,    49,     36;\n  5: 1,  30,   273,    820,      576;\n  6: 1,  55,  1023,   7645,    21076,     14400;\n  7: 1,  91,  3003,  44473,   296296,    773136,     518400;\n  8: 1, 140,  7462, 191620,  2475473,  15291640,   38402064,   25401600;\n  9: 1, 204, 16422, 669188, 14739153, 173721912, 1017067024, 2483133696, 1625702400;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (1+(n^2-2*n+1)*x)*P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(1 + (n^2 - 2*n + 1)*x)*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; for(n = 1, N, my(i = n + 1); v[i] = (1 + (n^2 - 2*n + 1)*x)*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-54284d24a094e2d3","steps":["reverse"],"edges":["e-a512ac08237ec568"],"text":"A269944 \u2192 reverse"},"headline":"A269944 \u2192 reverse","chain":null}