

A036039


Triangle of multinomial coefficients of integer partitions read by rows (in Abramowitz and Stegun ordering).


67



1, 1, 1, 2, 3, 1, 6, 8, 3, 6, 1, 24, 30, 20, 20, 15, 10, 1, 120, 144, 90, 40, 90, 120, 15, 40, 45, 15, 1, 720, 840, 504, 420, 504, 630, 280, 210, 210, 420, 105, 70, 105, 21, 1, 5040, 5760, 3360, 2688, 1260, 3360, 4032, 3360, 1260, 1120, 1344, 2520, 1120, 1680, 105, 420, 1120, 420, 112, 210, 28, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,4


COMMENTS

The sequence of row lengths is A000041(n), n>=1 (partition numbers).
Number of permutations whose cycle structure is the given partition. Row sums are factorials (A000142).  Franklin T. AdamsWatters, Jan 12 2006
A relation between partition polynomials formed from these "refined" Stirling numbers of the first kind and umbral operator trees and Lagrange inversion is presented in the link "Lagrange a la Lah".
These cycle index polynomials for the symmetric group S_n are also related to a raising operator / infinitesimal generator for fractional integroderivatives, involving the digamma function and the Riemann zeta function values at positive integers, and to the characteristic polynomial for the adjacency matrix of complete ngraphs A055137 (cf. MathOverflow link).  Tom Copeland, Nov 03 2012
In the Lang link, replace all x(n) by t to obtain A132393. Furthermore replace x(1) by t and all other x(n) by 1 to obtain A008290. See A274760.  Tom Copeland, Nov 06 2012, Oct 29 2015  corrected by Johannes W. Meijer, Jul 28 2016
The umbral compositional inverses of these polynomials are formed by negating the indeterminates x(n) for n>1, i.e., P(n,P(.,x(1),x(2),x(3),...),x(2),x(3),...) = x(1)^n (cf. A130561 for an example of umbral compositional inversion). The polynomials are an Appell sequence in x(1), i.e., dP(n,x(1))/dx(1) = n P(n1, x(1)) and (P(.,x)+y)^n=P(n,x+y) umbrally, with P(0,x(1))=1.  Tom Copeland, Nov 14 2014
Regarded as the coefficients of the partition polynomials listed by Lang, a signed version of these polynomials IF(n,b1,b2,...,bn) (n! times polynomial on page 184 of Airault and Bouali) provides an inversion of the Faber polynomials F(n,b1,b2,...,bn) (page 52 of Bouali, A263916, and A115131). For example, F(3, IF(1,b1), IF(2,b1,b2)/2!, IF(3,b1,b2,b3)/3!) = b3 and IF(3, F(1,b1), F(2,b1,b2), F(3,b1,b2,b3))/3! = b3 with F(1,b1) = b1. (Compare with A263634.)  Tom Copeland, Oct 28 2015; Sep 09 2016)
The e.g.f. for the row partition polynomials is Sum_{n>=0} P_n(b_1,...,b_n) x^n/n! = exp[Sum_{n>=1} b_n x^n/n], or, exp[P.(b_1,...,b_n)x] = exp[<log(1b.x)>], expressed umbrally with <"power series"> denoting umbral evaluation (b.)^n = b_n within the power series. This e.g.f. is central to the paper by Maxim and Schuermannn on characteristic classes (cf. Friedrich and McKay also).  Tom Copeland, Nov 11 2015
The elementary Schur polynomials are given by S(n,x(1),x(2),...,x(n)) = P(n,x(1), 2*x(2),...,n*x(n)) / n!. See p. 12 of Carrell.  Tom Copeland, Feb 06 2016
These partition polynomials are also related to the Casimir invariants associated to quantum density states on p. 3 of Boya and Dixit and pp. 5 and 6 of Byrd and Khaneja.  Tom Copeland, Jul 24 2017
With the indeterminates (x_1,x_2,x_3,...) = (t,c_2*t,c_3*t,...) with c_n >0, umbrally P(n,a.) = P(n,t)_{t^n = a_n} = 0 and P(j,a.)P(k,a.) = P(j,t)P(k,t)_{t^n =a_n} = d_{j,k} >= 0 is the coefficient of x^j/j!*y^k/k! in the Taylor series expansion of the formal group law FGL(x,y) = f[f^{1}(x)+f^{1}(y)], where a_n are the inversion partition polynomials for calculating f(x) from the coefficients of the series expansion of f^{1}(x) given in A133932.  Tom Copeland, Feb 09 2018
For relation to the Witt symmetric functions, as well as the basic power, elementary, and complete symmetric functions, see the Borger link p. 295. For relations to diverse zeta functions, determinants, and paths on graphs, see the MathOverflow question Cycling Through the Zeta Garden.  Tom Copeland, Mar 25 2018
Chmutov et al. identify the partition polynomials of this entry with the onepart Schur polynomials and assert that any linear combination with constant coefficients of these polynomials is a tau function for the KP hierarchy.  Tom Copeland, Apr 05 2018
With the indeterminates in the partition polynomials assigned as generalized harmonic numbers, i.e., as partial sums of the Dirichlet series for the Riemann zeta function, zeta(n), for integer n > 1, sums of simple normalizations of these polynomials give either unity or simple sums of consecutive zeta(n) (cf. Hoffman). Other identities involving these polynomials can found in the Choi reference in Hoffman's paper.  Tom Copeland, Oct 05 2019
On p. 39 of Ma Luo's thesis is the e.g.f. of rational functions r_n obtained through the (umbral) formula 1/(1r.T) = exp[log(1+P.T)], a differently signed e.g.f. of this entry, where (P.)^n = P_n are Eisenstein elliptic functions. P. 38 gives the example of 4! * r_4 as the signed 4th row partition polynomial of this entry. This series is equated through a simple proportionality factor to the Zagier Jacobi form on p. 25. Recurence relations for the P_n are given on p. 24 involving the normalized kweight Eisenstein series G_k introduced on p. 23 and related to the Bernoulli numbers.  Tom Copeland, Oct 16 2019
The Chern characteristic classes or forms of complex vector bundles and the characteristic polynomials of curvature forms for a smooth manifold can be expressed in terms of this entry's partition polynomials with the associated traces, or power sum polynomials, as the indeterminates. The Chern character is the e.g.f. of these traces and so its coefficients are given by the Faber polynomials with this entry's partition polynomials as the indeterminates. See the Mathoverflow question "A canonical reference for Chern characteristic classes".  Tom Copeland, Nov 04 2019


