Upcoming SlideShare
×

# Math Project Presentation New

923
-1

Published on

Published in: Technology, News & Politics
0 Likes
Statistics
Notes
• Full Name
Comment goes here.

Are you sure you want to Yes No
• Be the first to comment

• Be the first to like this

Views
Total Views
923
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
3
0
Likes
0
Embeds 0
No embeds

No notes for slide

### Math Project Presentation New

1. 1. THE BALLOT PROBLEM OF MANY CANDIDATES
2. 2. <ul><li>Advisers : </li></ul><ul><li>Mr.Thammanoon Puirod </li></ul><ul><li>Mr. Deaw Jaibun </li></ul><ul><li>Members : </li></ul><ul><li>Mr. Norrathep Rattanavipanon </li></ul><ul><li>Mr. Nuttakiat Chaisettakul </li></ul><ul><li>Mr. Papoj Thamjaroenporn </li></ul>
3. 3. What is the Ballot problem? <ul><li>Suppose A and B are candidates and there are a+b voters, a voting for A and b for B. In how many ways can the ballots be counted so that A is always ahead of B ? </li></ul>The formula comes up to be . a voters for A b voters for B
4. 4. Why is it interesting? <ul><li>The Ballot problem is one of very well-known problems. This problem had been proved for two candidates. </li></ul><ul><li>What about any n, which is more than 2, candidates? </li></ul>
5. 5. Objective To find the formula and proof of Ballot problem for many candidates.
6. 6. In the case of two candidates (The Original Ballot problem)
7. 7. Suppose is the ballots of the 1 st candidate. is the ballots of the 2 nd candidate, when . Define “1” as the ballot given to 1 st candidate. “ -1” as the ballot given to 2 nd candidate. In the case of two Candidates
8. 8. The number of ways to count the ballots for required condition. The number of permutation of the sequence: such that the partial sum is always positive. The number of ways to walk on the lattice plane starting at (0,0) and finish at (a,b), and not allow pass through the line y=x except (0,0) = =
9. 9. In the case of two Candidates
10. 10. Reflection Principle “ Reflection principle” is use to count the number of path, one can show that the number of illegal ways which begin at (1,0) is equal to the number of ways begin at (0,1). It implies that, if we denote as the number of ways as required:
11. 11. Reflection Principle Figure 1 Figure 2
12. 12. In the case of three Candidates
13. 13. In the case of three Candidates
14. 14. In the case of three Candidates Figure 3 Figure 4
15. 15. How to count ?
16. 16. How to count ?
17. 17. <ul><li>1. Consider the path seen at the front view. Find all possible ways to “walk” within the allowed plane. </li></ul><ul><li>2. Consider the path seen at the side view. Find all possible ways to “walk” within the allowed plane. </li></ul><ul><li>3. Match each way of 1. to each of 2. (Sometimes it yields more than one complete path.) </li></ul>How to count ?
18. 18. Example Counting Front View F(1) F(2) F(3) F(4) F(5)
19. 19. Example Counting Side View S(1) S(2)
20. 20. Example Counting Matching 2 2 1 1 1 S(2) 1 1 1 1 1 S(1) F(5) F(4) F(3) F(2) F(1) F(i) * S(j) F(1) F(2) F(3) F(4) F(5) S(1) S(2) 5 7 12 Total
21. 21. Dynamic Programming
22. 22. Counting (5,4) with D.P. y x x+y 1 1 1 1 1 1 1 4 3 2 1 0 0 9 5 2 0 0 0 14 5 0 0 0 0 14 0 0 0 0 0
23. 23. Formula for three candidates
24. 24. Definition is the number of ways to count the ballot that correspond to the required condition Lemma 1.1 Lemma 1.2 Formula for three candidates
25. 25. Formula for three candidates Conjecture
26. 26. Let Consider Use strong induction; given is the “base” therefore Proof Hence, the base case is true. Formula for three candidates
27. 27. <ul><li>We assume that for some </li></ul><ul><li>all of the following are true; </li></ul>We will use this assumption to prove that is true Formula for three candidates
28. 28. Formula for three candidates
29. 29. By strong induction, we get that, Formula for three candidates
30. 30. Formula for n candidates
31. 31. is the number of ways to count the ballots of the n candidates such that, while the ballots are being counted, the winner will always get more ballots than the loser. Definition Lemma 3 Formula for n candidates
32. 32. (base) n=2 n=k Mathematical Induction Sub - Strong Mathematical Induction (base) n=k-1 Proof
33. 33. Formula for n candidates
34. 34. Formula for n candidates
35. 35. Formula for n candidates
36. 36. By mathematical induction, Formula for n candidates
37. 37. 1. Think about the condition “never less than” instead of “always more than.” Development 2. What if we suppose that the ballots of the 3 rd candidate don’t relate to anyone else?
38. 38. Application In Biology <ul><li>Lead to finding the number of random graph models for angiogenesis in the renal glomerulus. </li></ul><ul><li>Steps to form a vascular network </li></ul><ul><li>1. Budding </li></ul><ul><li>2. Spliting </li></ul><ul><li>3. Connecting </li></ul>
39. 39. Application In Cryptography Define the plaintext (code) used to send the data Increases the security of the system.
40. 40. Reference Chen Chuan-Chong and Koh Khee-Meng, Principles and Techniques in Combinatorics , World Scientific, 3rd ed., 1999. Marc Renault, Four Proofs of the Ballot Theorem, U.S.A., 2007. Michael L. GARGANO, Lorraine L. LURIE Louis V. QUINTAS, and Eric M. WAHL, The Ballot Problem, U.S.A.,2005. Miklos Bona, Unimodality, Introduction to Enumerative Combinatorics, McGrawHill, 2007. Sriram V. Pemmaraju, Steven S. Skienay, A System for Exploring Combinatorics and Graph Theory in Mathematica, U.S.A., 2004.
1. #### A particular slide catching your eye?

Clipping is a handy way to collect important slides you want to go back to later.