{"id":"n-aaa9c7a58685e715","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 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.","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":[["2"],["2","16"],["2","48","72"],["2","96","432","256"],["2","160","1440","2560","800"],["2","240","3600","12800","12000","2304"],["2","336","7560","44800","84000","48384","6272"],["2","448","14112","125440","392000","451584","175616","16384"],["2","576","24192","301056","1411200","2709504","2107392","589824","41472"],["2","720","38880","645120","4233600","12192768","15805440","8847360","1866240","102400"],["2","880","59400","1267200","11088000","44706816","86929920","81100800","34214400","5632000","247808"],["2","1056","87120","2323200","26136000","140507136","382491648","535265280","376358400","123904000","16355328","589824"],["2","1248","123552","4026880","56628000","391412736","1420683264","2783379456","2935595520","1610752000","425238528","46006272","1384448"],["2","1456","170352","6662656","114514400","989404416","4617220608","12061310976","17809279488","14657843200","6449451008","1395523584","125984768","3211264"],["2","1680","229320","10599680","218618400","2308610304","13466893440","45229916160","89046397440","102604902400","67719235584","24421662720","4409466880","337182720","7372800"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["2","18","122","786","4962","30946","191354","1175586","7185218","43732530","265247226","1604018994","9675231906","58230578178","349781089530"],"nonn":true,"definitions":[{"position":0,"source":"derived:theta_plus_one_squared","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":1,"initial_polynomials":[["2"]],"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":177457,"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-4e635e772788e7f2"]},{"id":177458,"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-4e635e772788e7f2"]},{"id":177459,"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-4e635e772788e7f2"]},{"id":177460,"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-4e635e772788e7f2"]}],"region_exact":{},"incoming_edges":[{"id":"e-4e635e772788e7f2","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-aaa9c7a58685e715","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":"8a4340e7cf568f04a71df0e238474d460149e4a63e4ead8b9d0ce3f1e5cd66b6","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-435b4d5bded8f11f","role":"sequence","name":"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.","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-9bbf8f710734b438","kind":"fingerprint_related","node_a_id":"n-25c9e6499efaa423","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-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-b28735f6d6418132","other":{"id":"n-b28735f6d6418132","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).","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":[["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-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}}],"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: 2;\n   2: 2,  16;\n   3: 2,  48,    72;\n   4: 2,  96,   432,    256;\n   5: 2, 160,  1440,   2560,     800;\n   6: 2, 240,  3600,  12800,   12000,     2304;\n   7: 2, 336,  7560,  44800,   84000,    48384,     6272;\n   8: 2, 448, 14112, 125440,  392000,   451584,   175616,   16384;\n   9: 2, 576, 24192, 301056, 1411200,  2709504,  2107392,  589824,   41472;\n  10: 2, 720, 38880, 645120, 4233600, 12192768, 15805440, 8847360, 1866240, 102400;\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) = 2.","mathematica":"P[1, x_] := 2;\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] = 2; 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-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}