{"id":"n-5f40aeb2fcfc43d2","revision":0,"first_index":0,"fingerprint":"f6-adb63b75c11d63d7","name":"shift_x_plus_one of Triangle read by rows: T(n,k) is the number of permutations of an n-set having k cycles of size > 1 (0<=k<=floor(n/2)).","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"],["2","1"],["6","5"],["24","26","3"],["120","154","35"],["720","1044","340","15"],["5040","8028","3304","315"],["40320","69264","33740","4900","105"],["362880","663696","367884","70532","3465"],["3628800","6999840","4302216","1008980","78750","945"],["39916800","80627040","53961336","14777620","1571570","45045"],["479001600","1007441280","724534272","224655816","29957620","1406790","10395"],["6227020800","13575738240","10386470016","3568061640","566780500","37147110","675675"],["87178291200","196287356160","158507316864","59371808496","10855452608","909508600","27747720","135135"]],"degrees":[0,0,1,1,2,2,3,3,4,4,5,5,6,6,7],"row_sums":["1","1","3","11","53","309","2119","16687","148329","1468457","16019531","190899411","2467007773","34361893981","513137616783"],"nonn":true,"definitions":[{"position":0,"source":"derived:shift_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","-1"],["0","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["0"],["1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":176295,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, -1]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, -1]","region_exact":null,"edges":["e-f1a4ce1766570bbe"]},{"id":176296,"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-9e748e197fdf43a2","e-f1a4ce1766570bbe"]},{"id":176297,"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-9e748e197fdf43a2","e-f1a4ce1766570bbe"]},{"id":176298,"position":3,"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-9e748e197fdf43a2"]},{"id":176299,"position":4,"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-9e748e197fdf43a2"]}],"region_exact":{},"incoming_edges":[{"id":"e-9e748e197fdf43a2","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-5f40aeb2fcfc43d2","premise_count":1,"theorem":"geometric family P_k = g(t) (a + d t)^k: T(p) = g(t) p(a + d t), so the roots of T(p) are those of g and the points (r - a)/d for the roots r of p (elementary)","lean_route":null,"lean_declarations":[],"certificate_hash":"0b492716a9e25a006039e552cdc742b5adc21ab899efce85a1111ac0cc758c28","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-497753d6192915db","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of permutations of an n-set having k cycles of size > 1 (0<=k<=floor(n/2)).","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]"}]},{"id":"e-f1a4ce1766570bbe","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-5f40aeb2fcfc43d2","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":"193444759e21525a2ffd7c1bb751d845e5bde8499e78e0b677f913582d01f1e2","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}}],"premises":[{"position":0,"node_id":"n-497753d6192915db","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of permutations of an n-set having k cycles of size > 1 (0<=k<=floor(n/2)).","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-8b5cd170595fcb8d","kind":"fingerprint_related","node_a_id":"n-f364085508d20047","node_b_id":"n-5f40aeb2fcfc43d2","fingerprint":"f6-adb63b75c11d63d7","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-adb63b75c11d63d7"},"other_id":"n-f364085508d20047","other":{"id":"n-f364085508d20047","name":"Triangle T(n,k) read by rows; related to number of preorders.","first_index":0,"fingerprint":"f6-adb63b75c11d63d7","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["0","2"],["0","3","6"]],"card_rows":[["1"],["0","2"],["0","3","6"],["0","0","20","24"]],"row_sums_preview":["1","2","9","44","265","1854","14833","133496"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A079510"],"derivation":{"root":"n-f364085508d20047","steps":[],"edges":[],"text":"A079510"},"headline":"A079510: Triangle T(n,k) read by rows; related to number of preorders.","chain":null}},{"id":"l-c44fe4711e4ce583","kind":"fingerprint_related","node_a_id":"n-148a066ece673d8a","node_b_id":"n-5f40aeb2fcfc43d2","fingerprint":"f6-adb63b75c11d63d7","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-adb63b75c11d63d7"},"other_id":"n-148a066ece673d8a","other":{"id":"n-148a066ece673d8a","name":"Regular triangle read by rows. T(n, k) = [[n, k]], where [[n, k]] are the second order Stirling cycle numbers (or second order reciprocal Stirling numbers). T(n, k) for 0 <= k <= n.","first_index":1,"fingerprint":"f6-adb63b75c11d63d7","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","2"],["0","6","3"]],"row_sums_preview":["1","0","1","2","9","44","265","1854"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A358622"],"derivation":{"root":"n-148a066ece673d8a","steps":[],"edges":[],"text":"A358622"},"headline":"A358622: Regular triangle read by rows. T(n, k) = [[n, k]], where [[n, k]] are the second order Stirling cycle numbers (or second order reciprocal Stirling numbers). T(n, k) for 0 <= k <= n.","chain":null}},{"id":"l-cda0ca60efeaa6a9","kind":"fingerprint_related","node_a_id":"n-f13c6b611f4ce3bb","node_b_id":"n-5f40aeb2fcfc43d2","fingerprint":"f6-adb63b75c11d63d7","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-adb63b75c11d63d7"},"other_id":"n-f13c6b611f4ce3bb","other":{"id":"n-f13c6b611f4ce3bb","name":"Triangle T(n,k) read by rows: associated Stirling numbers of first kind (n >= 2, 1 <= k <= floor(n/2)).","first_index":0,"fingerprint":"f6-adb63b75c11d63d7","polytool_family":null,"degree_pattern":"half_affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["2"],["6","3"]],"card_rows":[["1"],["2"],["6","3"],["24","20"]],"row_sums_preview":["1","2","9","44","265","1854","14833","133496"],"regions":["(-inf, 0)","(-inf, 0]"],"region_exact":{},"oeis_ids":["A008306"],"derivation":{"root":"n-f13c6b611f4ce3bb","steps":[],"edges":[],"text":"A008306"},"headline":"A008306: Triangle T(n,k) read by rows: associated Stirling numbers of first kind (n >= 2, 1 <= k <= floor(n/2)).","chain":null}},{"id":"l-e569061e6a7e4f22","kind":"fingerprint_related","node_a_id":"n-fd92598b7a526ebf","node_b_id":"n-5f40aeb2fcfc43d2","fingerprint":"f6-adb63b75c11d63d7","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-adb63b75c11d63d7"},"other_id":"n-fd92598b7a526ebf","other":{"id":"n-fd92598b7a526ebf","name":"Triangle T(n,k) read by rows: associated Stirling numbers of first kind (n >= 0 and 0 <= k <= floor(n/2)).","first_index":0,"fingerprint":"f6-adb63b75c11d63d7","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","2"],["0","6","3"]],"row_sums_preview":["1","0","1","2","9","44","265","1854"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A106828"],"derivation":{"root":"n-fd92598b7a526ebf","steps":[],"edges":[],"text":"A106828"},"headline":"A106828: Triangle T(n,k) read by rows: associated Stirling numbers of first kind (n >= 0 and 0 <= k <= floor(n/2)).","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:      2,      1;\n  3:      6,      5;\n  4:     24,     26,      3;\n  5:    120,    154,     35;\n  6:    720,   1044,    340,    15;\n  7:   5040,   8028,   3304,   315;\n  8:  40320,  69264,  33740,  4900,  105;\n  9: 362880, 663696, 367884, 70532, 3465;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (n-1)*x*P(n-2,x) + n*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 - 1)*x*P[n - 2, x] + n*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 - 1)*x*v[i - 2] + n*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-497753d6192915db","steps":["basis A007318"],"edges":["e-9e748e197fdf43a2"],"text":"A136394 \u2192 basis A007318"},"headline":"A136394 \u2192 basis A007318","chain":null}