type_b_eulerian → Pₙ + Pₙ₊₁

nonnegative coefficients

Proved for all n: all roots real what this means

Recurrence
\(P_{n}(x) = \left(1 - 3\,x + 2\,n x\right)\,P_{n-2}(x) + \left(2\,x - 2\,x^{2}\right)\,P_{n-2}'(x) + \left(x + 2\,n x\right)\,P_{n-1}(x) + \left(2\,x - 2\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 2 + x\)
\(P_{1}(x) = 2 + 7\,x + x^{2}\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14x15Pn(1)
0213
127110
222924156
3299253771432
423131912175823814224
52959122252523010780723149920
622901712002832712702666137921801691200
7287313922692745011493473725459453337916553110967040
82262252087952241932607408830871898582220395841762892196741196116480
927871110872481200008876976336576159650576292863125418005724491358145903913901685760
10223617355818568158138162911743746380301151122822949494309611015124002141219686646761465177136185465497600
112708563283934397121119919131322206033055056085842387718765349784878573875221227868609321075561361523740910553142912043740160000
1222125737143561466490653160874141730711464277877710366071756134767865617295079727916743213425239013066322456238018148165611989141221594310152973744947200
1326377263723015388966711679945014638062587756112351549020461359735586315999521359834068252350228277624690106336721882713134220835030075883709324586033365504478295511479340877414400
142191318453631976692848481746779871469263611777821540674506899077679662055255238013902266360068779137406421123165266558743823948151144897584760412013417139447422542670338994183029277868714348892144278202813644800

Computed in your browser ?

Technical details
Node id
n-198be0e7a0f207a6 · revision 1 · JSON
Definition source
derived:obreschkoff_combination
Fingerprint
f6-c7ee4b11b3b80bba

Observed on the stored rows ?

  • Degrees: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 (affine: slope 1, intercept 1)
  • 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 ℚ): no

OEIS matches ?

No OEIS matches.

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: 2,     1;
  1: 2,     7,        1;
  2: 2,    29,       24,         1;
  3: 2,    99,      253,        77,         1;
  4: 2,   313,     1912,      1758,       238,          1;
  5: 2,   959,    12225,     25230,     10780,        723,         1;
  6: 2,  2901,    71200,    283271,    270266,      61379,      2180,         1;
  7: 2,  8731,   392269,   2745011,   4934737,    2545945,    333791,      6553,       1;
  8: 2, 26225,  2087952,  24193260,  74088308,   71898582,  22039584,   1762892,   19674,     1;
  9: 2, 78711, 10872481, 200008876, 976336576, 1596505762, 928631254, 180057244, 9135814, 59039, 1;
%F Formula
The row polynomials satisfy P(n,x) = (1+(2*n-3)*x)*P(n-2,x) + (2*x-2*x^2)*d/dx P(n-2,x) + (2*n+1)*x*P(n-1,x) + (2*x-2*x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 2 + x, P(1,x) = 2 + 7*x + x^2.
%t Mathematica
P[0, x_] := 2 + x;
P[1, x_] := 2 + 7*x + x^2;
P[n_, x_] := P[n, x] = Expand[(1 + (2*n - 3)*x)*P[n - 2, x] + (2*x - 2*x^2)*D[P[n - 2, x], x] + (2*n + 1)*x*P[n - 1, x] + (2*x - 2*x^2)*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 2 + x; v[2] = 2 + 7*x + x^2; for(n = 2, N, my(i = n + 1); v[i] = (1 + (2*n - 3)*x)*v[i - 2] + (2*x - 2*x^2)*deriv(v[i - 2], x) + (2*n + 1)*x*v[i - 1] + (2*x - 2*x^2)*deriv(v[i - 1], x)); 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, +inf)
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-6138e831ad364b95

Proof chains

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

  • obreschkoff_combination e-6138e831ad364b95

    Hermite–Kakeya–Obreschkoff theorem [Obr63; Fis06, Thm 1.43] ?

    • premise (sequence): type_b_eulerian
      uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, +inf)
    • premise (sequence): type_b_eulerian
      uses: Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
      no recorded property covers this requirement

Same fingerprint (1)

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

References

  1. [Fis06] Steve Fisk. Polynomials, roots, and interlacing. arXiv:math/0612833. arXiv
  2. [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003
  3. [Obr63] Nikola Obreschkoff. Verteilung und berechnung der nullstellen reeller polynome. Hochschulbücher für mathematik, VEB Deutscher Verlag der Wissenschaften, 1963.