Thursday, December 29, 2011
Friday, November 4, 2011
Monday, September 19, 2011
Thursday, September 8, 2011
Wednesday, August 17, 2011
Saturday, August 6, 2011
In Section 9.5, we introduce graph optimization problems, with an emphasis on the Traveling Salesman Problem and the Network Flow Problem. A the end we mention a few others, including the Minimum Matching Problem, also known as the Marriage Problem. I've just posted a demonstration of this problem, comparing the greedy algorithm with the optimal solution.
This is an example of a cdf file.
Tuesday, August 2, 2011
Thought I'd document the process for future reference. Here are the steps:
Procedure for creating one pdf for 92.321
1. Run Workflow "Build_OnePDF_321" using Automator. This pulls out the files in the right order and saves the combined files into a single pdf.
2. Open the resulting pdf in PDFpen
3. Run an Applescript I call "Number_Pages_KL_odd_even" that numbers the pages alternately on the bottom right and left.
4. Annotate front page with semester-specific information.
That's it. With the software executing the workflows, producing the final pdf takes only a few minutes, most of it in step 4.
Thursday, July 7, 2011
Thursday, May 19, 2011
Chapter 16 page:
Friday, April 22, 2011
I've just uploaded a video with a brief description of a field extension and the construction of a finite field.
Thursday, April 7, 2011
Saturday, March 12, 2011
Wednesday, February 23, 2011
Monday, January 24, 2011
Friday, January 21, 2011
The first half of Chapter 16, An Introduction to Rings and Fields, is available for review.
Wednesday, January 12, 2011
I played Bulgarian Solitaire with math teachers at Lawrence High on January 11, 2011. What's Bulgarian Solitaire? See http://en.wikipedia.org/wiki/Bulgarian_solitaire , although we used coins instead of cards.
Three follow-up items:
- We didn't get a chance to discuss "Garden of Eden" configurations, but I wanted to point out how this is such a great name. A Garden of Eden position is one that can't be reached from any other configuration in the game. The name does such a good job of capturing the idea behind it!
- Unlike positions that create one-cycles, which we discussed and seem to be rare, there seem to be lots of Gardens of Eden as you increase the number of coins/cards in the game. For example (2,2,2,2,.....) where there are at least four 2's is Garden of Eden. Do you see why?
- Technology. You get some interesting macroscopic information about what happens when you change the number of coins by generating state graphs like the one you see above for 10 coins.
I've prepared a Mathematica Notebook that has more images. They can be viewed using Mathematica or the free Mathematica Player application.
Thursday, January 6, 2011