{"id":"n-8cf7d219ad279ebd","revision":1,"first_index":0,"fingerprint":"f6-c8b266a7b2cfefc3","name":"shift_x_plus_one of Triangle of increasing mobiles (circular rooted trees) with n nodes and k leaves.","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","1"],["7","8","2"],["36","65","36","6"],["245","606","530","192","24"],["2076","6527","7846","4474","1200","120"],["21059","80364","123198","96616","40644","8640","720"],["248836","1117085","2084376","2087738","1207240","401148","70560","5040"],["3356609","17330290","38128030","46556824","34401764","15697352","4302864","645120","40320"],["50896380","297098731","753179442","1085998038","979122872","570893340","214637832","50015376","6531840","362880"],["856958911","5580507456","16020314170","26652258440","28401290160","20213349152","9707884176","3098909808","627524640","72576000","3628800"],["15864014388","114013773289","365626755716","689612493110","848662231160","714288432400","418781124496","170686209408","47291684688","8463155040","878169600","39916800"],["320245960333","2517814510134","8921404094538","18815969882992","26274050009040","25553825304096","17723106020080","8817431159616","3117528286704","762471323136","122194846080","11496038400","479001600"],["7001257954796","59773223325415","231921963793326","540945941276018","845309635162096","933423967015824","748383867472160","440506658906608","190074469290720","59286656620080","12971259929088","1881681978240","161902540800","6227020800"]],"degrees":[0,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["1","1","3","17","143","1597","22243","371241","7222023","160459173","4008736731","111235201713","3394207960095","112958016436749","4071648712285971"],"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":[["0","-1"],["1","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["1","1"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":165388,"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-b1b9e47644aa1e3d"]},{"id":165389,"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-b1b9e47644aa1e3d"]},{"id":165390,"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-b1b9e47644aa1e3d"]},{"id":165391,"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-b1b9e47644aa1e3d"]}],"region_exact":{},"incoming_edges":[{"id":"e-b1b9e47644aa1e3d","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"affine\",\"slope\":\"1\",\"intercept\":\"1\"}"},"operation_detail":"affine, shift 0","conclusion_id":"n-8cf7d219ad279ebd","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":"0d017303fe1284eb2faaa73787b370381294d719e4250bfde4bce51008708431","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-50226352e9cd0ce4","role":"sequence","name":"Triangle of increasing mobiles (circular rooted trees) with n nodes and k leaves.","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:       1;\n  2:       2,        1;\n  3:       7,        8,        2;\n  4:      36,       65,       36,        6;\n  5:     245,      606,      530,      192,       24;\n  6:    2076,     6527,     7846,     4474,     1200,      120;\n  7:   21059,    80364,   123198,    96616,    40644,     8640,     720;\n  8:  248836,  1117085,  2084376,  2087738,  1207240,   401148,   70560,   5040;\n  9: 3356609, 17330290, 38128030, 46556824, 34401764, 15697352, 4302864, 645120, 40320;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = (n+(n-1)*x)*P(n-1,x) + (1+x)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.","mathematica":"P[0, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[(n + (n - 1)*x)*P[n - 1, x] + (1 + x)*D[P[n - 1, x], 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] = (n + (n - 1)*x)*v[i - 1] + (1 + x)*deriv(v[i - 1], x)); 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-50226352e9cd0ce4","steps":["x \u21a6 x+1"],"edges":["e-b1b9e47644aa1e3d"],"text":"A055356 \u2192 x \u21a6 x+1"},"headline":"A055356 \u2192 x \u21a6 x+1","chain":null}