{"id":"n-e1c721301bf80375","revision":1,"first_index":0,"fingerprint":"f6-abab48ed12ce8f73","name":"Triangle read by rows giving successive states of cellular automaton generated by \"Rule 84\" initiated with a single ON (black) cell.","polytool_family":null,"interpretation":null,"rows_observed":15,"degree_pattern":"affine","degree_slope":2,"degree_intercept":0,"palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":true,"rows":[["1"],["0","1","1"],["0","0","0","1","1"],["0","0","0","0","0","1","1"],["0","0","0","0","0","0","0","1","1"],["0","0","0","0","0","0","0","0","0","1","1"],["0","0","0","0","0","0","0","0","0","0","0","1","1"],["0","0","0","0","0","0","0","0","0","0","0","0","0","1","1"],["0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","1","1"],["0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","1","1"],["0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","1","1"],["0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","1","1"],["0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","1","1"],["0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","1","1"],["0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","0","1","1"]],"degrees":[0,2,4,6,8,10,12,14,16,18,20,22,24,26,28],"row_sums":["1","2","2","2","2","2","2","2","2","2","2","2","2","2","2"],"nonn":true,"definitions":[{"position":0,"source":"oeis_catalog:A267006","source_kind":"oeis_catalog","equality_edge_id":null,"recurrence":{"first_index":0,"initial_polynomials":[["1"],["0","1","1"]],"recurrence":{"denominator":{"coeffs":[["-1"],["1"]]},"terms":[{"coeff":{"coeffs":[["0","0","-1"],["0","0","1"]]},"deriv_order":0,"offset":1,"sign":"none"}]},"schema":"polytool.recurrence.v1"}}],"properties":[{"id":169771,"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-261f233fb25c148f","e-5ae79da95504cf7f"]},{"id":169772,"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-261f233fb25c148f","e-5ae79da95504cf7f"]},{"id":169773,"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-261f233fb25c148f","e-5ae79da95504cf7f"]}],"region_exact":{},"incoming_edges":[{"id":"e-261f233fb25c148f","operation":{"operation":"theorem_check","theorem":"hypergeometric_row"},"operation_detail":"hypergeometric_row","conclusion_id":"n-e1c721301bf80375","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":"45f43b8737fd5dbd97daaa35e850d8a8ba53f904ec15708cb0685510375569c5","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[]},{"id":"e-5ae79da95504cf7f","operation":{"operation":"theorem_check","theorem":"iterated_preserver"},"operation_detail":"iterated_preserver","conclusion_id":"n-e1c721301bf80375","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":"a11ab028f935a50f289ac015c3319ab1eb82f3fe36812a7671e4ab6293b18150","verification_polytool":"replayed","verification_lean":"not_attempted","claims":[{"claim":"real_rooted","from_index":0,"region":{"upper":{"closed":true,"value":"0"}}}],"premises":[]}],"used_by":[],"used_by_total":0,"links":[{"id":"l-538b37470f18b182","kind":"fingerprint_related","node_a_id":"n-38c9f89c1db150a9","node_b_id":"n-e1c721301bf80375","fingerprint":"f6-abab48ed12ce8f73","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-abab48ed12ce8f73"},"other_id":"n-38c9f89c1db150a9","other":{"id":"n-38c9f89c1db150a9","name":"Riordan array (1+x, 1) read by rows.","first_index":0,"fingerprint":"f6-abab48ed12ce8f73","polytool_family":null,"degree_pattern":"affine","palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["1","1"],["0","1","1"]],"card_rows":[["1"],["1","1"],["0","1","1"],["0","0","1","1"]],"row_sums_preview":["1","2","2","2","2","2","2","2"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A097806"],"derivation":{"root":"n-38c9f89c1db150a9","steps":[],"edges":[],"text":"A097806"},"headline":"A097806: Riordan array (1+x, 1) read by rows.","chain":null}},{"id":"l-6319900033a42468","kind":"fingerprint_related","node_a_id":"n-e1c721301bf80375","node_b_id":"n-a009f9b98df3ca1d","fingerprint":"f6-abab48ed12ce8f73","oeis_id":null,"in_catalog":null,"target":null,"row_alignment":null,"rows_matched":null,"oeis_nonn":null,"details":{"fingerprint":"f6-abab48ed12ce8f73"},"other_id":"n-a009f9b98df3ca1d","other":{"id":"n-a009f9b98df3ca1d","name":"Triangle A127647 * A097806, read by rows.","first_index":0,"fingerprint":"f6-abab48ed12ce8f73","polytool_family":null,"degree_pattern":"affine","palindromic":1,"gamma_positive":1,"nonnegative":1,"rr_by_factors":1,"preview_rows":[["1"],["1","1"],["0","2","2"]],"card_rows":[["1"],["1","1"],["0","2","2"],["0","0","3","3"]],"row_sums_preview":["1","2","4","6","10","16","26","42"],"regions":["(-inf, 0]"],"region_exact":{},"oeis_ids":["A128540"],"derivation":{"root":"n-a009f9b98df3ca1d","steps":[],"edges":[],"text":"A128540"},"headline":"A128540: Triangle A127647 * A097806, read by rows.","chain":null}}],"oeis":[{"oeis_id":"A267006","relation":"identification"}],"bfiles":[],"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: 0, 1, 1;\n  2: 0, 0, 0, 1, 1;\n  3: 0, 0, 0, 0, 0, 1, 1;\n  4: 0, 0, 0, 0, 0, 0, 0, 1, 1;\n  5: 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1;\n  6: 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1;\n  7: 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1;\n  8: 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1;\n  9: 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1;\n","recurrence_sentence":"The row polynomials satisfy (n-1)*P(n,x) = (n-1)*x^2*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = x + x^2.","mathematica":"P[0, x_] := 1;\nP[1, x_] := x + x^2;\nP[n_, x_] := P[n, x] = Expand[Together[((n - 1)*x^2*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] = 1; v[2] = x + x^2; for(n = 2, N, my(i = n + 1); v[i] = ((n - 1)*x^2*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}}],"derivation":{"root":"n-e1c721301bf80375","steps":[],"edges":[],"text":"A267006"},"headline":"A267006: Triangle read by rows giving successive states of cellular automaton generated by \"Rule 84\" initiated with a single ON (black) cell.","chain":null}