Electronic Proceedings of the Twentythird Annual International Conference on Technology in Collegiate MathematicsDenver, Colorado, March 1720, 2011Paper S094
This is an electronic reprint, reproduced by permission of Pearson Education Inc. Originally appeared in the Proceedings of the Twentythird Annual International Conference on Technology in Collegiate Mathematics, ISBN 0321689844, Copyright (C) 2012 by Pearson Education, Inc. 
Using Maple to Enumerate Restricted Binary Rectangles 
Click to access this paper:

We generalize the counting of binary strings without certain substrings to the enumeration of binary rectangles without particular subrectangles. We examine how Maple can be used at a student project level to study the problem, generate examples and motivate theoretical results.
Keyword(s): Maple, linear algebra