REFERENCES

Abramowitz and Stegun, Handbook, p. 831, column labeled "M_2".


LINKS

David W. Wilson, Table of n, a(n) for n = 1..11731 (rows 1 through 26).
Milton Abramowitz and Irene A. Stegun, editors, Multinomials: M_1, M_2 and M_3, Handbook of Mathematical Functions, December 1972, pp. 8312.
H. Airault and A. Bouali, Differential calculus on the Faber polynomials, Bulletin des Sciences MathÃ©matiques, Volume 130, Issue 3, AprilMay 2006, Pages 179222.
J. Borger, Witt vectors, semirings, and total positivity, arXiv:1310.3013 [math.CO], 2015.
A. Bouali, Faber polynomials CayleyHamilton equation and Newton symmetric functions, Bulletin des Sciences MathÃ©matiques, Volume 130, Issue 1, JanFeb 2006, Pages 4970.
L. Boya and K. Dixit, Geometry of density states, arXiv:808.1930 [quantphy], 2017.
M. Byrd and N. Khaneja, Characterization of the positivity of the density matrix in terms of the coherence vector representation , arXiv:quantphy/0302024, 2003.
S. Carrell, Combinatorics of the KP Hierarchy, Thesis, University of Waterloo, Ontario, Canada, 2009.
S. Chmutov, M. Kazarian, S. Lando, Polynomial graph invariants and the KP hierarchy , arXiv:1803.09800 [math.CO], p. 1617, 2018.
T. Copeland, Lagrange a la Lah, Riemann zeta function at positive integers and an Appell sequence of polynomials, The creation / raising operators for Appell sequences, Generators, Inversion, and Matrix, Binomial, and Integral Transforms, Addendum to Elliptic Lie Triad, Formal group laws and binomial Sheffer polynomials
Mark Dominus Cycle classes of permutations [From Wouter Meeussen, Jun 26 2009]
G. Duchamp, Important formulas in combinatorics: The exponential formula, a Mathoverflow answer, 2015.
R. Friedrich and J. McKay, Formal groups, Witt vectors and free probablility, arXiv:1204.6522 [math.OA], 2012.
M. Hoffman, Harmonicnumber summation identities, symmetric functions, and multiple zeta values, arXiv:1602.03198 [math.NT], p. 23, 2016.
Wolfdieter Lang, First ten rows and polynomials.
Ma Luo, Algebraic De Rham Theory for Completions of Fundamental Groups of Moduli Spaces of Elliptic Curves, Ph.D. dissertation, Math Dept., Duke Univ., 2018.
Ma Luo, Algebraic De Rham Theory for Completions of Fundamental Groups of Moduli Spaces of Elliptic Curves, arXiv:1804.06977 [math.NT], 2019.
MathOverflow, Cycling through the Zeta Garden: Zeta functions for graphs, cycle index polynomials, and determinants, a question posed by Tom Copeland, 2012.
MathOverflow, Canonical reference for Chern characteristic classes, a question posed by Tom Copeland, 2019.
L. Maxim and J. Schuermann, Equivariant characteristic classes of external and symmetric products of varieties, arXiv:1508.04356 [math.AG], 2015.
R. Szabo, N=2 guage theories, instanton moduli spaces and geometric representation theory, arXiv:1507.00685 [hepth], 2015.
Andrei Vieru, Analytic renormalization of multiple zeta functions. Geometry and combinatorics of generalized Euler reflection formula for MZV, arXiv preprint arXiv:1601.04703 [math.NT], 2016.


