Matchings

Feb. 12th, 2009 12:01 pm
stoutfellow: (Winter)
[personal profile] stoutfellow
Last week, I gave my History of Math students a list of possible topics for their first essays. I asked them each to select three topics that they would be interested in doing; I would then select one of their three. I finally got everyone's choices last night, and today tried to reconcile them. (I don't want two students doing the same topic.)

It was impossible. I do not use the word lightly; there are theorems in combinatorics which address the question of "matchings", as they are called, and one in particular that gives a necessary condition for their possibility. The lists of preferences I was given did not meet that condition.

Fortunately, one student had given me a preference-order for the entire list, rather than just three. Poor guy wound up with his seventh choice (out of twenty-nine), but any other assignment would have been purely arbitrary.

Date: 2009-02-13 09:01 am (UTC)
From: [identity profile] masgramondou.livejournal.com
I trust one of the topics was about maths in computer science with P vs NP algorithms and NP Completeness and proofs thereof :)

Date: 2009-02-13 11:11 am (UTC)
From: [identity profile] stoutfellow.livejournal.com
Gimme a break - we've barely gotten into the seventeenth century!

That'll be on the second topic list....

Profile

stoutfellow: Joker (Default)
stoutfellow

April 2020

S M T W T F S
    1 2 34
5 6 789 1011
12 13 14 1516 17 18
19202122232425
2627282930  

Most Popular Tags

Style Credit

Expand Cut Tags

No cut tags
Page generated Jan. 25th, 2026 01:59 am
Powered by Dreamwidth Studios