{"id":"n-4ca7e225b5e9bcc6","revision":1,"first_index":0,"fingerprint":"f6-17560ac5ecfb8518","name":"Triangle read by rows: T(n, k) = T(n-1, k-1) - T(n-2, k), with T(n, n) = 1, T(n, n-1) = -2.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":0,"rr_by_factors":false,"rows":[["1"],["-2","1"],["-1","-2","1"],["2","-2","-2","1"],["1","4","-3","-2","1"],["-2","3","6","-4","-2","1"],["-1","-6","6","8","-5","-2","1"],["2","-4","-12","10","10","-6","-2","1"],["1","8","-10","-20","15","12","-7","-2","1"],["-2","5","20","-20","-30","21","14","-8","-2","1"],["-1","-10","15","40","-35","-42","28","16","-9","-2","1"],["2","-6","-30","35","70","-56","-56","36","18","-10","-2","1"],["1","12","-21","-70","70","112","-84","-72","45","20","-11","-2","1"],["-2","7","42","-56","-140","126","168","-120","-90","55","22","-12","-2","1"],["-1","-14","28","112","-126","-252","210","240","-165","-110","66","24","-13","-2","1"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["1","-1","-2","-1","1","2","1","-1","-2","-1","1","2","1","-1","-2"],"nonn":false,"definitions":[{"position":0,"source":"oeis_catalog:A124038","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["-2","1"]],"recurrence":{"terms":[{"coeff":{"coeffs":[["0","1"]]},"deriv_order":0,"offset":1,"sign":"none"},{"coeff":{"coeffs":[["-1"]]},"deriv_order":0,"offset":2,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":159173,"position":0,"claim":"real_rooted","from_index":0,"region_key":"(-inf, +inf)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)","region_exact":null,"edges":["e-66ab36c44d35dd53"]},{"id":159174,"position":1,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"strict","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (strict, previous interlaces next) for every m >= 1","region_exact":null,"edges":["e-66ab36c44d35dd53","e-cf11db18e382a69a"]},{"id":159175,"position":2,"claim":"real_rooted","from_index":0,"region_key":"(-2, 3)","provenance":"edges","claim_data":{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-2"},"upper":{"closed":false,"value":"3"}}},"label":"Real-rooted","description":"Every row P_n, n >= 0, is zero or real-rooted with all roots in (-2, 3)","region_exact":null,"edges":["e-cf11db18e382a69a"]},{"id":159176,"position":3,"claim":"basis_map_preserver","from_index":null,"region_key":null,"provenance":"edges","claim_data":{"claim":"basis_map_preserver","input_interval":"[-1, 1]","output_interval":"(-inf, +inf)","statement":"every real polynomial with all roots in E = [-1, 1] has a real-rooted image"},"label":"Basis map preserves real-rootedness","description":"Basis map u^k -> P_k sends roots in [-1, 1] to roots in (-inf, +inf): every real polynomial with all roots in E = [-1, 1] has a real-rooted image","region_exact":null,"edges":["e-c628eede86362da4"]}],"region_exact":{},"incoming_edges":[{"id":"e-c628eede86362da4","operation":{"operation":"basis_map_theorem"},"operation_detail":null,"conclusion_id":"n-4ca7e225b5e9bcc6","premise_count":0,"theorem":"affine current multiplier with an affine initial row (module documentation, \"The affine-current theorem\"): with beta = b/d, K = beta^2 + a beta - c > 0 and eta = m/d >= 0, every real polynomial with all roots in E = [-beta - sqrt(K), -beta + sqrt(K)] has a real-rooted image, and no interval of positive length outside E works (Theorem 1); for eta > 0 the images lie in I = [(-a - 2 beta - 2 sqrt(K))/d, (-a - 2 beta + 2 sqrt(K))/d] if and only if eta >= 1/2 and (s - (2 eta - 1) beta)^2 <= (2 eta - 1)^2 K, s = l - eta a (Theorem 2); with a >= 0, K >= beta^2, a + 2 beta >= 0, a^2 + 4c >= 0, l >= 0 and the scalar criterion, PF inputs with roots in [-R, 0], R = beta + sqrt(K), have PF images, sharply (the common-interlacer proof; the Chebyshev case is Iserles and Saff, Math. Proc. Cambridge Philos. Soc. 105 (1989), Theorem 1; the scalar criterion is RealRooted orderTwoConstants_nonneg_iff)","lean_route":null,"lean_declarations":[],"certificate_hash":"6ca2387dc1877086fd210c2f2736e0c35397c9036f75a7aa35254cf773155148","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"basis_map_preserver","input_interval":"[-1, 1]","output_interval":"(-inf, +inf)","statement":"every real polynomial with all roots in E = [-1, 1] has a real-rooted image"}],"premises":[]},{"id":"e-66ab36c44d35dd53","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-4ca7e225b5e9bcc6","premise_count":0,"theorem":"three-term recurrence Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2) with a_n != 0 and beta_n = c_n / (a_n a_(n-1)) > 0: simple real roots and strict interlacing of consecutive rows (zero separation for orthogonal polynomials: G. Szeg\u0151, Orthogonal Polynomials, \u00a73.3; Favard, C. R. Acad. Sci. Paris 200 (1935)); root regions by a positive-ratio (chain-sequence) induction","lean_route":null,"lean_declarations":[],"certificate_hash":"725dbf991220eec45879bf4678a53d9c627237bcb9b8b733c558275647a2c960","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{}},{"claim":"interlacing","from_index":1,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]},{"id":"e-cf11db18e382a69a","operation":{"operation":"theorem_check","theorem":"three_term_recurrence"},"operation_detail":"three_term_recurrence","conclusion_id":"n-4ca7e225b5e9bcc6","premise_count":0,"theorem":"three-term recurrence Q_n = (a_n y + b_n) Q_(n-1) - c_n Q_(n-2) with a_n != 0 and beta_n = c_n / (a_n a_(n-1)) > 0: simple real roots and strict interlacing of consecutive rows (zero separation for orthogonal polynomials: G. Szeg\u0151, Orthogonal Polynomials, \u00a73.3; Favard, C. R. Acad. Sci. Paris 200 (1935)); root regions by a positive-ratio (chain-sequence) induction","lean_route":null,"lean_declarations":[],"certificate_hash":"664a1fcb65bbc1337a99969bfd36b0c2600972c432e7e7f46427c7955ac2b5dd","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"lower":{"closed":false,"value":"-2"},"upper":{"closed":false,"value":"3"}}},{"claim":"interlacing","from_index":1,"kind":"strict","orientation":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-480f02718c8257df","operation":"preserver_image","operation_detail":"affine, shift 0","conclusion_id":"n-366c29e67ccc8d94","conclusion_name":"shift_x_plus_one of Triangle read by rows: T(n, k) = T(n-1, k-1) - T(n-2, k), with T(n, n) = 1, T(n, n-1) = -2."},{"id":"e-66ea761efe9838f4","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-5515c868dfdae3d4","conclusion_name":"derivative of Triangle read by rows: T(n, k) = T(n-1, k-1) - T(n-2, k), with T(n, n) = 1, T(n, n-1) = -2."},{"id":"e-fa558ee223516e16","operation":"preserver_image","operation_detail":"derivative_polynomial, shift 0","conclusion_id":"n-3b88797d535e9a6e","conclusion_name":"one_plus_derivative of Triangle read by rows: T(n, k) = T(n-1, k-1) - T(n-2, k), with T(n, n) = 1, T(n, n-1) = -2."}],"used_by_total":3,"links":[{"id":"l-26b32b36da638883","kind":"oeis_match","node_a_id":"n-4ca7e225b5e9bcc6","node_b_id":null,"fingerprint":null,"oeis_id":"A122876","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":0,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":3,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A122876","oeis_nonn":false},"other_id":null,"other":null},{"id":"l-288e4afdd6e9bafe","kind":"oeis_match","node_a_id":"n-4ca7e225b5e9bcc6","node_b_id":null,"fingerprint":null,"oeis_id":"A100051","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":0,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A100051","oeis_nonn":false},"other_id":null,"other":null},{"id":"l-4b16d24d6dbe0e74","kind":"oeis_match","node_a_id":"n-4ca7e225b5e9bcc6","node_b_id":null,"fingerprint":null,"oeis_id":"A087204","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":0,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":1,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A087204","oeis_nonn":false},"other_id":null,"other":null},{"id":"l-ef6b216313e5a90d","kind":"oeis_match","node_a_id":"n-4ca7e225b5e9bcc6","node_b_id":null,"fingerprint":null,"oeis_id":"A124038","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":11,"oeis_nonn":0,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":11,"target":"triangle","terms_compared":66},"in_catalog":true,"oeis_id":"A124038","oeis_nonn":false},"other_id":null,"other":null},{"id":"l-f7e1b8246a978a68","kind":"oeis_match","node_a_id":"n-4ca7e225b5e9bcc6","node_b_id":null,"fingerprint":null,"oeis_id":"A057079","in_catalog":0,"target":"row_sums","row_alignment":null,"rows_matched":null,"oeis_nonn":0,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":2,"target":"row_sums","terms_compared":15},"in_catalog":false,"oeis_id":"A057079","oeis_nonn":false},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A124038","relation":"identification"},{"oeis_id":"A057079","relation":"match_row_sums"},{"oeis_id":"A087204","relation":"match_row_sums"},{"oeis_id":"A100051","relation":"match_row_sums"},{"oeis_id":"A122876","relation":"match_row_sums"},{"oeis_id":"A124038","relation":"match_triangle"}],"bfiles":[{"node_id":"n-4ca7e225b5e9bcc6","oeis_id":"A124038","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":66,"oeis_terms_agreeing":66,"oeis_terms_available":66,"term_count":990,"raw_size":9427}],"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:  1;\n  1: -2,  1;\n  2: -1, -2,   1;\n  3:  2, -2,  -2,   1;\n  4:  1,  4,  -3,  -2,   1;\n  5: -2,  3,   6,  -4,  -2,  1;\n  6: -1, -6,   6,   8,  -5, -2,  1;\n  7:  2, -4, -12,  10,  10, -6, -2,  1;\n  8:  1,  8, -10, -20,  15, 12, -7, -2,  1;\n  9: -2,  5,  20, -20, -30, 21, 14, -8, -2, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = x*P(n-1,x) - P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = -2 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := -2 + x;\nP[n_, x_] := P[n, x] = Expand[x*P[n - 1, x] - P[n - 2, x]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = -2 + x; for(n = 2, N, my(i = n + 1); v[i] = x*v[i - 1] - v[i - 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}},{"oeis_id":"A124038","target":"triangle","first_row":0,"oeis_offset":0,"reversed":false,"trim_zeros":"none","regular_triangle":true,"rows_shown":10,"polytool_commit":"c48629374597092cc41ef4d6273f37991516f984","triangle_example":"Triangle begins:\n  0:  1;\n  1: -2,  1;\n  2: -1, -2,   1;\n  3:  2, -2,  -2,   1;\n  4:  1,  4,  -3,  -2,   1;\n  5: -2,  3,   6,  -4,  -2,  1;\n  6: -1, -6,   6,   8,  -5, -2,  1;\n  7:  2, -4, -12,  10,  10, -6, -2,  1;\n  8:  1,  8, -10, -20,  15, 12, -7, -2,  1;\n  9: -2,  5,  20, -20, -30, 21, 14, -8, -2, 1;\n","recurrence_sentence":"The row polynomials satisfy P(n,x) = x*P(n-1,x) - P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = -2 + x.","mathematica":"P[0, x_] := 1;\nP[1, x_] := -2 + x;\nP[n_, x_] := P[n, x] = Expand[x*P[n - 1, x] - P[n - 2, x]];\nTable[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = -2 + x; for(n = 2, N, my(i = n + 1); v[i] = x*v[i - 1] - v[i - 2]); v};\nrow(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); 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":true}}],"derivation":{"root":"n-4ca7e225b5e9bcc6","steps":[],"edges":[],"text":"A124038"},"headline":"A124038: Triangle read by rows: T(n, k) = T(n-1, k-1) - T(n-2, k), with T(n, n) = 1, T(n, n-1) = -2.","chain":null}