A Translation Method for Finding Combinatorial Bijections |
| |
Authors: | Philip Matchett Wood Doron Zeilberger |
| |
Institution: | 1. Department of Mathematics, Rutgers University (New Brunswick), Hill Center-Busch Campus, 110 Frelinghuysen Road, Piscataway, NJ, 08854-8019, USA
|
| |
Abstract: | Consider a combinatorial identity that can be proved by induction. In this paper, we describe a general method for translating the inductive proof into a recursive bijection. Furthermore, we will demonstrate that the resulting recursive bijection can often be defined in a direct, non-recursive way. Thus, the translation method often results in a bijective proof of the identity that helps illuminate the underlying combinatorial structures. This paper has two main parts: First, we describe the translation method and the accompanying Maple code; and second, we give a few examples of how the method has been used to discover new bijections. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|