{"id":"n-8f2b5ae45609013a","revision":0,"first_index":1,"fingerprint":"f6-031025df87457cd9","name":"mobius_x_over_x_plus_one of Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k middle edges (n >= 0, k >= 0).","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":-1,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":false,"rows":[["1"],["2","3"],["5","16","12"],["14","70","110","55"],["42","288","702","728","273"],["132","1155","3850","6160","4760","1428"],["429","4576","19448","42432","50388","31008","7752"],["1430","18018","93366","259350","418950","395010","201894","43263"],["4862","70720","433160","1466080","3010700","3853696","3010700","1315600","246675"],["16796","277134","1961256","7845024","19612560","31870410","33745140","22496760","8584290","1430715"],["58786","1085280","8721000","40310400","119041650","235282320","315888300","285012000","165663225","56097600","8414640"],["208012","4249388","38244492","200783583","685026342","1598394798","2607907302","2980465488","2341794312","1206378888","367158792","50067108"],["742900","16640960","165889570","975821000","3781306375","10189625600","19615029280","27220856960","27066193000","18828656000","8708253400","2406644576","300830572"],["2674440","65189475","713249550","4649330400","20187882000","61774918920","137277597600","224636068800","271028300400","238404523500","148764422664","62418638880","15797309840","1822766520"],["9694845","255487680","3044561520","21792650880","104877132360","359578739520","907119092880","1712821144320","2435417564580","2597778735552","2048248618416","1158605279104","444821669656","103831052864","11124755664"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","5","33","249","2033","17485","156033","1431281","13412193","127840085","1235575201","12080678505","119276490193","1187542872989","11909326179841"],"nonn":true,"definitions":[{"position":0,"source":"derived:mobius_x_over_x_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0","0","0"],["2","4","2"],["4","8","4"]]},"terms":[{"coeff":{"coeffs":[["0","0","0","0"],["-8","-22","-20","-6"],["14","46","50","18"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1","-6","-12","-10","-3"],["1","12","30","28","9"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":177483,"position":0,"claim":"real_rooted","from_index":1,"region_key":"[-1, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":true,"value":"-1"},"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in [-1, 0]","region_exact":null,"edges":["e-e3bf23808f4629c9"]},{"id":177484,"position":1,"claim":"one_signed_coefficients","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"alternating":false,"claim":"one_signed_coefficients","from_index":1},"label":"Coefficients of one sign","description":"Every nonzero row, n >= 1: the coefficients of P_n have one sign","region_exact":null,"edges":["e-e3bf23808f4629c9"]},{"id":177485,"position":2,"claim":"hadamard_kernel","from_index":1,"region_key":null,"provenance":"derived_from_edges","claim_data":{"claim":"hadamard_kernel","from_index":1},"label":"Hadamard kernel (Malo)","description":"Rows P_n, n >= 1, are Hadamard kernels (preserve real-rootedness)","region_exact":null,"edges":["e-e3bf23808f4629c9"]}],"region_exact":{},"incoming_edges":[{"id":"e-e3bf23808f4629c9","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"mobius\",\"a\":\"1\",\"b\":\"0\",\"c\":\"1\",\"e\":\"1\",\"schedule\":{\"first_index\":1,\"first_degree\":0,\"step\":1}}"},"operation_detail":"mobius, shift 0","conclusion_id":"n-8f2b5ae45609013a","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":"fTransform","lean_declarations":["RealRooted.splits_fPolynomial"],"certificate_hash":"09d0d8aa8b5817bc56fbc4ed2728d4a475eb01065a2cfd64996d74f84974c481","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"lower":{"closed":true,"value":"-1"},"upper":{"closed":true,"value":"0"}}}],"premises":[{"position":0,"node_id":"n-4479b0484a11b442","role":"sequence","name":"Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k middle edges (n >= 0, k >= 0).","uses":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"uses_text":"Every row P_n, n >= 1, 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":1,"oeis_offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n   1:     1;\n   2:     2,      3;\n   3:     5,     16,      12;\n   4:    14,     70,     110,      55;\n   5:    42,    288,     702,     728,      273;\n   6:   132,   1155,    3850,    6160,     4760,     1428;\n   7:   429,   4576,   19448,   42432,    50388,    31008,     7752;\n   8:  1430,  18018,   93366,  259350,   418950,   395010,   201894,    43263;\n   9:  4862,  70720,  433160, 1466080,  3010700,  3853696,  3010700,  1315600,  246675;\n  10: 16796, 277134, 1961256, 7845024, 19612560, 31870410, 33745140, 22496760, 8584290, 1430715;\n","recurrence_sentence":"The row polynomials satisfy (4*n^2+2*n+(8*n^2+4*n)*x+(4*n^2+2*n)*x^2)*P(n,x) = (14*n^2-8*n+(46*n^2-22*n)*x+(50*n^2-20*n)*x^2+(18*n^2-6*n)*x^3)*P(n-1,x) + (n-1+(12*n-6)*x+(30*n-12)*x^2+(28*n-10)*x^3+(9*n-3)*x^4)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.","mathematica":"P[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[((14*n^2 - 8*n + (46*n^2 - 22*n)*x + (50*n^2 - 20*n)*x^2 + (18*n^2 - 6*n)*x^3)*P[n - 1, x] + (n - 1 + (12*n - 6)*x + (30*n - 12)*x^2 + (28*n - 10)*x^3 + (9*n - 3)*x^4)*D[P[n - 1, x], x])/(4*n^2 + 2*n + (8*n^2 + 4*n)*x + (4*n^2 + 2*n)*x^2)]];\nTable[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten","pari":"P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((14*n^2 - 8*n + (46*n^2 - 22*n)*x + (50*n^2 - 20*n)*x^2 + (18*n^2 - 6*n)*x^3)*v[i - 1] + (n - 1 + (12*n - 6)*x + (30*n - 12)*x^2 + (28*n - 10)*x^3 + (9*n - 3)*x^4)*deriv(v[i - 1], x))/(4*n^2 + 2*n + (8*n^2 + 4*n)*x + (4*n^2 + 2*n)*x^2)); v};\nrow(n, p) = {my(c = Vecrev(p)); c};\nT(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};\nT(10)","reading":{"first_row":1,"offset":1,"reversed":false,"trim_zeros":"none","regular_triangle":false}}],"derivation":{"root":"n-4479b0484a11b442","steps":["x \u21a6 x/(x+1)"],"edges":["e-e3bf23808f4629c9"],"text":"A120986 \u2192 x \u21a6 x/(x+1)"},"headline":"A120986 \u2192 x \u21a6 x/(x+1)","chain":null}