{"id":"n-42c5fee8e0c9f6a5","revision":0,"first_index":0,"fingerprint":"f6-5f874879722b2208","name":"shift_x_plus_one of basis_map_A013609 of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1 <= k <= n; in other words, the unsigned Stirling numbers of the first kind in reverse order).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":true,"rows":[["1"],["4","2"],["28","30","8"],["280","468","260","48"],["3640","8324","7124","2704","384"],["58240","169584","197224","114504","33184","3840"],["1106560","3920976","5782264","4542264","2004544","471168","46080"],["24344320","101753312","182103472","180881504","107691664","38429312","7610112","645120"],["608608000","2933341920","6180639792","7435693152","5586395664","2683799424","805121792","137889792","10321920"],["17041024000","93088517760","225858068736","319450924512","290261555328","175701505824","70851799808","18353106432","2771030016","185794560"],["528271744000","3226564530560","8863370486016","14420140034592","15387126705408","11251977787104","5710435910528","1985982295552","452964059136","61180231680","3715891200"],["17961239296000","121325172407040","372339016196864","685278911868480","840405388744896","721084032280512","441698332274240","193152988080384","59092388512768","12045337178112","1472305397760","81749606400"],["664565853952000","4920101122164480","16688347737052928","34291456127858496","47541693268404672","46849838524256448","33648855068879168","17747420533555968","6822090088901632","1863894799896576","343563391991808","38360064983040","1961990553600"],["26582634158080000","214082757089331200","795456538658393600","1805555286277715968","2793245590060507776","3110077565948779392","2564050004385834368","1584767053133097088","734316537428520448","251930134307305472","62203800476983296","10467050791108608","1075841311703040","51011754393600"],["1143053268797440000","9949872311267481600","40198948360812198400","99911660392376807424","170665108388377881472","211944211857491731584","197336322035156700800","139938383407526537088","75949088597153097728","31393858823212707840","9728807181114834944","2191789597373202432","339338598554271744","32317062166609920","1428329123020800"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","66","1056","22176","576576","17873856","643458816","26381811456","1213563326976","61891729675776","3465936861843456","211422148572450816","13953861805781753856","990724188210504523776"],"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"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","0"],["3","2"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":187147,"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-f8eaadee387eaf51"]},{"id":187148,"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-57dfb6fb40499b43","e-9221d826f137e650","e-f8eaadee387eaf51"]},{"id":187149,"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-57dfb6fb40499b43","e-9221d826f137e650","e-f8eaadee387eaf51"]},{"id":187150,"position":3,"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-57dfb6fb40499b43","e-9221d826f137e650","e-f8eaadee387eaf51"]},{"id":187151,"position":4,"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-57dfb6fb40499b43","e-9221d826f137e650"]}],"region_exact":{},"incoming_edges":[{"id":"e-57dfb6fb40499b43","operation":{"map":"A013609","operation":"basis_map"},"operation_detail":"A013609","conclusion_id":"n-42c5fee8e0c9f6a5","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":"ab0fa8d97c2c049935aa14016fa96119aeb626d18f7ecdd004e9d0d1fa6148d3","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-6e1be0f1b7cdfa83","role":"sequence","name":"basis_map_A007318 of Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.","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-9221d826f137e650","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-42c5fee8e0c9f6a5","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":"19549a9c31a3a3fc2926493c7d21a21f23669af61f2faa340eec048ed7fe948d","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-656046abebe1865b","role":"sequence","name":"basis_map_A013609 of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1 <= k <= n; in other words, the unsigned Stirling numbers of the first kind in reverse order).","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-f8eaadee387eaf51","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-42c5fee8e0c9f6a5","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":"4d3098406d6a7b501e6e631325972bae51dafa371b8a109329395128c28db59f","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"-1"}}},{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-656046abebe1865b","role":"sequence","name":"basis_map_A013609 of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1 <= k <= n; in other words, the unsigned Stirling numbers of the first kind in reverse order).","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":[],"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:           4,           2;\n  2:          28,          30,            8;\n  3:         280,         468,          260,           48;\n  4:        3640,        8324,         7124,         2704,          384;\n  5:       58240,      169584,       197224,       114504,        33184,         3840;\n  6:     1106560,     3920976,      5782264,      4542264,      2004544,       471168,       46080;\n  7:    24344320,   101753312,    182103472,    180881504,    107691664,     38429312,     7610112,      645120;\n  8:   608608000,  2933341920,   6180639792,   7435693152,   5586395664,   2683799424,   805121792,   137889792,   10321920;\n  9: 17041024000, 93088517760, 225858068736, 319450924512, 290261555328, 175701505824, 70851799808, 18353106432, 2771030016, 185794560;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (3*n+1+2*n*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[(3*n + 1 + 2*n*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] = (3*n + 1 + 2*n*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-7fd16a32c438d522","steps":["basis A007318","basis A013609"],"edges":["e-08400314c95111bf","e-57dfb6fb40499b43"],"text":"A059364 \u2192 basis A007318 \u2192 basis A013609"},"headline":"A059364 \u2192 basis A007318 \u2192 basis A013609","chain":null}