Higher-order matching polynomials and d-orthogonality
From MaRDI portal
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45)
Abstract: 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3831972 (Why is no real title available?)
- scientific article; zbMATH DE number 3877196 (Why is no real title available?)
- scientific article; zbMATH DE number 3941543 (Why is no real title available?)
- scientific article; zbMATH DE number 3943829 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 3801565 (Why is no real title available?)
- A Course in Enumeration
- Catalan numbers, their generalization, and their uses
- Combinatoire des polynômes orthogonaux classiques: Une approche unifiée. (Combinatorics of classical orthogonal polynomials: A unified approach)
- Combinatorial aspects of continued fractions
- Counting on Chebyshev polynomials
- Distribution of crossings, nestings and alignments of two edges in matchings and partitions
- Fibonacci polynomials: compositions and cyclic products
- Hermite polynomials and a duality relation for matchings polynomials
- Higher-order Fibonacci numbers
- L'orthogonalité et les récurrences de polynômes d'ordre supérieur à deux
- Octabasic Laguerre polynomials and permutation statistics
- On a general class of graph polynomials
- On the theory of the matching polynomial
- Orthogonal polynomials and combinatorics
- Path decompositions of chains and circuits
- Specializations of Generalized Laguerre Polynomials
- The Combinatorics of Laguerre, Charlier, and Hermite Polynomials
- The On-Line Encyclopedia of Integer Sequences
- The higher-order matching polynomial of a graph
- The umbral calculus
Cited in
(8)- On semi-classical \(d\)-orthogonal polynomials
- Higher order matching polynomial
- scientific article; zbMATH DE number 3989395 (Why is no real title available?)
- Matching polynomials and duality
- A generalization of the symmetric classical polynomials: Hermite and Gegenbauer polynomials
- Generalization of matching extensions in graphs -- combinatorial interpretation of orthogonal and \(q\)-orthogonal polynomials
- Orthogonal polynomials through complex matrix graph theory
- On a class of polynomial sets generated by \(F(xt-R(t))\)
This page was built for publication: Higher-order matching polynomials and \(d\)-orthogonality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534193)
