1,550 research outputs found
The combinatorics of associated Hermite polynomials
We develop a combinatorial model of the associated Hermite polynomials and
their moments, and prove their orthogonality with a sign-reversing involution.
We find combinatorial interpretations of the moments as complete matchings,
connected complete matchings, oscillating tableaux, and rooted maps and show
weight-preserving bijections between these objects. Several identities,
linearization formulas, the moment generating function, and a second
combinatorial model are also derived.Comment: [v1]: 18 pages, 16 figures; presented at FPSAC 2007 [v2]: Some minor
errors fixed (thanks Bill Chen, Jang Soo Kim) and text rearranged and cleaned
up; no real content changes [v3]: fixed typos, to appear in European J.
Combinatoric
Spreading lengths of Hermite polynomials
The Renyi, Shannon and Fisher spreading lengths of the classical or
hypergeometric orthogonal polynomials, which are quantifiers of their
distribution all over the orthogonality interval, are defined and investigated.
These information-theoretic measures of the associated Rakhmanov probability
density, which are direct measures of the polynomial spreading in the sense of
having the same units as the variable, share interesting properties: invariance
under translations and reflections, linear scaling and vanishing in the limit
that the variable tends towards a given definite value. The expressions of the
Renyi and Fisher lengths for the Hermite polynomials are computed in terms of
the polynomial degree. The combinatorial multivariable Bell polynomials, which
are shown to characterize the finite power of an arbitrary polynomial, play a
relevant role for the computation of these information-theoretic lengths.
Indeed these polynomials allow us to design an error-free computing approach
for the entropic moments (weighted L^q-norms) of Hermite polynomials and
subsequently for the Renyi and Tsallis entropies, as well as for the Renyi
spreading lengths. Sharp bounds for the Shannon length of these polynomials are
also given by means of an information-theoretic-based optimization procedure.
Moreover, it is computationally proved the existence of a linear correlation
between the Shannon length (as well as the second-order Renyi length) and the
standard deviation. Finally, the application to the most popular
quantum-mechanical prototype system, the harmonic oscillator, is discussed and
some relevant asymptotical open issues related to the entropic moments
mentioned previously are posed.Comment: 16 pages, 4 figures. Journal of Computational and Applied Mathematics
(2009), doi:10.1016/j.cam.2009.09.04
Obstructions to combinatorial formulas for plethysm
Motivated by questions of Mulmuley and Stanley we investigate
quasi-polynomials arising in formulas for plethysm. We demonstrate, on the
examples of and , that these need not be counting
functions of inhomogeneous polytopes of dimension equal to the degree of the
quasi-polynomial. It follows that these functions are not, in general, counting
functions of lattice points in any scaled convex bodies, even when restricted
to single rays. Our results also apply to special rectangular Kronecker
coefficients.Comment: 7 pages; v2: Improved version with further reaching counterexamples;
v3: final version as in Electronic Journal of Combinatoric
The Matrix Ansatz, Orthogonal Polynomials, and Permutations
In this paper we outline a Matrix Ansatz approach to some problems of
combinatorial enumeration. The idea is that many interesting quantities can be
expressed in terms of products of matrices, where the matrices obey certain
relations. We illustrate this approach with applications to moments of
orthogonal polynomials, permutations, signed permutations, and tableaux.Comment: to appear in Advances in Applied Mathematics, special issue for
Dennis Stanto
Higher order matching polynomials and d-orthogonality
We show combinatorially that the higher-order matching polynomials of several
families of graphs are d-orthogonal polynomials. The matching polynomial of a
graph is a generating function for coverings of a graph by disjoint edges; the
higher-order matching polynomial corresponds to coverings by paths. Several
families of classical orthogonal polynomials -- the Chebyshev, Hermite, and
Laguerre polynomials -- can be interpreted as matching polynomials of paths,
cycles, complete graphs, and complete bipartite graphs. The notion of
d-orthogonality is a generalization of the usual idea of orthogonality for
polynomials and we use sign-reversing involutions to show that the higher-order
Chebyshev (first and second kinds), Hermite, and Laguerre polynomials are
d-orthogonal. We also investigate the moments and find generating functions of
those polynomials.Comment: 21 pages, many TikZ figures; v2: minor clarifications and addition
A product formula and combinatorial field theory
We treat the problem of normally ordering expressions involving the standard boson operators a, ay where [a; ay] = 1. We show that a simple product formula for formal power series | essentially an extension of the Taylor expansion | leads to a double exponential formula which enables a powerful graphical description of the generating functions of the combinatorial sequences associated with such functions | in essence, a combinatorial eld theory. We apply these techniques to some examples related to specic physical Hamiltonians
- …