{"id":"n-b28735f6d6418132","revision":0,"first_index":1,"fingerprint":"f6-e9eb093223c2e083","name":"theta_plus_one_squared of reversal of Triangle read by rows: T(n,k) is the number of double rise-bicolored Dyck paths (double rises come in two colors; also called marked Dyck paths) of semilength n and having k peaks (1 <= k <= n).","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"],["1","8"],["1","24","36"],["1","48","216","128"],["1","80","720","1280","400"],["1","120","1800","6400","6000","1152"],["1","168","3780","22400","42000","24192","3136"],["1","224","7056","62720","196000","225792","87808","8192"],["1","288","12096","150528","705600","1354752","1053696","294912","20736"],["1","360","19440","322560","2116800","6096384","7902720","4423680","933120","51200"],["1","440","29700","633600","5544000","22353408","43464960","40550400","17107200","2816000","123904"],["1","528","43560","1161600","13068000","70253568","191245824","267632640","188179200","61952000","8177664","294912"],["1","624","61776","2013440","28314000","195706368","710341632","1391689728","1467797760","805376000","212619264","23003136","692224"],["1","728","85176","3331328","57257200","494702208","2308610304","6030655488","8904639744","7328921600","3224725504","697761792","62992384","1605632"],["1","840","114660","5299840","109309200","1154305152","6733446720","22614958080","44523198720","51302451200","33859617792","12210831360","2204733440","168591360","3686400"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","9","61","393","2481","15473","95677","587793","3592609","21866265","132623613","802009497","4837615953","29115289089","174890544765"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one_squared","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["1"]],"recurrence":{"denominator":{"coeffs":[["0","0"],["1","0"],["-1","2"],["0","-4"],["0","2"]]},"terms":[{"coeff":{"coeffs":[["0","-8","-8"],["1","20","20"],["-1","-10","-8"],["0","-4","-16"],["0","2","12"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","1","0","-4"],["0","-2","0","8"],["0","0","0","0"],["0","0","4","-8"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":176679,"position":0,"claim":"real_rooted","from_index":1,"region_key":"(-inf, 0]","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},"label":"Real-rooted","description":"Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]","region_exact":null,"edges":["e-4927de9c7ec4318a"]},{"id":176680,"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-4927de9c7ec4318a"]},{"id":176681,"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-4927de9c7ec4318a"]},{"id":176682,"position":3,"claim":"interlacing","from_index":2,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2","region_exact":null,"edges":["e-4927de9c7ec4318a"]}],"region_exact":{},"incoming_edges":[{"id":"e-4927de9c7ec4318a","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"euler_polynomial\",\"coefficients\":[{\"numerator\":[\"1\"],\"denominator\":[\"1\"]},{\"numerator\":[\"2\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-b28735f6d6418132","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":"3f2a5e9a32846077f3035d15cfcbb6ee447911e207230e04b24e678868361674","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":1,"region":{"upper":{"closed":true,"value":"0"}}},{"claim":"interlacing","from_index":2,"kind":"weak","orientation":"unordered"}],"premises":[{"position":0,"node_id":"n-c3c79310b753c17e","role":"sequence","name":"reversal of Triangle read by rows: T(n,k) is the number of double rise-bicolored Dyck paths (double rises come in two colors; also called marked Dyck paths) of semilength n and having k peaks (1 <= k <= n).","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":[{"id":"l-175e815ca627ef33","kind":"fingerprint_related","node_a_id":"n-25c9e6499efaa423","node_b_id":"n-b28735f6d6418132","fingerprint":"f6-e9eb093223c2e083","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-e9eb093223c2e083"},"other_id":"n-25c9e6499efaa423","other":{"id":"n-25c9e6499efaa423","name":"theta_plus_one_squared of Triangle read by rows: T(n,k) is the number of double rise-bicolored Dyck paths (double rises come in two colors; also called marked Dyck paths) of semilength n and having k double rises (0 <= k <= n-1).","first_index":0,"fingerprint":"f6-e9eb093223c2e083","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["1"],["1","8"],["1","24","36"]],"card_rows":[["1"],["1","8"],["1","24","36"],["1","48","216","128"]],"row_sums_preview":["1","9","61","393","2481","15473","95677","587793"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-8ce61d302cec295b","steps":["(\u03b8+1)\u00b2"],"edges":["e-70717e1652011a36"],"text":"A114687 \u2192 (\u03b8+1)\u00b2"},"headline":"A114687 \u2192 (\u03b8+1)\u00b2","chain":null}},{"id":"l-a6d1efb4b872252a","kind":"fingerprint_related","node_a_id":"n-b28735f6d6418132","node_b_id":"n-aaa9c7a58685e715","fingerprint":"f6-e9eb093223c2e083","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-e9eb093223c2e083"},"other_id":"n-aaa9c7a58685e715","other":{"id":"n-aaa9c7a58685e715","name":"theta_plus_one_squared of reversal of Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis. A weak ascent in a Schroeder path is a maximal sequence of consecutive U and H steps.","first_index":1,"fingerprint":"f6-e9eb093223c2e083","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["2"],["2","16"],["2","48","72"]],"card_rows":[["2"],["2","16"],["2","48","72"],["2","96","432","256"]],"row_sums_preview":["2","18","122","786","4962","30946","191354","1175586"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-6a30765140629bd5","steps":["reverse","(\u03b8+1)\u00b2"],"edges":["e-a35c7072fcaf677b","e-4e635e772788e7f2"],"text":"A114655 \u2192 reverse \u2192 (\u03b8+1)\u00b2"},"headline":"A114655 \u2192 reverse \u2192 (\u03b8+1)\u00b2","chain":null}}],"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: 1,   8;\n   3: 1,  24,    36;\n   4: 1,  48,   216,    128;\n   5: 1,  80,   720,   1280,     400;\n   6: 1, 120,  1800,   6400,    6000,    1152;\n   7: 1, 168,  3780,  22400,   42000,   24192,    3136;\n   8: 1, 224,  7056,  62720,  196000,  225792,   87808,    8192;\n   9: 1, 288, 12096, 150528,  705600, 1354752, 1053696,  294912,  20736;\n  10: 1, 360, 19440, 322560, 2116800, 6096384, 7902720, 4423680, 933120, 51200;\n","recurrence_sentence":"The row polynomials satisfy -(n^2-n-(2*n^4-4*n^3+2*n^2)*x)*P(n,x) = -(n^2-n-(2*n^4-4*n^3-10*n^2+20*n-8)*x-(12*n^4-16*n^3-8*n^2+20*n-8)*x^2)*P(n-1,x) - ((2*n-1)*x-4*n^3*x^2+(8*n^3-8*n+4)*x^3)*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[(-(n^2 - n - (2*n^4 - 4*n^3 - 10*n^2 + 20*n - 8)*x - (12*n^4 - 16*n^3 - 8*n^2 + 20*n - 8)*x^2)*P[n - 1, x] - ((2*n - 1)*x - 4*n^3*x^2 + (8*n^3 - 8*n + 4)*x^3)*D[P[n - 1, x], x])/(-n^2 + n + (2*n^4 - 4*n^3 + 2*n^2)*x)]];\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] = (-(n^2 - n - (2*n^4 - 4*n^3 - 10*n^2 + 20*n - 8)*x - (12*n^4 - 16*n^3 - 8*n^2 + 20*n - 8)*x^2)*v[i - 1] - ((2*n - 1)*x - 4*n^3*x^2 + (8*n^3 - 8*n + 4)*x^3)*deriv(v[i - 1], x))/(-n^2 + n + (2*n^4 - 4*n^3 + 2*n^2)*x)); 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-0d75f6272d2a2a84","steps":["reverse","(\u03b8+1)\u00b2"],"edges":["e-87267df0bda73e27","e-4927de9c7ec4318a"],"text":"A114656 \u2192 reverse \u2192 (\u03b8+1)\u00b2"},"headline":"A114656 \u2192 reverse \u2192 (\u03b8+1)\u00b2","chain":null}