{"id":"n-3e16b3cbabac7254","revision":1,"first_index":0,"fingerprint":"f6-63d66b489de6a076","name":"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).","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"],["5","2"],["21","18","3"],["84","112","42","4"],["330","600","360","80","5"],["1287","2970","2475","900","135","6"],["5005","14014","15015","7700","1925","210","7"],["19448","64064","84084","56056","20020","3696","308","8"],["75582","286416","445536","366912","171990","45864","6552","432","9"],["293930","1259700","2267460","2227680","1299480","458640","95550","10920","585","10"],["1144066","5471620","11191950","12790800","8953560","3958416","1099560","184800","17325","770","11"],["4457400","23535072","53934540","70349400","57558600","30697920","10744272","2423520","336600","26400","990","12"],["17383860","100440080","254963280","373946144","350574510","219490128","93117024","26604864","4988412","583440","38896","1248","13"],["67863915","425904570","1186448445","1933471540","2045017975","1472412942","736206471","256071816","61108047","9699690","969969","55692","1547","14"]],"degrees":[-1,0,1,2,3,4,5,6,7,8,9,10,11,12,13],"row_sums":["0","1","7","42","242","1375","7773","43876","247684","1399293","7913955","44812878","254064726","1442131899","8195232633"],"nonn":true,"definitions":[{"position":0,"source":"derived:derivative","source_kind":"derived","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["0"],["1"]],"recurrence":{"denominator":{"coeffs":[["-2"],["1"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","-2"],["2","-1"],["4","3"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["0","-1","-1"],["0","-2","-2"]]},"deriv_order":1,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":164892,"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-a4f714b61c97080d"]},{"id":164893,"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-a4f714b61c97080d"]},{"id":164894,"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-a4f714b61c97080d"]},{"id":164895,"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-a4f714b61c97080d"]}],"region_exact":{},"incoming_edges":[{"id":"e-a4f714b61c97080d","operation":{"index_shift":0,"operation":"preserver_image","operator":"{\"shape\":\"derivative_polynomial\",\"coefficients\":[{\"numerator\":[\"0\"],\"denominator\":[\"1\"]},{\"numerator\":[\"1\"],\"denominator\":[\"1\"]}]}"},"operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-3e16b3cbabac7254","premise_count":1,"theorem":"Laguerre's theorem on differential operators: if phi is a real polynomial with only real roots, then phi(D) maps every real-rooted polynomial to a real-rooted polynomial or zero (write phi(D) = C D^j prod (1 + c_i D); D preserves real-rootedness by Rolle's theorem and p + c p' is real-rooted for every real c by Rolle's theorem applied to e^(x/c) p; Polya--Schur 1914); when the coefficients of phi have one sign, coefficients of one sign stay of one sign; applied to phi(n, .) for each n","lean_route":null,"lean_declarations":["RealRooted.splits_add_C_mul_derivative_all","RealRooted.splits_C_mul_add_derivative","Polynomial.Splits.derivative"],"certificate_hash":"33495241845305f8dabbd6b038c14973d7d69d6d542d6fc405c7a605e1c52be6","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-57b4b14604f4c0d7","role":"sequence","name":"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).","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-358198d44783c5a7","kind":"fingerprint_related","node_a_id":"n-3b95e3dd4c91b92c","node_b_id":"n-3e16b3cbabac7254","fingerprint":"f6-63d66b489de6a076","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-63d66b489de6a076"},"other_id":"n-3b95e3dd4c91b92c","other":{"id":"n-3b95e3dd4c91b92c","name":"basis_map_A007318 of Triangle of Dyck paths counted by number of long interior inclines.","first_index":0,"fingerprint":"f6-63d66b489de6a076","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["2"],["5","2"],["14","12","2"]],"card_rows":[["2"],["5","2"],["14","12","2"],["42","56","21","2"]],"row_sums_preview":["2","7","28","121","550","2591","12536","61921"],"regions":["(-inf, 0]","(-inf, -1]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-c963abfc0266d66c","steps":["x \u21a6 x+1"],"edges":["e-454321f2b34b0823"],"text":"A108838 \u2192 x \u21a6 x+1"},"headline":"A108838 \u2192 x \u21a6 x+1","chain":null}},{"id":"l-aa79718987b6fa05","kind":"fingerprint_related","node_a_id":"n-3e16b3cbabac7254","node_b_id":"n-a9fe45b73042a3d2","fingerprint":"f6-63d66b489de6a076","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-63d66b489de6a076"},"other_id":"n-a9fe45b73042a3d2","other":{"id":"n-a9fe45b73042a3d2","name":"mobius_x_over_x_plus_one of Triangle read by rows: T(n,k) = number of vertices of degree k in an origami flip graph OFG(A2n).","first_index":0,"fingerprint":"f6-63d66b489de6a076","polytool_family":null,"degree_pattern":"affine","palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":0,"preview_rows":[["8"],["12","30"],["16","96","112"]],"card_rows":[["8"],["12","30"],["16","96","112"],["20","210","560","420"]],"row_sums_preview":["8","42","224","1210","6600","36274","200576","1114578"],"regions":["[-1, 0]"],"region_exact":{},"oeis_ids":[],"derivation":{"root":"n-c8c19eba9d68881f","steps":["\u2299 C(n+1,k+1) (shift +2)","x \u21a6 x/(x+1)"],"edges":["e-2d36970d4b706ae4","e-95ef58c5a4cf27ac"],"text":"A007318 \u2192 \u2299 C(n+1,k+1) (shift +2) \u2192 x \u21a6 x/(x+1)"},"headline":"A007318 \u2192 \u2299 C(n+1,k+1) (shift +2) \u2192 x \u21a6 x/(x+1)","chain":null}},{"id":"l-dbfe9e56238fee2c","kind":"oeis_match","node_a_id":"n-3e16b3cbabac7254","node_b_id":null,"fingerprint":null,"oeis_id":"A050152","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A050152","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A050152","relation":"match_row_sums"}],"bfiles":[{"node_id":"n-3e16b3cbabac7254","oeis_id":"A050152","target":"row_sums","oeis_offset":0,"first_row":0,"rows_used":200,"terms_matched":15,"oeis_terms_agreeing":21,"oeis_terms_available":21,"term_count":200,"raw_size":16001}],"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:     0;\n  1:     1;\n  2:     5,      2;\n  3:    21,     18,      3;\n  4:    84,    112,     42,      4;\n  5:   330,    600,    360,     80,      5;\n  6:  1287,   2970,   2475,    900,    135,     6;\n  7:  5005,  14014,  15015,   7700,   1925,   210,    7;\n  8: 19448,  64064,  84084,  56056,  20020,  3696,  308,   8;\n  9: 75582, 286416, 445536, 366912, 171990, 45864, 6552, 432, 9;\n","recurrence_sentence":"The row polynomials satisfy (n^2+n-2)*P(n,x) = (4*n^2+2*n+(3*n^2-n-2)*x)*P(n-1,x) - ((2*n+1)*x+(2*n+1)*x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 1.","mathematica":"P[0, x_] := 0;\nP[1, x_] := 1;\nP[n_, x_] := P[n, x] = Expand[Together[((4*n^2 + 2*n + (3*n^2 - n - 2)*x)*P[n - 1, x] - ((2*n + 1)*x + (2*n + 1)*x^2)*D[P[n - 1, x], x])/(n^2 + n - 2)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = ((4*n^2 + 2*n + (3*n^2 - n - 2)*x)*v[i - 1] - ((2*n + 1)*x + (2*n + 1)*x^2)*deriv(v[i - 1], x))/(n^2 + n - 2)); 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-57b4b14604f4c0d7","steps":["D"],"edges":["e-a4f714b61c97080d"],"text":"A126216 \u2192 D"},"headline":"A126216 \u2192 D","chain":null}