rnThe Wiener index is a graphical invariant that has found extensive application in chemistry. We define a generating function, which we call the Wiener polynomial, whose derivative is a q-analog of the Wiener index. We study some of the elementary properties of this polynomial and compute it for some common graphs. We then find a formula for the Wiener polynomial of a dendrimer, a certain highly regular tree of interest to chemists, and show that it is unimodal. Finally, we point out a connection with the Poincar6 polynomial of a finite Coxeter group. 0 1996 John Wiley & Sons, Inc.the boiling point of paraffin. Since then, the index has been shown to correlate with a host of other properties of molecules (viewed as graphs). For more information about the Wiener index in chemistry and mathematics, see [2, 31, respectively. We wish to define and study a related generating function. If q is a parameter, then the Wiener polynomial of G is
In this paper we focus on Dyck paths with peaks avoiding or restricted to an arbitrary set of heights. The generating functions of such types of Dyck paths can be represented by continued fractions. We also discuss a special case that requires all peak heights to either lie on or avoid a congruence class (or classes) modulo k. The case when k = 2 is especially interesting. The two sequences for this case are proved, combinatorially as well as algebraically, to be the Motzkin numbers and the Riordan numbers. We introduce the concept of shift equivalence on sequences, which in turn induces an equivalence relation on avoiding and restricted sets. Several interesting equivalence classes whose representatives are well-known sequences are given as examples.
This paper describes several combinatorial models for Laguerre, Charlier, and Hermite polynomials, and uses them to prove combinatorially some classical formulas. The so‐called “Italian limit formula” (from Laguerre to Hermite), the Appel identity for Hermite polynomials, and the two Sheffer identities for Laguerre and Charlier polynomials are proved. We also give bijective proofs of the three‐term recurrences. These three families form the bottom triangle in R. Askey's chart classifying hypergeometric orthogonal polynomials.
In this paper, we apply Lucas' theorem to evaluate the congruences of several combinatorial numbers, including the central Delannoy numbers and a class of Apéry-like numbers, the numbers of noncrossing connected graphs, the numbers of total edges of all noncrossing connected graphs on n vertices, etc. One of these results verifies a conjecture given by Deutsch and Sagan recently. In the end, we use an automaton to explain the idea of our approach.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.