Dan's record of work for REACH
This is a page to record what I've done for REACH. Eventually, it
will presumably (hopefully!) be much longer than it is now.
If this isn't what you're looking for, you can go back to my
private REACH page.
Total hours worked so far: 48
October 31, 2002
October 29, 2002
October 28, 2002
- Worked on hextiling problem for an hour, mostly fooling
around.
- Talked to Michael Sipser at MIT about if he thinks it's
NP-complete, ~1 hour. He convinced me that, if we don't stipulate that the
region is simply connected, it is probably NP-complete.
Week 5
Total hours: 10.5
October 26, 2002
- Finished program and tested it a bit, ~1 hour.
- Read Conway article, ~1 hour
- Added graphical output and more tiles, ~30 minutes.
October 25, 2002
- ~2 hours working on program to test out hextilings. Some
debugging left.
October 24, 2002
- REACH meeting, 3pm-5pm. I'm working on the hextiling
problem.
- ~2 hours working on program to test out hextilings.
October 22, 2002
Week 4
Total hours: 7.0
October 20, 2002
- Typed up REACH meeting notes, one hour.
- Read over tri-hex tiling problem, 2 hours.
October 17, 2002
October 15, 2002
Week 3
Total hours: 9.0 (this next week will be busier, though!)
October 14, 2002
- Spent about 2 hours reading up on old REACH minutes, going
back through /bilinear/domino a bit, and finally reading through
integrality.html and symmetry.html.
October 13, 2002
- Spent about 1.5 hours reading up on generating functions in
Concrete Mathematics.
October 10, 2002
October 9, 2002
- Looked over the tiling article again, for about half an hour;
also read the /bilinear/domino paper for a bit, about an hour.
October 8, 2002
Week 2
Total hours: 5.0 (busy, busy week)
October 3, 2002
- Morning: some work on article for about an hour.
- REACH meeting, 3-5pm.
October 1, 2002
Week 1
Total hours: 10.5
October 1, 2002
- Worked about one hour on generating function solution (didn't
get quite the right thing, but close).
September 30, 2002
- Worked for about 1 1/2 hours on the 3 x n problem. I
gave up my more general method from last time, at least for the time
being (it's too much to mess with right now), and tried just using a
similar solution to the 2 x n case, landing me with five
recurrences that all depend on each other. I messed with Mathematica
to try to get that to work, but the combination of having not the
right fonts on the computer and being unable to quite get RSolve to
work meant that I didn't get a solution. Almost there, though.
September 29, 2002
- Worked for about 3 1/2 hours on the 3 x n problem. I
now have a very ugly solution. Hopefully it cleans up, but I can't
see how, yet.
September 26, 2002
September 25, 2002
- Proved recurrence relation for dot problem. ~30 minutes. No
time to actually investigate further today, though.
September 24, 2002
- Attended REACH first meeting, 3pm-5pm
You can go back to my private REACH page.