Discrete Math I

Math 850 Fall 2012 Section 001

Announcements:
(Dec 18) I have finished grading the final exam and computing the final course grades. I have posted these on Blackboard and have submitted the course grades. If you have any questions or concerns, please email me.
I greatly enjoyed teaching this class, and I hope that you enjoyed it, too. Thanks for your hard work this semester, and enjoy the winter break!

 
Course Materials:
    Course policies and course log recording topics covered in each lecture.
    Textbook: prepublication version of Combinatorial Mathematics (corrections) by D.B. West.

Homework:
homework #1, due Wed Aug 29
homework #2, due Thurs Sept 6 by noon
homework #3, due Wed Sept 12
homework #4, due Wed Sept 19
homework #5, due Fri Sept 28
homework #6, due Mon Oct 8
homework #7, due Wed Oct 17
homework #8, due Wed Oct 24
homework #9, due Wed Oct 31
homework #10 (tex), due Fri Nov 9
homework #11 (tex), due Wed Nov 21 by noon
homework #12 (tex), due Wed Dec 5
take home final (tex), due Thurs Dec 13 at 10am (at the final exam in class)

Additional references for coding theory:
  • Essential Coding Theory by Venkatesan Guruswami, Atri Rudra, and Madhu Sudan.
  • Ron M. Roth, Introduction to Coding Theory, Cambridge University Press, 2006.
  • Vera Pless and W. Cary Huffman, Fundamentals of Error-Correcting Codes, Cambridge University Press, 2003.
  • J. I. Hall, Notes on coding theory.
Additional references for enumerative combinatorics:
  • Combinatorics: Topics, Techniques, Algorithms by Peter Cameron
  • Enumerative Combinatorics vol 1 by Richard Stanley
  • A Course in Enumeration by Martin Aigner (available through SpringerLink through UNL)
  • generatingfunctionology by Herb Wilf
  • Combinatorics and Graph Theory by John Harris, Jeffry L. Hirst and Michael Mossinghoff (available through SpringerLink through UNL)
  • Schaum's Outline of Theory and Problems of Combinatorics including concepts of Graph Theory by V. K. Balakrishnan
 
Instructor:
    Stephen Hartke, hartke @ No . Spam . mäth . únl . edu (appropriately changed)
    Office: Avery Hall Room 339, Phone: 402-472-7001
    Office Hours: Mon, Wed, and Fri, 10:30-11:20am, or by appointment.
Meeting Times:
    Mon, Wed, and Fri, 9:30am-10:20am, Avery Hall Room 109
Collaborative Study Sessions:
    Mon, 5:30pm-6:30pm, Avery Hall Room 348 (lounge)
Tests:
    Evening tests: Tues Oct 2 at 6:30pm and Tues Nov 13 at 6:30pm in 351 Avery
Final Exam:
    Thurs Dec 13, 10:00am-12:00pm Avery Hall Room 109
 
Old Announcements:
(Nov 26) The final exam will be split into two parts: a take-home part given out on Wed Dec 5 and due on Thurs Dec 13 in class, and a 2-hour in-class exam given on Thurs Dec 13 at 10am in our usual room.
(Dec 5) This is the Sage worksheet demonstrating encoding and decoding generalized Reed-Solomon codes.
(Dec 3) The math department is now conducting course evaluations online. Please fill out the course evaluation, as the information is helpful both for me and the department in improving teaching. The evaluations are accessible through Blackboard or the course evaluation website. The evaluations close on December 9 (the Sunday before finals week)---I do not see the actual responses until the beginning of the Spring 2013 semester. Following math department policy, if at least 14 of the 17 registered students respond, then everyone will receive a 5 point bonus on their final exam.
(Nov 26) We will not have class on Friday November 30. We will not have the study session today, Monday Nov 26. The study session will be held as usual next week on Mon Dec 3.
(Nov 16) These are notes on Shannon's theorem.
(Nov 12) These are notes on discrete probability. Chapter 14 of the textbook also has a brief overview of discrete probability.
(Nov 9) The second test will be Tues Nov 13 at 6:30pm in 351 Avery. The test will cover material starting with exponential generating functions and up through linear codes in coding theory (lecture of Nov 5). The format will be the same as the first test. Each student may bring a note sheet: one 8.5x11 sheet with whatever they want written on it (front and back).
(Nov 9) This is the Sage worksheet demonstrating the generator and parity check matrices for a random linear code.
(Oct 17) Below are some additional resources on the material we've been covering.
(Oct 15) Thanks to everyone who filled out the informal feedback survey! Here is a summary of the responses.
(Oct 8) The study session this week will be at 5pm on Thursday Oct 11 in the lounge (348 Avery). We will not have the study session on Monday Oct 15 because of Fall Break.
(Oct 1) The study session this week will be at 5pm on Friday Oct 5 in the lounge (348 Avery).
(Sept 26) The tests will be in 351 Avery.
(Sept 19) The first test will be Tues Oct 2 at 6:30pm (room TBA). The test will cover material up through Section 3.2 (up through Snake Oil). The test will have questions similar in flavor to the homework, but shorter. Students will have some choice on which questions to answer. Each student may also bring a note sheet: one 8.5x11 sheet with whatever they want written on it (front and back).
(Sept 12) This handout shows all of the steps of solving the Fibonacci recurrence with generating functions.
(Sept 12) There will be no class on Friday Sept 21.
(Aug 29) Because of Labor Day, the study session for the week of Sept 3 is moved to Tues Sept 4 at 5:00pm in 348 Avery.
(Aug 22) The study sessions will be Mondays at 5:30pm in 348 Avery. The evening tests will be on Tuesdays Oct 2 and Nov 13.

    Back This page last modified .