{"id":"n-863aa63e001c0689","revision":1,"first_index":0,"fingerprint":"f6-eed325b4fc5966f1","name":"Triangle by columns, (3, 1, 0, 0, 0, ...) in every column.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":1,"degree_intercept":0,"palindromic":0,"gamma_positive":0,"nonnegative":1,"rr_by_factors":true,"rows":[["3"],["1","3"],["0","1","3"],["0","0","1","3"],["0","0","0","1","3"],["0","0","0","0","1","3"],["0","0","0","0","0","1","3"],["0","0","0","0","0","0","1","3"],["0","0","0","0","0","0","0","1","3"],["0","0","0","0","0","0","0","0","1","3"],["0","0","0","0","0","0","0","0","0","1","3"],["0","0","0","0","0","0","0","0","0","0","1","3"],["0","0","0","0","0","0","0","0","0","0","0","1","3"],["0","0","0","0","0","0","0","0","0","0","0","0","1","3"],["0","0","0","0","0","0","0","0","0","0","0","0","0","1","3"]],"degrees":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"row_sums":["3","4","4","4","4","4","4","4","4","4","4","4","4","4","4"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A136157","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["3"],["1","3"]],"recurrence":{"denominator":{"coeffs":[["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","-1"],["0","1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":169450,"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-5c1a6e6fb3e34e2a","e-9f1ca14024d65643"]},{"id":169451,"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-5c1a6e6fb3e34e2a","e-9f1ca14024d65643"]},{"id":169452,"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-5c1a6e6fb3e34e2a","e-9f1ca14024d65643"]},{"id":169453,"position":3,"claim":"interlacing","from_index":1,"region_key":null,"provenance":"edges","claim_data":{"claim":"interlacing","from_index":1,"kind":"weak","orientation":"previous_interlaces_next"},"label":"Interlacing of consecutive rows","description":"Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 1","region_exact":null,"edges":["e-9f1ca14024d65643"]}],"region_exact":{},"incoming_edges":[{"id":"e-5c1a6e6fb3e34e2a","operation":{"operation":"theorem_check","theorem":"hypergeometric_row"},"operation_detail":"hypergeometric_row","conclusion_id":"n-863aa63e001c0689","premise_count":0,"theorem":"Row-hypergeometric rows: an exact row relation p(n, k) [x^k] P_n + q(n, k) [x^(k-1)] P_n = 0, proved for every n by an invariant row-annihilator system of the rule, writes every row as U_0(n) x^v (or its reversal) times the image of (1 + x)^M(n) under a product of nonnegative multiplier sequences: C^k (C > 0); k -> M'!/(M' - k)!, whose exponential generating function is (1 + x)^M' (Polya--Schur, Theorem 7.1 (3) => (1) of P. Branden, Unimodality, log-concavity, real-rootedness and beyond, arXiv:1410.6601: a sequence is a multiplier sequence when G(x) = sum_k lambda_k x^k / k! or G(-x) can be written C x^m e^(a x) prod_k (1 + alpha_k x) with a >= 0, alpha_k >= 0); k -> phi(k) for a polynomial phi with only real roots, all <= 0 (Laguerre's theorem, RealRooted isPFMultiplierSequence_eval_of_roots_nonpos); k -> 1/(alpha)_k for alpha > 0 (RealRooted isPFMultiplierSequence_inv_ascPochhammer, via the generalized Laguerre polynomials); products of PF multiplier sequences are PF multiplier sequences (RealRooted IsPFMultiplierSequence.mul) and map real-rooted polynomials with nonnegative coefficients to such polynomials (IsPFMultiplierSequence.diagonalOperator_isPF)","lean_route":null,"lean_declarations":["RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos","RealRooted.isPFMultiplierSequence_inv_ascPochhammer","RealRooted.IsPFMultiplierSequence.mul","RealRooted.IsPFMultiplierSequence.diagonalOperator_isPF"],"certificate_hash":"5bce0bfb142e58164b4abc788db834d7a73dd5b0ae8e504ff45e32b2c7c43248","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[]},{"id":"e-9f1ca14024d65643","operation":{"operation":"theorem_check","theorem":"iterated_preserver"},"operation_detail":"iterated_preserver","conclusion_id":"n-863aa63e001c0689","premise_count":0,"theorem":"Iterated real-rootedness preservers (induction on n): if P_m is nonzero and real-rooted with every root in a closed region R and, for every n > m, P_n = a_n(x) S_n(P_(n-1)) where S_n maps every polynomial that is zero or real-rooted with every root in R to zero or a real-rooted polynomial with every root in R and a_n is real-rooted with every root in R, then every P_n is real-rooted with every root in R (the roots of a product are the roots of its factors); an exact degree step keeps every row nonzero; here S_n is the identity","lean_route":null,"lean_declarations":[],"certificate_hash":"988660e6babe300af75e903cced1988b179f094f0492da2c049d229171d31d83","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":"previous_interlaces_next"}],"premises":[]}],"used_by":[{"id":"e-0e6665ab2554038a","operation":"basis_map","operation_detail":"A007318","conclusion_id":"n-14b6be09569eb319","conclusion_name":"basis_map_A007318 of Triangle by columns, (3, 1, 0, 0, 0, ...) in every column."},{"id":"e-6954ef9fb5a67819","operation":"basis_map","operation_detail":"A008277","conclusion_id":"n-d509f6c2cb1c9d12","conclusion_name":"basis_map_A008277 of Triangle by columns, (3, 1, 0, 0, 0, ...) in every column."},{"id":"e-c38f1fdbefd2282d","operation":"basis_map","operation_detail":"A013611","conclusion_id":"n-e3e112b1337439e7","conclusion_name":"basis_map_A013611 of Triangle by columns, (3, 1, 0, 0, 0, ...) in every column."},{"id":"e-dd73a88d9dc9f038","operation":"basis_map","operation_detail":"A013610","conclusion_id":"n-33acd11b57e0c597","conclusion_name":"basis_map_A013610 of Triangle by columns, (3, 1, 0, 0, 0, ...) in every column."},{"id":"e-ef8a3dba9c03efe1","operation":"basis_map","operation_detail":"A013609","conclusion_id":"n-29d29565124ec96c","conclusion_name":"basis_map_A013609 of Triangle by columns, (3, 1, 0, 0, 0, ...) in every column."},{"id":"e-846d40dd373cc04f","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-2f940f070dae5df4","conclusion_name":"theta_plus_one_squared of Triangle by columns, (3, 1, 0, 0, 0, ...) in every column."},{"id":"e-a8c3ad85585f2873","operation":"preserver_image","operation_detail":"euler_polynomial, shift 0","conclusion_id":"n-9ad588b45a4b92c0","conclusion_name":"theta_plus_one of Triangle by columns, (3, 1, 0, 0, 0, ...) in every column."}],"used_by_total":7,"links":[{"id":"l-886a6b48935e4d7f","kind":"oeis_match","node_a_id":"n-863aa63e001c0689","node_b_id":null,"fingerprint":null,"oeis_id":"A136157","in_catalog":1,"target":"triangle","row_alignment":"tabl","rows_matched":12,"oeis_nonn":1,"details":{"alignment":{"first_row":0,"low_zeros_dropped":false,"oeis_offset":0,"oeis_term_position":0,"row_alignment":"tabl","rows_matched":12,"target":"triangle","terms_compared":78},"in_catalog":true,"oeis_id":"A136157","oeis_nonn":true},"other_id":null,"other":null}],"oeis":[{"oeis_id":"A136157","relation":"identification"},{"oeis_id":"A136157","relation":"match_triangle"}],"bfiles":[{"node_id":"n-863aa63e001c0689","oeis_id":"A136157","target":"triangle","oeis_offset":0,"first_row":0,"rows_used":44,"terms_matched":78,"oeis_terms_agreeing":78,"oeis_terms_available":78,"term_count":990,"raw_size":5830}],"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: 3;\n  1: 1, 3;\n  2: 0, 1, 3;\n  3: 0, 0, 1, 3;\n  4: 0, 0, 0, 1, 3;\n  5: 0, 0, 0, 0, 1, 3;\n  6: 0, 0, 0, 0, 0, 1, 3;\n  7: 0, 0, 0, 0, 0, 0, 1, 3;\n  8: 0, 0, 0, 0, 0, 0, 0, 1, 3;\n  9: 0, 0, 0, 0, 0, 0, 0, 0, 1, 3;\n","recurrence_sentence":"The row polynomials satisfy (n-1)*P(n,x) = (n-1)*x*P(n-1,x) for n >= 2, with P(0,x) = 3, P(1,x) = 1 + 3*x.","mathematica":"P[0, x_] := 3;\nP[1, x_] := 1 + 3*x;\nP[n_, x_] := P[n, x] = Expand[Together[((n - 1)*x*P[n - 1, x])/(n - 1)]];\nTable[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 3; v[2] = 1 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = ((n - 1)*x*v[i - 1])/(n - 1)); 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":"A136157","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: 3;\n  1: 1, 3;\n  2: 0, 1, 3;\n  3: 0, 0, 1, 3;\n  4: 0, 0, 0, 1, 3;\n  5: 0, 0, 0, 0, 1, 3;\n  6: 0, 0, 0, 0, 0, 1, 3;\n  7: 0, 0, 0, 0, 0, 0, 1, 3;\n  8: 0, 0, 0, 0, 0, 0, 0, 1, 3;\n  9: 0, 0, 0, 0, 0, 0, 0, 0, 1, 3;\n","recurrence_sentence":"The row polynomials satisfy (n-1)*P(n,x) = (n-1)*x*P(n-1,x) for n >= 2, with P(0,x) = 3, P(1,x) = 1 + 3*x.","mathematica":"P[0, x_] := 3;\nP[1, x_] := 1 + 3*x;\nP[n_, x_] := P[n, x] = Expand[Together[((n - 1)*x*P[n - 1, x])/(n - 1)]];\nTable[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten","pari":"P(N) = {my(v = vector(N + 1)); v[1] = 3; v[2] = 1 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = ((n - 1)*x*v[i - 1])/(n - 1)); 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-863aa63e001c0689","steps":[],"edges":[],"text":"A136157"},"headline":"A136157: Triangle by columns, (3, 1, 0, 0, 0, ...) in every column.","chain":null}