{"id":"n-dcdf634434d2b81e","revision":1,"first_index":1,"fingerprint":"f6-5ab569ff3c1291af","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 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"],["2","4"],["4","24","9"],["8","96","108","16"],["16","320","720","320","25"],["32","960","3600","3200","750","36"],["64","2688","15120","22400","10500","1512","49"],["128","7168","56448","125440","98000","28224","2744","64"],["256","18432","193536","602112","705600","338688","65856","4608","81"],["512","46080","622080","2580480","4233600","3048192","987840","138240","7290","100"],["1024","112640","1900800","10137600","22176000","22353408","10866240","2534400","267300","11000","121"],["2048","270336","5575680","37171200","104544000","140507136","95622912","33454080","5880600","484000","15972","144"],["4096","638976","15814656","128860160","453024000","782825472","710341632","347922432","91737360","12584000","830544","22464","169"],["8192","1490944","43610112","426409984","1832230400","3957617664","4617220608","3015327744","1113079968","229028800","25193168","1362816","30758","196"],["16384","3440640","117411840","1356759040","6995788800","18468882432","26933786880","22614958080","11130799680","3206403200","529056528","47698560","2153060","41160","225"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","6","37","228","1401","8578","52333","318216","1929169","11664414","70360533","423528108","2544605961","15262611354","91407196509"],"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"],["2","0"],["-2","1"],["0","-2"],["0","1"]]},"terms":[{"coeff":{"coeffs":[["0","-8","-2"],["4","20","5"],["-4","-10","-2"],["0","-4","-4"],["0","2","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","4","0","-1"],["0","-8","0","2"],["0","0","0","0"],["0","0","4","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":165195,"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-e1d01b2b90edc2fe"]},{"id":165196,"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-e1d01b2b90edc2fe"]},{"id":165197,"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-e1d01b2b90edc2fe"]},{"id":165198,"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-e1d01b2b90edc2fe"]}],"region_exact":{},"incoming_edges":[{"id":"e-e1d01b2b90edc2fe","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-dcdf634434d2b81e","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":"cd278d979fa17d4dbda8e504726e100ebf6ec8dfba84a342a9f19abfab5d6d6c","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-0d75f6272d2a2a84","role":"sequence","name":"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-5773646621824d59","kind":"fingerprint_related","node_a_id":"n-dcdf634434d2b81e","node_b_id":"n-ffe0c414befb86c3","fingerprint":"f6-5ab569ff3c1291af","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-5ab569ff3c1291af"},"other_id":"n-ffe0c414befb86c3","other":{"id":"n-ffe0c414befb86c3","name":"theta_plus_one_squared 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-5ab569ff3c1291af","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["2"],["4","8"],["8","48","18"]],"card_rows":[["2"],["4","8"],["8","48","18"],["16","192","216","32"]],"row_sums_preview":["2","12","74","456","2802","17156","104666","636432"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-6a30765140629bd5","steps":["(\u03b8+1)\u00b2"],"edges":["e-b19e39c8911e8bee"],"text":"A114655 \u2192 (\u03b8+1)\u00b2"},"headline":"A114655 \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:   2,     4;\n   3:   4,    24,      9;\n   4:   8,    96,    108,      16;\n   5:  16,   320,    720,     320,      25;\n   6:  32,   960,   3600,    3200,     750,      36;\n   7:  64,  2688,  15120,   22400,   10500,    1512,     49;\n   8: 128,  7168,  56448,  125440,   98000,   28224,   2744,     64;\n   9: 256, 18432, 193536,  602112,  705600,  338688,  65856,   4608,   81;\n  10: 512, 46080, 622080, 2580480, 4233600, 3048192, 987840, 138240, 7290, 100;\n","recurrence_sentence":"The row polynomials satisfy -(2*n^2-2*n-(n^4-2*n^3+n^2)*x)*P(n,x) = -(4*n^2-4*n-(2*n^4-4*n^3-10*n^2+20*n-8)*x-(3*n^4-4*n^3-2*n^2+5*n-2)*x^2)*P(n-1,x) - ((8*n-4)*x-4*n^3*x^2+(2*n^3-2*n+1)*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[(-(4*n^2 - 4*n - (2*n^4 - 4*n^3 - 10*n^2 + 20*n - 8)*x - (3*n^4 - 4*n^3 - 2*n^2 + 5*n - 2)*x^2)*P[n - 1, x] - ((8*n - 4)*x - 4*n^3*x^2 + (2*n^3 - 2*n + 1)*x^3)*D[P[n - 1, x], x])/(-2*n^2 + 2*n + (n^4 - 2*n^3 + 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] = (-(4*n^2 - 4*n - (2*n^4 - 4*n^3 - 10*n^2 + 20*n - 8)*x - (3*n^4 - 4*n^3 - 2*n^2 + 5*n - 2)*x^2)*v[i - 1] - ((8*n - 4)*x - 4*n^3*x^2 + (2*n^3 - 2*n + 1)*x^3)*deriv(v[i - 1], x))/(-2*n^2 + 2*n + (n^4 - 2*n^3 + 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":["(\u03b8+1)\u00b2"],"edges":["e-e1d01b2b90edc2fe"],"text":"A114656 \u2192 (\u03b8+1)\u00b2"},"headline":"A114656 \u2192 (\u03b8+1)\u00b2","chain":null}