A069466 → γ → basis A013610

Matches ?

No OEIS matches.

Submission text ?

Triangle begins:
  0:         1;
  1:         2;
  2:        18,         36;
  3:       140,        360;
  4:      1330,       5040,       3780;
  5:     12852,      60480,      68040;
  6:    130284,     748440,    1247400,     498960;
  7:   1348776,    9081072,   19459440,   12972960;
  8:  14247090,  110270160,  291891600,  291891600,   72972900;
  9: 152618180, 1333743840, 4190266080, 5513508000, 2481078600;

The row polynomials satisfy n^2*P(n,x) = (48*n^2-96*n+36+(192*n^2-384*n+144)*x)*P(n-2,x) + (8*n^2-8*n+2)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2.

P[0, x_] := 1;
P[1, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[((48*n^2 - 96*n + 36 + (192*n^2 - 384*n + 144)*x)*P[n - 2, x] + (8*n^2 - 8*n + 2)*P[n - 1, x])/(n^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten

P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2; for(n = 2, N, my(i = n + 1); v[i] = ((48*n^2 - 96*n + 36 + (192*n^2 - 384*n + 144)*x)*v[i - 2] + (8*n^2 - 8*n + 2)*v[i - 1])/(n^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)

Properties

• Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
  by Geometric basis map (elementary)
• Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
  derived from Geometric basis map (elementary)
• Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
  derived from Geometric basis map (elementary)
• Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
  by Geometric basis map (elementary)

Proof chains ? JSON

• Geometric basis map (elementary) polytool ? step ›

  • from gamma_polynomial of Triangle T(n, k) of numbers of square lattice walks that start and end at origin after 2*n steps an…?
    • Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›

      • from Triangle T(n, k) of numbers of square lattice walks that start and end at origin after 2*n steps and contain exactly k …?
        • Liu–Wang theorem for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check
        • Three-term recurrence criterion [Sze39, §3.3; Fav35] polytool ? step › direct check
        • Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
        • Affine, reversal and Möbius substitutions (elementary) polytool ? step ›

          • from Triangle T(n, k) of numbers of square lattice walks that start and end at origin after 2*n steps and contain exactly k …?
            • ↑ Liu–Wang theorem for three-term recurrences (above)
            • ↑ Three-term recurrence criterion (above)
            • ↑ Row-hypergeometric rows (multiplier sequences) (above)

Related ?

Same fingerprint ?

• A089627 → basis A013610
• A391403 → basis A013610

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
2. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
3. [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
4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.
5. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023