Date of Award
5-30-2010
Document Type
Open Access Senior Thesis
Degree Name
Bachelor of Science
Department
Mathematics
First Thesis Advisor
Arthur T. Benjamin
Second Thesis Advisor
Kimberly Tucker
Rights Information
© 2010 Bo Chen
Terms of Use & License Information
Abstract
In 1961, Kasteleyn, Fisher, and Temperley gave a result for the number of possible tilings of a 2m 2n checkerboard with dominoes. Their proof involves the evaluation of a complicated Pfaffian. In this thesis we investigate combinatorial strategies to evaluate the sum of evenly spaced binomial coefficients, and present steps towards a purely combinatorial proof of the 1961 result.
Recommended Citation
Chen, Bo, "Combinatorial Proofs Using Complex Weights" (2010). HMC Senior Theses. Paper 16.
http://scholarship.claremont.edu/hmc_theses/16
COinS
Comments
Previously linked to as: http://ccdl.libraries.claremont.edu/u?/stc,330