FORMULA

T(n,k) = n!/Product_{j=1..n} j^a(n,k,j)*a(n,k,j)!, with the kth partition of n >= 1 in AbromowitzStegun order written as Product_{j=1..n} j^a(n,k,j) with nonnegative integers a(n,k,j) satisfying Sum_{j=1..n} j*a(n,k,j) = n, and the number of parts is Sum_{j=1..n} a(n,k,j) =: m(n,k).  Wolfdieter Lang, May 25 2019
Raising and lowering operators are given for the partition polynomials formed from this sequence in the link in "Lagrange a la Lah Part I" on p. 23.  Tom Copeland, Sep 18 2011
From Szabo p. 34, with b_n = q^n / (1q^n)^2, the partition polynomials give an expansion of the MacMahon function M(q) = Product_{n>=1} 1/(1q^n)^n = Sum_{n>=0} PL(n) q^n, the generating function for PL(n) = n! P_n(b_1,...,b_n), the number of plane partitions with sum n.  Tom Copeland, Nov 11 2015
From Tom Copeland, Nov 18 2015: (Start)
The partition polynomials of A036040 are obtained by substituting x[n]/(n1)! for x[n] in the partition polynomials of this entry.
CIP_n(tF(1,b1),F(2,b1,b2),...,F(n,b1,...,bn)) = P_n(b1,...,bn;t), where CIP_n are the partition polynomials of this entry; F(n,...), those of A263916; and P_n, those defined in my formula in A094587, e.g., P_2(b1,b2;t) = 2 b2 + 2 b1 t + t^2.
CIP_n(F(1,b1),F(2,b1,b2),...,F(n,b1,...,bn)) = n! bn. (End)
From the relation to the elementary Schur polynomials given in A130561 and above, the partition polynomials of this array satisfy (d/d(x_m)) P(n,x_1,...,x_n) = (1/m) * (n!/(nm)!) * P(nm,x_1,...,x_(nm)) with P(k,...) = 0 for k<0.  Tom Copeland, Sep 07 2016
Regarded as Appell polynomials in the indeterminate x(1)=u, the partition polynomials of this entry P_n(u) obey d/du P_n(u) = n * P_{n1}(u), so the abscissas for the zeros of P_n(u) are the same as those of the extrema of P{n+1}(u). In addition, the coefficient of u^{n1} in P_{n}(u) is zero since these polynomials are related to the characteristic polynomials of matrices with null main diagonals, and, therefore, the trace is zero, further implying the abscissa for any zero is the negative of the sum of the abscissas of the remaining zeros. This assumes all zeros are distinct and real.  Tom Copeland, Nov 10 2019


