Combinatorial identities by way of Wilf's multigraph model
نویسندگان
چکیده
For many families of combinatorial objects, a construction of Wilf (1977) allows the members of the family to be viewed as paths in a directed multigraph. Introducing a partition of these paths generates a number of known, but hitherto disparate, combinatorial identities. We include several examples.
منابع مشابه
Applications of graphical condensation for enumerating matchings and tilings
A technique called graphical condensation is used to prove various combinatorial identities among numbers of (perfect) matchings of planar bipartite graphs and tilings of regions. Graphical condensation involves superimposing matchings of a graph onto matchings of a smaller subgraph, and then re-partitioning the united matching (actually a multigraph) into matchings of two other subgraphs, in o...
متن کاملLattice Paths and Rogers Identities
Recently we interpreted five q-series identities of Rogers combinatorially by using partitions with “n + t copies of n” of Agarwal and Andrews [1]. In this paper we use lattice paths of Agarwal and Bressoud [2] to provide new combinatorial interpretations of the same identities. This results in five new 3-way combinatorial identities.
متن کاملPath Counting and Random Matrix Theory
We establish three identities involving Dyck paths and alternating Motzkin paths, whose proofs are based on variants of the same bijection. We interpret these identities in terms of closed random walks on the halfline. We explain how these identities arise from combinatorial interpretations of certain properties of the β-Hermite and β-Laguerre ensembles of random matrix theory. We conclude by p...
متن کاملChromatic number of a nonnegative matrix
A new set of combinatorial invariants of nonnegative matrices with zero diagonal is introduced. They generalize the notion of the chromatic and the circular chromatic number of a graph and the notion of an optimal traveling salesman tour (metric case). An extension of Wilf's eigenvalue upper bound on the chromatic number is derived, and some directions for further research are suggested.
متن کاملOn the Topology of Multigraph Picture Spaces
Let G be a multigraph. We study the space X (G) of all pictures of G in complex projective d-space. The main result is that the homology groups (with integer coefficients) of X (G) are completely determined by the Tutte polynomial of G. One application is a criterion in terms of the Tutte polynomial for independence in the d-parallel matroids studied in combinatorial rigidity theory. In the cas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Math. Mathematical Sciences
دوره 2006 شماره
صفحات -
تاریخ انتشار 2006