Abstract
One basic activity in combinatorics is to establish combinatorial identities by so-called ‘bijective proofs,’ which amounts to constructing explicit bijections between two types of the combinatorial objects in question.
The aim of this paper is to show how techniques from the formal logic world can be applied directly to such problems studied completely independently in the world of combinatorics.
The basic idea is to characterize equinumerous partition ideals in terms of the minimal elements generating the order filters, the complements to the original ideals.
For the case where the minimal elements of each of these order filters are disjoint, we have developed a general automated method to remove the mystery of certain known results and establish new results in the theory of integer partitions: Kanovich [Finding direct partition bijections by two-directional rewriting techniques. Discrete Math., 285 (1-3) (2004) 151-166], and Kanovich [The two-way rewriting in action: Removing the mystery of Euler-Glaisher’s map. Discrete Math., (2006), doi:10.1016/j.disc.2006.10.005].
Here we address the case of filters having overlapping minimal elements. Essentially this is a case study related to the Fibonacci numeration system.
In addition to a ‘bijective proof’ for Zeckendorf’s theorem - that every positive integer is uniquely representable within the Fibonacci numeration system, we establish ‘bijective proofs’ for a new series of partition identities related to Fibonacci and Lucas numbers.
The main result is proved using the idea of filter supports, and rewriting systems on multisets having overlapping patterns.
The main technical step is a suitable construction of such a rewriting system and then a proof that this rewriting system and the system consisting of its reverse rewriting rules, both have the Church-Rosser property, with providing the bijections we are looking for.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Andrews, G.E.: The Theory of Partitions. Cambridge University Press, Cambridge (1998)
Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, volume B, pp. 243–320. Elsevier, Amsterdam (1990)
Garsia, A.M., Milne, S.C.: Method for constructing bijections for classical partition identities. Proc. Nat. Acad. Sci. U.S.A. 78(4), 2026–2028 (1981)
Gordon, B.: Sieve-equivalence and explicit bijections. J. Combin. Theory Ser. A 34(1), 90–93 (1983)
O’Hara, K.M.: Bijections for partition identities. J. Combin. Theory Ser. A 49(1), 13–25 (1988)
Kanovich, M.: Finding direct partition bijections by two-directional rewriting techniques. Discrete Mathematics 285(1-3), 151–166 (2004), The preliminary version: Bijections between partitions by two-directional rewriting techniques. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 44–58. Springer, Heidelberg (2002)
Kanovich, M.: The two-way rewriting in action: Removing the mystery of Euler-Glaisher’s map. Discrete Mathematics (2006), doi:10.1016/j.disc.2006.10.005
Klop, J.W.: Term rewriting systems. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 2, pp. 1–116. Oxford University Press, New York (1992)
Knuth, D.: The Art of Computer Programming, vol. 2: Seminumerical Algorithms. Addison-Wesley, Reading (1997)
Remmel, J.B.: Bijective proofs of some classical partition identities. J. Combin. Theory Ser. A 33, 273–286 (1982)
Wilf, H.S.: Sieve equivalence in generalized partition theory. J. Combin. Theory Ser. A 34, 80–89 (1983)
Wilf, H.S.: Lectures on Integer Partitions. University of Victoria, Victoria, B.C., Canada (2000), http://cis.upenn.edu/~wilf
Zeckendorf, E.: A Generalized Fibonacci Numeration. Fibonacci Quarterly 10, 365–372 (1972)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Kanovich, M. (2007). A Note on Rewriting Proofs and Fibonacci Numbers. In: Artemov, S.N., Nerode, A. (eds) Logical Foundations of Computer Science. LFCS 2007. Lecture Notes in Computer Science, vol 4514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72734-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-72734-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72732-3
Online ISBN: 978-3-540-72734-7
eBook Packages: Computer ScienceComputer Science (R0)