Skip to main content
Department of Mathematics College of Liberal Arts and Sciences

Introduction to Combinatorics

MAD 4204 – 4563

Spring 2019

______________________________________________________

Time:      MWF period 7

Place:     Little 223

Phone:   352-294-2339

Office:    438 Little Hall

Email:    avince@ufl.edu

Textbook:             A Walk Through Combinatorics (fourth edition)   by  M. Bona


Office Hours:        Monday, Wednesday, Friday  –  period 4

                                            (or by appointment)

______________________________________________________

Links

homework

topics

messages

grades

cell phone policy

Homework

Page 277 #3
Page 285 #1
Page 291 #4,12,26
Page 545 #9,21
  due Friday Jan 18

Page 543 #1 (assume that n is a power of 2), 4
The predecessor graph obtained using BFS is a tree.
A method to detect cycles as edges are added in an algorithm.
     due Friday Feb 1

Page 542 Quickcheck 1-3
Page 546 #22
     due Friday Feb 8

Page 574 Quickcheck 1,3
Page 575 #2,6
    due Mon Feb 25
   
Page 327 Quick Check 1-3
Page 330 Quick Check 1-3

Prove:  The intersection of convex sets is convex.
Page 333 Quick Check 1-3
Page 335 20,30, 24-27
    due Fri March 15

Page 423 QC #3
Page 438 QC #1
Page 439 #7,8,10,11,12,25,32,33
    due Fri March 29

Page 475  quick check #2
Page 478 #35,37
Given these parameters,codes exist?  Explain.  (8,2,3), (8,3,8), (3,9,1), (4,8,2), (5,3,4), (8,4,5)
    due Wed April 10

The sum of two even weight binary codewords has even weight.
The sum of an even and an odd weight binary codeword has odd weight.
Page 385 Quick Check 1-3
Page 387 Quick Check 1,2
Page 406 #24
    due Fri April 19

Topics

  • Graph Theory
    • Turan’s theorem
      matching
      graph algorithms (depth-first and breadth-first search, minimum spanning tree, shortest paths)
  • Computational Complexity (big “O” notation, sorting, )
  • Ramsey Theory
  • Probabilistic Method
  • Block Designs
  • Error Correcting Code
  • Partially Ordered Sets and Lattices

Messages

Welcome to combinatorics


Free tutoring at the Teaching Center, SW Broward Hall. Check Teaching Center for the time schedule.

Students with disabilities requesting accommodations should first register with the Disability Resource Center (352-392-8565) by providing appropriate documentation. Once registered, students will receive an accommodation letter which must be presented to the instructor when requesting accommodation. Students with disabilities should follow this procedure as early as possible in the semester.

The course will be conducted in accordance with the academic honesty policy, and policy regarding the use of copyrighted material.

“Requirements for class attendance and make-up exams, assignments, and other work in this course are consistent with university policies that can be found at: attendance policies.

Information on current UF grading policies for assigning grade points may be found at: grades.

Students are expected to provide feedback on the quality of instruction in this course by completing online evaluations. Evaluations are typically open during the last two or three weeks of the semester, but students will be given specific times when they are open. Summary results of these assessments are available to students at https://evaluations.ufl.edu/results/.

Grades

  • 3 Exams – 25% each
    • February 13
    • March 18
    • April 22
  • Homework – 25%