EXAMPLE

The partition array T(n, k) begins (see the W. Lang link for rows 1..10):
n\k 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 ...
1: 1
2: 1 1
3: 2 3 1
4 6 8 3 6 1
5 24 30 20 20 15 10 1
6 120 144 90 40 90 120 15 40 45 15 1
7 720 840 504 420 504 630 280 210 210 420 105 70 105 21 1
... reformatted by Wolfdieter Lang, May 25 2019


MAPLE

nmax:=7: with(combinat): for n from 1 to nmax do P(n):=sort(partition(n)): for r from 1 to numbpart(n) do B(r):=P(n)[r] od: for m from 1 to numbpart(n) do s:=0: j:=0: while s<n do j:=j+1: s:=s+B(m)[j]: x(j):=B(m)[j]: end do; jmax:=j; for r from 1 to n do q(r):=0 od: for r from 1 to n do for j from 1 to jmax do if x(j)=r then q(r):=q(r)+1 fi: od: od: A036039(n, m) := n!/ (mul((t)^q(t)*q(t)!, t=1..n)); od: od: seq(seq(A036039(n, m), m=1..numbpart(n)), n=1..nmax); # Johannes W. Meijer, Jul 14 2016
# 2nd program:
A036039 := proc(n, k)
local a, prts, e, ai ;
a := n! ;
# ASPrts is implemented in A119441
prts := ASPrts(n)[k] ;
ai := 1;
for e from 1 to nops(prts) do
if e>1 then
if op(e, prts) = op(e1, prts) then
ai := ai+1 ;
else
ai := 1;
end if;
end if;
a := a/(op(e, prts)*ai) ;
end do:
a ;
end proc:
seq(seq(A036039(n, k), k=1..combinat[numbpart](n)), n=1..15) ; # R. J. Mathar, Dec 18 2016


MATHEMATICA

aspartitions[n_]:=Reverse/@Sort[Sort/@IntegerPartitions[n]]; (* Abramowitz & Stegun ordering *);
ascycleclasses[n_Integer]:=n!/(Times@@ #)&/@((#!
Range[n]^#)&/@Function[par, Count[par, # ]&/@Range[n]]/@aspartitions[n])
(* The function "ascycleclasses" is then identical with A&S multinomial M2. *)
(* Wouter Meeussen, Jun 26 2009, Jun 27 2009 *)


PROG

(Sage)
def PartAS(n):
P = []
for k in (1..n):
Q = [p.to_list() for p in Partitions(n, length=k)]
for q in Q: q.reverse()
P = P + sorted(Q)
return P
def A036039_row(n):
fn, C = factorial(n), []
for q in PartAS(n):
q.reverse()
p = Partition(q)
fp = 1; pf = 1
for a, c in p.to_exp_dict().iteritems():
fp *= factorial(c)
pf *= factorial(a)**c
co = fn//(fp*pf)
C.append(co*prod([factorial(i1) for i in p]))
return C
for n in (1..10):
print A036039_row(n) # Peter Luschny, Dec 18 2016


CROSSREFS

Cf. A036036, A036037, A036038, A036040.
Cf. A102189 (rows reversed).
Cf. A094587, A115131, A130561, A263634, A263916.
Cf. A133932.
Sequence in context: A035485 A074306 A294218 * A324254 A279038 A092271
Adjacent sequences: A036036 A036037 A036038 * A036040 A036041 A036042


KEYWORD

nonn,easy,nice,tabf,look,hear,changed


AUTHOR

N. J. A. Sloane


EXTENSIONS

More terms from David W. Wilson


STATUS

approved



