{"id":"n-4770949c8ef98ba1","revision":0,"first_index":0,"fingerprint":"f6-6ce805bb80e27667","name":"shift_x_plus_one of Triangle T(n,k) read by rows; related to number of preorders.","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":false,"rows":[["1"],["2","2"],["9","15","6"],["44","112","92","24"],["265","900","1125","610","120"],["1854","7926","13374","11106","4524","720"],["14833","76615","163275","183505","114520","37548","5040"],["133496","809824","2089520","2970080","2509240","1258496","346464","40320"],["1334961","9312912","28253106","48657420","51996105","35278236","14827932","3526416","362880"],["14684570","115911930","404653620","819701260","1061328450","910420770","517111280","187411320","39296160","3628800"],["176214841","1553688103","6139447248","14313919466","21798515585","22649259171","16254020398","7951646428","2536564536","476166240","39916800"],["2290792932","22325993328","98564410812","260132659128","455921577132","557034287712","483969739428","298922273112","128579021328","36667868832","6236542080","479001600"],["32071101049","342506959652","1671586013383","4928955676502","9778166727043","13746247314800","14038794987217","10492269831758","5693863570252","2187375072168","564466421376","87820986240","6227020800"],["481066515734","5588727857454","29889767280450","97429342637550","215924472957270","343523178693618","403564648608198","354395395641210","232590885750300","112650797456120","39126442662384","9226041318144","1323378120960","87178291200"],["7697064251745","96665586508335","562388821664085","2008794774118275","4920914069975475","8744580985390965","11623093044057495","11737366636025745","9047586221902800","5296843827732600","2317936224180720","735071570822160","159652011692160","21251751494400","1307674368000"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","4","30","272","3020","39504","595336","10157440","193549968","4074148160","93889358816","2351124167424","63570351682240","1845801323790592","57281150264184960"],"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"],["2","2"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["1","1"],["1","1"]]},"deriv_order":0,"offset":2,"sign":"none"},{"coeff":{"coeffs":[["1","1"],["1","1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":181486,"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-d929165577c6db39"]},{"id":181487,"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-4f4cba9a7a5288b0","e-d929165577c6db39"]},{"id":181488,"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-4f4cba9a7a5288b0","e-d929165577c6db39"]},{"id":181489,"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-4f4cba9a7a5288b0"]},{"id":181490,"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-4f4cba9a7a5288b0"]}],"region_exact":{},"incoming_edges":[{"id":"e-4f4cba9a7a5288b0","operation":{"map":"A007318","operation":"basis_map"},"operation_detail":"A007318","conclusion_id":"n-4770949c8ef98ba1","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":"b186d0ae4b699d963aecc886a64aeedc5065941706a463f997e189ec6c82f7c6","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-f364085508d20047","role":"sequence","name":"Triangle T(n,k) read by rows; related to number of preorders.","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-d929165577c6db39","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-4770949c8ef98ba1","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":"c1c1ab92ed634422cb346e646537997d00cc2103672cb254bf65c3642b693276","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-f364085508d20047","role":"sequence","name":"Triangle T(n,k) read by rows; related to number of preorders.","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:        2,         2;\n  2:        9,        15,         6;\n  3:       44,       112,        92,        24;\n  4:      265,       900,      1125,       610,        120;\n  5:     1854,      7926,     13374,     11106,       4524,       720;\n  6:    14833,     76615,    163275,    183505,     114520,     37548,      5040;\n  7:   133496,    809824,   2089520,   2970080,    2509240,   1258496,    346464,     40320;\n  8:  1334961,   9312912,  28253106,  48657420,   51996105,  35278236,  14827932,   3526416,   362880;\n  9: 14684570, 115911930, 404653620, 819701260, 1061328450, 910420770, 517111280, 187411320, 39296160, 3628800;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (n+1+(n+1)*x)*P(n-2,x) + (n+1+(n+1)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 2*x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := 2 + 2*x;\nP[n_, x_] := P[n, x] = Expand[(n + 1 + (n + 1)*x)*P[n - 2, x] + (n + 1 + (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; v[2] = 2 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = (n + 1 + (n + 1)*x)*v[i - 2] + (n + 1 + (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-f364085508d20047","steps":["basis A007318"],"edges":["e-4f4cba9a7a5288b0"],"text":"A079510 \u2192 basis A007318"},"headline":"A079510 \u2192 basis A007318","chain":null}