{"id":"n-398a4845fac4d9f1","revision":0,"first_index":0,"fingerprint":"f6-f0acff1b7583ce22","name":"theta_plus_one of basis_map_A007318 of Triangle of Dyck paths counted by number of long interior inclines.","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":[["2"],["5","4"],["14","24","6"],["42","112","63","8"],["132","480","432","128","10"],["429","1980","2475","1200","225","12"],["1430","8008","12870","8800","2750","360","14"],["4862","32032","63063","56056","25025","5544","539","16"],["16796","127296","297024","326144","191100","61152","10192","768","18"],["58786","503880","1360476","1782144","1299480","550368","133770","17472","1053","20"],["208012","1989680","6104700","9302400","8139600","4318272","1399440","268800","28350","1400","22"],["742900","7845024","26967270","46899600","47965500","30697920","12534984","3231360","504900","44000","1815","24"],["2674440","30904640","117675360","230120704","269672700","202606272","100279872","32744448","6907032","897600","65824","2304","26"],["9694845","121687020","508477905","1104840880","1460727125","1262068236","736206471","292653504","78567489","13856700","1524237","95472","2873","28"],["35357670","479039400","2179629270","5211067680","7677019350","7506418920","5052397350","2375657856","779512734","175735560","26360334","2489760","134862","3528","30"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["2","9","44","225","1182","6321","34232","187137","1030490","5707449","31760676","177435297","994551222","5590402785","31500824304"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["2"]],"recurrence":{"denominator":{"coeffs":[["9","0"],["18","3"],["11","7"],["2","5"],["0","1"]]},"terms":[{"coeff":{"coeffs":[["18","0","0"],["42","36","3"],["32","54","14"],["8","26","12"],["0","4","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-9","-12","-3"],["0","-12","-22","-10"],["0","-4","-12","-8"],["0","0","-2","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":177857,"position":0,"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-47d1189af3bc51cd"]},{"id":177858,"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-47d1189af3bc51cd"]},{"id":177859,"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-47d1189af3bc51cd"]},{"id":177860,"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-47d1189af3bc51cd"]}],"region_exact":{},"incoming_edges":[{"id":"e-47d1189af3bc51cd","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-398a4845fac4d9f1","premise_count":1,"theorem":"Laguerre's theorem on multiplier sequences: if f is a real polynomial whose roots are all real and <= 0, then (f(k))_(k >= 0) is a multiplier sequence, so x^k -> f(k) x^k maps every real-rooted polynomial to a real-rooted polynomial or zero (Laguerre; see T. Craven and G. Csordas, Multiplier sequences for fields, Illinois J. Math. 21 (1977); Polya--Schur, Theorem 40 of P. Branden, arXiv:1410.6601: sum_k f(k) x^k / k! = f(theta) e^x = C e^x x^m prod (1 + x/a_j), a_j > 0); f(k) has one sign for k >= 0, so coefficients of one sign stay of one sign; applied to f(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.isMultiplierSequence_eval_of_roots_nonpos","RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos","RealRooted.isMultiplierSequence_iff_preserves"],"certificate_hash":"fbe14c3d9805bc9a0363eee6342c251ae4d4a2c170dea98d613731989c90508a","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-3b95e3dd4c91b92c","role":"sequence","name":"basis_map_A007318 of Triangle of Dyck paths counted by number of long interior inclines.","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-35de83d0525ee14d","kind":"fingerprint_related","node_a_id":"n-731ce0c1f40f7072","node_b_id":"n-398a4845fac4d9f1","fingerprint":"f6-f0acff1b7583ce22","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-f0acff1b7583ce22"},"other_id":"n-731ce0c1f40f7072","other":{"id":"n-731ce0c1f40f7072","name":"theta_plus_one of derivative of Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks at level one (n >= 1; 0 <= k <= n-1).","first_index":0,"fingerprint":"f6-f0acff1b7583ce22","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[[],["1"],["5","4"]],"card_rows":[["1"],["5","4"],["21","36","9"],["84","224","126","16"]],"row_sums_preview":["0","1","9","66","450","2955","18963","119812"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-57b4b14604f4c0d7","steps":["D","\u03b8+1"],"edges":["e-a4f714b61c97080d","e-83b6259d16c6e61c"],"text":"A126216 \u2192 D \u2192 \u03b8+1"},"headline":"A126216 \u2192 D \u2192 \u03b8+1","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:     2;\n  1:     5,      4;\n  2:    14,     24,       6;\n  3:    42,    112,      63,       8;\n  4:   132,    480,     432,     128,      10;\n  5:   429,   1980,    2475,    1200,     225,     12;\n  6:  1430,   8008,   12870,    8800,    2750,    360,     14;\n  7:  4862,  32032,   63063,   56056,   25025,   5544,    539,    16;\n  8: 16796, 127296,  297024,  326144,  191100,  61152,  10192,   768,   18;\n  9: 58786, 503880, 1360476, 1782144, 1299480, 550368, 133770, 17472, 1053, 20;\n","recurrence_sentence":"The row polynomials satisfy (2*n^3+11*n^2+18*n+9+(n^4+5*n^3+7*n^2+3*n)*x)*P(n,x) = (8*n^3+32*n^2+42*n+18+(4*n^4+26*n^3+54*n^2+36*n)*x+(3*n^4+12*n^3+14*n^2+3*n)*x^2)*P(n-1,x) - ((4*n^2+12*n+9)*x+(2*n^3+12*n^2+22*n+12)*x^2+(2*n^3+8*n^2+10*n+3)*x^3)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 2.","mathematica":"P[0, x_] := 2;\nP[n_, x_] := P[n, x] = Expand[Together[((8*n^3 + 32*n^2 + 42*n + 18 + (4*n^4 + 26*n^3 + 54*n^2 + 36*n)*x + (3*n^4 + 12*n^3 + 14*n^2 + 3*n)*x^2)*P[n - 1, x] - ((4*n^2 + 12*n + 9)*x + (2*n^3 + 12*n^2 + 22*n + 12)*x^2 + (2*n^3 + 8*n^2 + 10*n + 3)*x^3)*D[P[n - 1, x], x])/(2*n^3 + 11*n^2 + 18*n + 9 + (n^4 + 5*n^3 + 7*n^2 + 3*n)*x)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 2; for(n = 1, N, my(i = n + 1); v[i] = ((8*n^3 + 32*n^2 + 42*n + 18 + (4*n^4 + 26*n^3 + 54*n^2 + 36*n)*x + (3*n^4 + 12*n^3 + 14*n^2 + 3*n)*x^2)*v[i - 1] - ((4*n^2 + 12*n + 9)*x + (2*n^3 + 12*n^2 + 22*n + 12)*x^2 + (2*n^3 + 8*n^2 + 10*n + 3)*x^3)*deriv(v[i - 1], x))/(2*n^3 + 11*n^2 + 18*n + 9 + (n^4 + 5*n^3 + 7*n^2 + 3*n)*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-c963abfc0266d66c","steps":["x \u21a6 x+1","\u03b8+1"],"edges":["e-454321f2b34b0823","e-47d1189af3bc51cd"],"text":"A108838 \u2192 x \u21a6 x+1 \u2192 \u03b8+1"},"headline":"A108838 \u2192 x \u21a6 x+1 \u2192 \u03b8+1","chain":null}
