Real-rooted atlas

A274498: Triangle read by rows: T(n,k) is the number of ternary words of length n having degree of asymmetry equal to k (n>=0; 0<=k<=n/2).

A274498 nonnegative coefficients only rational roots

Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · Hadamard kernel basis map preserves real roots what this means

Recurrence from OEIS A274498
\(P_{n}(x) = \left(3 + 6\,x\right)\,P_{n-2}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 3\)

Rows ?

nx0x1x2x3Pn(1)
011
133
2369
391827
49363681
527108108243
627162324216729
7814869726482187

Show all 15 stored rows

Generated b-files: A000244 (row sums), A274498 ?

Computed in your browser ?

Technical details
Node id
n-7c641d81e21514ce · revision 1 · JSON
Definition source
oeis_catalog:A274498
Fingerprint
f6-98cc1557e904900a

Observed on the stored rows ?

  • Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half affine: slope 1, intercept 0)
  • Palindromic rows: no
  • γ-positive (gamma_positive): no
  • Nonnegative coefficients (nonn): yes
  • Only rational roots (rr_by_factors: every nonzero row is a product of linear factors over ℚ): yes

OEIS matches ?

A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.

OEIS submission text ?

Fields to paste into an OEIS submission: the example %e, the formula %F and programs %t (Mathematica) and %o (PARI/GP) that list the same rows. For an OEIS link the row numbers, the offset and the orientation are those of the entry, as matched; the matched terms were compared with the published ones, which identifies the node with the entry on a finite prefix, not for every n. The PARI/GP program is not machine-checked here.

The atlas's own rows: n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:   1;
  1:   3;
  2:   3,    6;
  3:   9,   18;
  4:   9,   36,   36;
  5:  27,  108,  108;
  6:  27,  162,  324,  216;
  7:  81,  486,  972,  648;
  8:  81,  648, 1944, 2592, 1296;
  9: 243, 1944, 5832, 7776, 3888;
%F Formula
The row polynomials satisfy P(n,x) = (3+6*x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3;
P[n_, x_] := P[n, x] = Expand[(3 + 6*x)*P[n - 2, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 3; for(n = 2, N, my(i = n + 1); v[i] = (3 + 6*x)*v[i - 2]); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)

Generated with polytool c48629374597.

A274498: triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0:   1;
  1:   3;
  2:   3,    6;
  3:   9,   18;
  4:   9,   36,   36;
  5:  27,  108,  108;
  6:  27,  162,  324,  216;
  7:  81,  486,  972,  648;
  8:  81,  648, 1944, 2592, 1296;
  9: 243, 1944, 5832, 7776, 3888;
%F Formula
The row polynomials satisfy P(n,x) = (3+6*x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3;
P[n_, x_] := P[n, x] = Expand[(3 + 6*x)*P[n - 2, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 3; for(n = 2, N, my(i = n + 1); v[i] = (3 + 6*x)*v[i - 2]); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)

Generated with polytool c48629374597.

Proved properties

  • Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-363ec3019ccc29a9
  • Coefficients of one sign. Every nonzero row, n >= 0: the coefficients of P_n have one sign
    All coefficients of each polynomial have the same sign (after x -> -x when alternating).
    derived from the cited steps by a stated theorem: e-363ec3019ccc29a9
  • Hadamard kernel (Malo). Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)
    Multiplying the coefficients of any real-rooted polynomial termwise by those of a row (Hadamard product) gives a real-rooted polynomial again.
    derived from the cited steps by a stated theorem: e-363ec3019ccc29a9
  • Basis map preserves real-rootedness. Basis map u^k -> P_k sends roots in (-inf, 0] to roots in (-inf, -1/2]: every PF input has a real-rooted image with every root <= -c/b = -1/2
    The linear map sending x^k to the k-th polynomial of the sequence turns polynomials with roots in one interval into real-rooted ones.
    by the cited steps: e-3bcf5053bbc59f78
  • Basis map preserves real-rootedness. Basis map u^k -> P_k sends roots in (-inf, 0] to roots in (-inf, -1/2]: every PF input has a PF image (zero allowed)
    The linear map sending x^k to the k-th polynomial of the sequence turns polynomials with roots in one interval into real-rooted ones.
    by the cited steps: e-3bcf5053bbc59f78

Proof chains

2 incoming proof steps. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON

Used in 12 proof steps

Same fingerprint (10)

Equal up to content, sign, reversal and a small index shift.

References

  1. [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10