A note on the counterfeit coins problem
|
|
- Jayson Turner
- 5 years ago
- Views:
Transcription
1 A note on the counterfeit coins problem Li An-Ping Beijing , P.R.China Abstract In this paper, we will present an algorithm to resolve the counterfeit coins problem in the case that the number of false coins is unknown in advance. Keywords: counterfeit coins problem, combinatorial search, information theoretic bound.
2 The counterfeit coins problem is a well-known combinatorial search problem, namely, search for the counterfeit coins in a number of coins by a balance, where the fakes and the normals have same semblance but different weights. The problem has several versions, for instance, the fakes are known lighter or heavier than the normals, and the number of the fakes is assumed known. For the detail results and researches in these aspects refer to see the papers [1]~[6]. In this paper, we will consider a more general case that the number of the fakes is unknown beforehand. In general, it is assumed that the coins will be permitted to be remarked by numbers in order to be distinguished each other. Our main result is as following Proposition 1 Suppose that S is a set of n coins with same semblance, in which possibly there are some counterfeit coins, and the normals and the fakes have different weights. Denoted by gnthe ( ) least weighings need to sort S into the normals and fakes by a balance, then it has log (2 1) gn ( ) 7 n/11 n 3. (1) The proof of Proposition 1 will largely rely on the following lemma, which is one of our unpublished results obtained in Lemma 1 Let A be a set of 11 coins with two possible distinct weights, then A can be sorted by a balance with at most 7 weighings, and in the sixth weighing it will be found if A contains only one kind weight of coins. Proof. It will be suffice to provide a feasible algorithm for prove the lemma. We have succeeded such an algorithm, which sketch is provided as an appendix in the end of the paper, for to describe the whole algorithm require much more space. The readers are encouraged yet to design own algorithms for it as a puzzle. Proof of Proposition 1. The left-hand of (1) is trivial for the information theoretical bound of gn ( ) is equal to n log3 2, so we are provided to prove the right-hand of (1). It is easy to verified that the right-hand of (1) is true for n 11. Let n= 11 m+ r, S= A i, Ai = 11, 0 i< m, A m = r. 0 i m Applying Lemma 1 to each A i, i= 0,1,, m 1, and assume that there are t A i s that contains only one kind of coins, i.e. normals or fakes. Then by the induction, we have gn () 7( m t) + 6t+ 7/11 t + 7 r/11 7m t+ 7 t/ r/11 7m+ 7 r/11 7 n /11.
3 n Maybe, it should be mentioned that it is easy to know that log 3(2 1) = n log32 when a b n > 2, for the equation 2 1= 3 have just two integer solutions (1, 0) and (2,1). As the lower bound and upper bound of gnare ( ) much tighter, so we have following conjecture, Conjecture gn ( ) = n log 2. 3 (2) In addition, as an auxiliary result, there is a corollary of Lemma 1 Corollary 1 Let A i,1 i 11, be 11 sets of coins, each Ai consists of two coins, one is normal and one is fake, the normals and the fakes have distinct weights, then at most spend 7 weighings to find all the fakes in A i s, 1 i 11. Proof. From each A take a coin,1 i 11, to form a coin set A, applying Lemma 1 to A, i if there are two kinds of coins in A, then each A,1 i 11, will be sorted, otherwise, that is, i if A contains only one kind of coins, then a additional weighing will work well. Likely, there may be the algorithms independent of Lemma 1 for the result of Corollary 1, which will be left to the readers. Finally, we wish to acknowledge Hagen von Eitzen for his criticism and investigation. References [1] M. Aigner, Combinatorial Search. Wiley-Teubner 1988 [2] Anping Li, On the conjecture at two counterfeit coins, Disc. Math. 133 (1994), [3] Anping Li, Three counterfeit coins problem, J. Comb. Theory Ser. A, 66 (1994), [4] Anping Li, M. Aigner, Searching for counterfeit coins, Graphs Comb. 13 (1997), 9-20 [5] R. Bellman, B. Glass, On various versions of the defective coin problem. Inform. Control 4, (1961) [6] L. Pyber, How to find many counterfeit coins? Graphs Comb. 2, (1986)
4 Appendices I The Sketch of Algorithm to Sort 11 Coins We at first introduce some notations. The expression L : R means a comparison or a weighing with L and R are the left-hand and the right-hand of the balance respectively, and for simplicity, the expression {1,2,3} means the total weight of the coins with marks 1,2 and 3, and so on. Fig.22 (<) Fig.21 (=) {3,4,7,10 } :{1,2,6,11} (<) {5,7,9 } :{6,8,10 } (<) {1,7,8 } :{2,9,10} (<) {1,2,3 } :{4,5,6 } (>) (=) Fig.20 {2,9,11 } :{ 3,4,5} (=) Fig.19 Fig.18 Fig.17 Fig.16 (<) Fig.15 (=) {2,3,6} :{5,8,9} (<) {1,5,7,9}:{2,6,8,10} (=) (>) (=) Fig.14 {1,2,4} :{ 3,7,10} Fig.13 Fig.12 Fig.11 Fig.10 (<) Fig.9 (=) {1,5,6}:{2,3,7} (<) {7,9}:{8,10} (<) {1,7.8}:{ 4,9,10} (>) Fig.8 (=) Fig.7 (<) {5,7,10}:{ 6,8,9} (=) (=) Fig..6 Fig.5 (<) Fig.4 (=) {1,3,4}:{8,9,11} (<) {1,2,7}:{ 3,4,8} (>) Fig.3 (=) Fig.2 (<) {1,3 } :{ 2,4} (=) Fig.1 Fig. 0
5 ( 7,8,9,10) ( 1,4) {1 } :{2 } (=) {10 } :{ 11} (<) {1,2 } :{10,11 } (>) {1 } :{ 2} (=) {10 } :{11 } ( 11 ) ( 2,3,5,6) {1 } :{ 2} {10 } :{11 } (~) {10 } :{11 } Fig.1 {6}:{11} {10}:{ 11} {9 }:{10 } (=) {3,5 } :{1,11 } (<) {1 } :{7 } (>) {5,11 } :{6,9 } (=) {5 } :{ 6} {9}:{10} {10}:{11} { 5,11} :{6,9} {10}:{11} {9}:{10} {10}:{11} Fig.2 {5,9}:{7,10} { 6,9} :{ 7,10} { 10} :{11} (=) {1,9}:{8,11} (<) {5}:{6} (>) {1,9}:{8,11} (=) {10}:{11} {1}:{ 7} {1}:{7} {2} :{ 7} { 10} :{11} {1}:{3} { 9} :{11} Fig.3
6 { 2} :{ 3} { 2} :{3} {1}:{2} (=) {9}:{ 10} (<) {5 } :{6 } (>) {9 } :{10 } (=) {1 } :{ 2} {2}:{3} { 2} :{ 3} {9 } :{ 11} {3}:{ 10} {9}:{10} {3}:{ 4} Fig.4 {9}:{11} {7}:{ 8} {10}:{11} (=) {3,6}:{7,9} (<) {3,5}:{6,9} (>) {9}:{ 11} (=) { 2} :{10} {1,4}:{10,11} { 2} :{3} {9 } :{10} {2,10}:{3,11} {1}:{2} {2}:{11} Fig.5 {3}:{11} {2}:{11} {1}:{7} (=) {3,11}:{9,10} (<) { 2} :{3} (>) {2,11}:{9,10} (=) {1}:{7} {1}:{7} {1}:{7} {1,11 } :{2,3 } {1}:{11} {6}:{ 9} {1}:{11} Fig.6
7 {1}:{11} {1,4}:{10,11} {6}:{8} (=) {1,11}:{2,8} (<) {2,5}:{3,7} (>) {1,6}:{5,11} (=) { 6} :{8} {4,5}:{10,11} {5}:{11} {1,10} :{8,11} {8}:{11} {6}:{ 9} {2}:{11} Fig.7 {2,3}:{9, 11} {2,3}:{9,11} {9 } :{11} (=) {5,9 } :{6,11} (<) {2} :{3} (>) {5,9 } :{6,11} (=) {9 } :{11} {2,3}:{9,11} {2,3}:{9,11} {5,6} :{9,11} {9}:{ 11} {9}:{10} {9}:{11} Fig.8 {2,3}:{9,11} {2,3}:{9,11} {9 } :{11} (=) {5,9} :{6,11} (<) {2} :{3} (>) {5,9 } :{6,11} (=) {9 } :{11} {2,3}:{9,11} {2,3}:{9,11} {5,6} :{9,11} {9}:{ 11} {9}:{10} {9}:{11} Fig.9
8 {10}:{11} {10}:{11} {5}:{6} (=) {1,3,11}:{ 2,5,6} (<) {1,10} :{8,9} (>) {1,3,11} :{ 2,5,6} (=) {5 } :{6 } {5}:{6} {5}:{6} {1,3,11} :{ 2,5,6} {5}:{6} {5}:{6} {10}:{11} Fig.10 {1,11}:{3,4} {2}:{11} {2}:{11} (=) { 1,5} :{7,11} (<) {1,2}:{8,9} (>) { 1,10} :{2,11} (=) { 2} :{ 11} {2}:{4} {7}:{11} {1,2} :{10,11 } { 4} :{5} {3,4}:{ 6,7} {10}:{11} Fig.11 {8}:{11} {8}:{ 11} { 6} :{8} (=) {3,4}:{ 9,11} (<) {1}:{2} (>) {3,4}:{9,11} (=) {10}:{11} {8}:{11} { 8} :{11} {3,4} :{ 9,11} {8}:{11} {6}:{8} {8}:{11} Fig.12
9 {3,4}:{9,11} {9}:{11} {3}:{4} (=) {3,8}:{4,11} (<) {3,7,10}:{4,5,6} (>) {3,5}:{9,11} (=) { 3} :{4} {3,4}:{9,11} {9}:{11} {3,4} :{9,11} {9}:{11} { 3} :{5} {9}:{11} Fig.13 {7}:{11} {10}:{11} {2,4}:{5,6} (=) {2}:{10} (<) {3,5,10}:{7,9,11} (>) {2,8}:{ 10,11} (=) {1,3}:{7,8} {4}:{6} { 7} :{8} {2,4} :{10,11 } {1}:{3} {10}:{ 11} {3,4}:{7,8} Fig.14 {3}:{11} {1,11}:{4, 7} {10}:{ 11} (=) {5,11}:{7,9} (<) {2,5,9}:{3,4,7} (>) {1,4}:{7,11} (=) { 2} :{ 4} {5,9}:{7,11} {7}:{11} {2,9} :{3,11 } {3}:{11} { 10} :{11} {10}:{ 11} Fig.15
10 {3,4}:{5,6} {4}:{5} {2}:{ 3} (=) {1,5}:{ 7,11} (<) {1,6,11}:{3,7,10} (>) {5,10}:{2,11} (=) {1,4}:{5,6} {4}:{ 6} {4}:{6} {5} :{ 6} {4}:{6} {4}:{ 6} {4}:{ 11} Fig.16 {8}:{ 10} {1}:{8} {2}:{7} (=) {2,9}:{ 10,11} (<) {1,4,11}:{3,5,10} (>) {5,6}:{7,11} (=) {2,4}:{5,6} {7}:{ 8} {2,6}:{4,5} {7,9} :{8,11} {6}:{8} { 1} :{ 7} {2}:{11} Fig.17 {5}:{ 7} {1}:{7} {3}:{4} (=) {1,6}:{5,8} (<) {2,6,8}:{3,5,11} (>) {1,6}:{ 8,9} (=) {2}:{7} {2}:{8} {6}:{10} {4} :{ 9} {1}:{8} {10}:{11} {2}:{ 7} Fig.18
11 {3,11}:{4,10} { 1,2} :{3,11} {2}:{11} (=) {3,6}:{7,10} (<) {1,5,9} :{2,4,11} (>) {1,4} :{8,9 } (=) {2,5 } :{3,4 } {6}:{ 11} { 3} :{ 4} {1,4} :{2,6 } {8}:{10} {5}:{7} {2,4}:{3,8} Fig.19 {2}:{ 11} {2,3}:{4,8} {2}:{3} (=) { 8,9} :{3,11} (<) {1,5,6} :{4,7,11} (>) {2,4} :{3,9 } (=) {3 } :{9 } {3,6}:{4,9} {3,4}:{8,9} {8,9} :{6,11} {2,4}:{3,5} {2,4}:{ 3,5} {2}:{3} Fig.20 {5,6}:{7,8} { 8} :{10} {5}:{8} (=) {2,4}:{5,9} (<) {1,2} :{7,11} (>) {5} :{9 } (=) {6,7} :{8,9 } {3}:{8} {1}:{ 8} {2,8} :{7,10 } { 5} :{9} {5}:{9} {3,6}:{5,9} Fig.21
12 {6,7}:{ 8,9} {6,7}:{9,11} {6,7}:{8,9} (=) { 1,2} :{ 4,11} (<) {4,9}:{5,8} (>) {2,9}:{10,11} (=) {5,6}:{8,9} {2}:{9} {1}:{ 2} {1,6} :{ 8,11} {2}:{9} {1,2}:{6,7} {8}:{ 11} Fig.22 Where L> R, or L< R, or L= Rmeans L heavier than, or lighter than, or equal to R respectively, and the outputs (x), (a,b,c) and (~) means null, the coins with marks abc,, are heavier ones, and all coins have same weights respectively. The symmetric part of the algorithm has been omitted.
13 Appendices II An Alternative Algorithm to sort 11 coins The difference between the new and the previous one is mainly the Fig.1 to Fig.5 and the third weighing on the direction (=, =) in Fig.0, and the other keep unchanged. Fig.22 (<) Fig.21 (=) {3,4,7,10 } :{1,2,6,11} (<) {5,7,9 } :{6,8,10 } (<) {1,7,8 } :{2,9,10} (<) {1,2,3 } :{4,5,6 } (>) (=) Fig.20 {2,9,11 } :{ 3,4,5} (=) Fig.19 Fig.18 Fig.17 Fig.16 (<) Fig.15 (=) {2,3,6} :{5,8,9} (<) {1,5,7,9}:{2,6,8,10} (=) (>) (=) Fig.14 {1,2,4} :{ 3,7,10} Fig.13 Fig.12 Fig.11 Fig.10 (<) Fig.9 (=) {1,5,6}:{2,3,7} (<) {7,9}:{8,10} (<) {1,7.8}:{ 4,9,10} (>) Fig.8 (=) Fig.7 (<) {5,7,10}:{ 6,8,9} (=) (=) Fig..6 Fig.5 (<) Fig.4 (=) {1,9}:{4,10} (<) {2, 7 }:{ 3, 8} (>) Fig.3 (=) Fig.2 (<) {5} :{ 6} (=) Fig.1 Fig. 0
14 {2}:{3} {4}:{11} {1}:{ 11} (=) {4}:{5} (<) {1,11}:{7,8} (>) {4}:{5} (=) {1}:{ 11} {2}:{11} {2}:{3} {6} :{11 } { 2} :{ 3} (~) {2}:{ 3} Fig.1 {1}:{3} {1}:{ 2} {1}:{ 3} (=) {2,8}:{10,11} (<) {7,9}:{8,10} (>) {3,7}:{9,11} (=) {1}:{ 2} {10}:{11} {9}:{11} {7,10} :{4,11 } {1}:{11} { 1} :{2} {1}:{11} Fig.2 {5}:{ 6} {5}:{6} {5}:{6} (=) {3,5,6}:{2,8,11} (<) {1,4} :{2,8 } (>) {4,8} :{9,11 } (=) {5 } :{6} {9}:{11} {9}:{11} {2,11} :{ 7,10} { 5} :{6} {5}:{6} {9}:{11} Fig.3
15 {6}:{ 11} {6}:{7} {6}:{11} (=) {1,2}:{7,8} (<) {5,10} :{6,11 } (>) {1,4} :{ 7,11} (=) {1 } :{3 } {4}:{6} {10}:{11} {5} :{8} {4}:{ 6} (x) {4}:{6} Fig.4 {1}:{ 11} {4}:{ 11} {1}:{8} (=) {3,6}:{ 4,11} (<) {3,5}:{ 6,11} (>) {5,10}:{ 4,11} (=) { 1} :{2} {1}:{11} {4,10}:{5,11} {5,10} :{6,11 } { 6} :{11} {2}:{4} {2}:{4} Fig.5
A note on the counterfeit coins problem
A note on the counterfeit coins problem Li An-Ping Beijing 100085, P.R.China apli0001@sina.com Abstract In this paper, we will present an algorithm to resolve the counterfeit coins problem in the case
More informationAn improved lower-bound on the counterfeit coins problem
An mproved lower-bound on the counterfet cons problem L An-Png Bejng 100085, P.R. Chna apl0001@sna.com Hagen von Etzen hagen@von-etzen.de Abstract In ths paper, we wll gve an mprovement on the lower bound
More informationCoins with arbitrary weights. Abstract. Given a set of m coins out of a collection of coins of k unknown distinct weights, we wish to
Coins with arbitrary weights Noga Alon Dmitry N. Kozlov y Abstract Given a set of m coins out of a collection of coins of k unknown distinct weights, we wish to decide if all the m given coins have the
More informationJaegug Bae and Sungjin Choi
J. Korean Math. Soc. 40 (2003), No. 5, pp. 757 768 A GENERALIZATION OF A SUBSET-SUM-DISTINCT SEQUENCE Jaegug Bae and Sungjin Choi Abstract. In 1967, as an answer to the question of P. Erdös on a set of
More informationMinimum Number of Experiments. Geoff Galgon, Garrett Ervin
Minimum Number of Experiments Geoff Galgon, Garrett Ervin Abstract We give some examples of puzzles which are of the general form how few experiments are required to determine the unknown? We also discuss
More informationTHE MAXIMUM SIZE OF A PARTIAL 3-SPREAD IN A FINITE VECTOR SPACE OVER GF (2)
THE MAXIMUM SIZE OF A PARTIAL 3-SPREAD IN A FINITE VECTOR SPACE OVER GF (2) S. EL-ZANATI, H. JORDON, G. SEELINGER, P. SISSOKHO, AND L. SPENCE 4520 MATHEMATICS DEPARTMENT ILLINOIS STATE UNIVERSITY NORMAL,
More informationMonotone Hamiltonian paths in the Boolean lattice of subsets
Monotone Hamiltonian paths in the Boolean lattice of subsets Csaba Biró and David Howard December 10, 2007 Abstract Consider the lattice whose elements are the subsets of the set of positive integers not
More informationA Solution to the Checkerboard Problem
A Solution to the Checkerboard Problem Futaba Okamoto Mathematics Department, University of Wisconsin La Crosse, La Crosse, WI 5460 Ebrahim Salehi Department of Mathematical Sciences, University of Nevada
More informationLectures in Discrete Mathematics Math 1165 Professors Stanislav Molchanov and Harold Reiter
Lectures in Discrete Mathematics Math 1165 Professors Stanislav Molchanov and Harold Reiter Lecture 0 Introduction Discrete mathematics continues to be an important part of mathematics education at the
More informationSeparating Simple Domino Parity Inequalities
Separating Simple Domino Parity Inequalities Lisa Fleischer Adam Letchford Andrea Lodi DRAFT: IPCO submission Abstract In IPCO 2002, Letchford and Lodi describe an algorithm for separating simple comb
More informationSec$on Summary. Mathematical Proofs Forms of Theorems Trivial & Vacuous Proofs Direct Proofs Indirect Proofs
Section 1.7 Sec$on Summary Mathematical Proofs Forms of Theorems Trivial & Vacuous Proofs Direct Proofs Indirect Proofs Proof of the Contrapositive Proof by Contradiction 2 Proofs of Mathema$cal Statements
More informationProofs of Mathema-cal Statements. A proof is a valid argument that establishes the truth of a statement.
Section 1.7 Proofs of Mathema-cal Statements A proof is a valid argument that establishes the truth of a statement. Terminology A theorem is a statement that can be shown to be true using: definitions
More informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
More informationR(4,5) = 25. Stanis law P. Radziszowski JGT 19 (1995)
R(4,5) = 25 Brendan D. McKay + Department of Computer Science Australian National University GPO Box 4, ACT 2601, Australia bdm@cs.anu.edu.au Stanis law P. Radziszowski Department of Computer Science Rochester
More informationarxiv: v1 [math.co] 23 Sep 2016
Discreet Coin Weighings and the Sorting Strategy Tanya Khovanova Rafael M. Saavedra arxiv:1609.07466v1 [math.co] 23 Sep 2016 Abstract In 2007, Alexander Shapovalov posed an old twist on the classical coin
More informationFundamental Theorem of Finite Abelian Groups
Monica Agana Boise State University September 1, 2015 Theorem (Fundamental Theorem of Finite Abelian Groups) Every finite Abelian group is a direct product of cyclic groups of prime-power order. The number
More informationOn shredders and vertex connectivity augmentation
On shredders and vertex connectivity augmentation Gilad Liberman The Open University of Israel giladliberman@gmail.com Zeev Nutov The Open University of Israel nutov@openu.ac.il Abstract We consider the
More informationCS 350 Algorithms and Complexity
1 CS 350 Algorithms and Complexity Fall 2015 Lecture 15: Limitations of Algorithmic Power Introduction to complexity theory Andrew P. Black Department of Computer Science Portland State University Lower
More informationClimbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
More informationSome Results on the Counterfeit Coins Problem. Li An-Ping. Beijing , P.R.China Abstract
Some Results on the Counterfet Cons Problem L An-Png Bejng 100085, P.R.Chna apl0001@sna.om Abstrat We wll present some results on the ounterfet ons problem n the ase of mult-sets. Keywords: ombnatoral
More informationPath decompositions and Gallai s conjecture
Journal of Combinatorial Theory, Series B 93 (005) 117 15 www.elsevier.com/locate/jctb Path decompositions and Gallai s conjecture Genghua Fan Department of Mathematics, Fuzhou University, Fuzhou, Fujian
More informationCS 350 Algorithms and Complexity
CS 350 Algorithms and Complexity Winter 2019 Lecture 15: Limitations of Algorithmic Power Introduction to complexity theory Andrew P. Black Department of Computer Science Portland State University Lower
More informationClimbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
More informationYi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian , China (Submitted June 2002)
SELF-INVERSE SEQUENCES RELATED TO A BINOMIAL INVERSE PAIR Yi Wang Department of Applied Mathematics, Dalian University of Technology, Dalian 116024, China (Submitted June 2002) 1 INTRODUCTION Pairs of
More informationConstructive bounds for a Ramsey-type problem
Constructive bounds for a Ramsey-type problem Noga Alon Michael Krivelevich Abstract For every fixed integers r, s satisfying r < s there exists some ɛ = ɛ(r, s > 0 for which we construct explicitly an
More informationBetter bounds for k-partitions of graphs
Better bounds for -partitions of graphs Baogang Xu School of Mathematics, Nanjing Normal University 1 Wenyuan Road, Yadong New District, Nanjing, 1006, China Email: baogxu@njnu.edu.cn Xingxing Yu School
More informationOn the Dynamic Chromatic Number of Graphs
On the Dynamic Chromatic Number of Graphs Maryam Ghanbari Joint Work with S. Akbari and S. Jahanbekam Sharif University of Technology m_phonix@math.sharif.ir 1. Introduction Let G be a graph. A vertex
More informationThe Inductive Proof Template
CS103 Handout 24 Winter 2016 February 5, 2016 Guide to Inductive Proofs Induction gives a new way to prove results about natural numbers and discrete structures like games, puzzles, and graphs. All of
More information1111: Linear Algebra I
1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Lecture 1 Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Lecture 1 1 / 14 House rules 3 lectures on all odd weeks, 2 lectures and one tutorial on
More informationPlanar Ramsey Numbers for Small Graphs
Planar Ramsey Numbers for Small Graphs Andrzej Dudek Department of Mathematics and Computer Science Emory University Atlanta, GA 30322, USA Andrzej Ruciński Faculty of Mathematics and Computer Science
More informationMathematical Induction
Mathematical Induction MAT30 Discrete Mathematics Fall 018 MAT30 (Discrete Math) Mathematical Induction Fall 018 1 / 19 Outline 1 Mathematical Induction Strong Mathematical Induction MAT30 (Discrete Math)
More informationFree Subgroups of the Fundamental Group of the Hawaiian Earring
Journal of Algebra 219, 598 605 (1999) Article ID jabr.1999.7912, available online at http://www.idealibrary.com on Free Subgroups of the Fundamental Group of the Hawaiian Earring Katsuya Eda School of
More informationCIRCULAR CHROMATIC NUMBER AND GRAPH MINORS. Xuding Zhu 1. INTRODUCTION
TAIWANESE JOURNAL OF MATHEMATICS Vol. 4, No. 4, pp. 643-660, December 2000 CIRCULAR CHROMATIC NUMBER AND GRAPH MINORS Xuding Zhu Abstract. This paper proves that for any integer n 4 and any rational number
More informationLANDAU S THEOREM, FIELDS OF VALUES FOR CHARACTERS, AND SOLVABLE GROUPS arxiv: v1 [math.gr] 26 Jun 2015
LANDAU S THEOREM, FIELDS OF VALUES FOR CHARACTERS, AND SOLVABLE GROUPS arxiv:1506.08169v1 [math.gr] 26 Jun 2015 MARK L. LEWIS Abstract. When G is solvable group, we prove that the number of conjugacy classes
More informationTHE NUMBER OF POINTS IN A COMBINATORIAL GEOMETRY WITH NO 8-POINT-LINE MINORS
THE NUMBER OF POINTS IN A COMBINATORIAL GEOMETRY WITH NO 8-POINT-LINE MINORS JOSEPH E. BONIN AND JOSEPH P. S. KUNG ABSTRACT. We show that when n is greater than 3, the number of points in a combinatorial
More informationarxiv: v1 [quant-ph] 11 Mar 2016
The Asymptotics of Quantum Max-Flow Min-Cut Matthew B. Hastings 1 Station Q, Microsoft Research, Santa Barbara, CA 93106-6105, USA 2 Quantum Architectures and Computation Group, Microsoft Research, Redmond,
More informationErdős-Szekeres without induction
Erdős-Szekeres without induction arxiv:1509.03332v1 [math.co] 10 Sep 2015 Sergey Norin Yelena Yuditsky October 1, 2018 Abstract Let ES(n) be the minimal integer such that any set of ES(n) points in the
More informationOn the probability of satisfying a word in a group
arxiv:math/0504312v2 [math.gr] 3 May 2005 On the probability of satisfying a word in a group Miklós Abért February 1, 2008 Abstract We show that for any finite group G and for any d there exists a word
More informationGearing optimization
Gearing optimization V.V. Lozin Abstract We consider an optimization problem that arises in machine-tool design. It deals with optimization of the structure of gearbox, which is normally represented by
More informationSome remarks on the S-unit equation in function fields
ACTA ARITHMETICA LXIV.1 (1993) Some remarks on the S-unit equation in function fields by Umberto Zannier (Venezia) Introduction. Let k be an algebraically closed field of zero characteristic, K a function
More informationNew lower bounds for hypergraph Ramsey numbers
New lower bounds for hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1,..., N}, there
More informationSeries of Error Terms for Rational Approximations of Irrational Numbers
2 3 47 6 23 Journal of Integer Sequences, Vol. 4 20, Article..4 Series of Error Terms for Rational Approximations of Irrational Numbers Carsten Elsner Fachhochschule für die Wirtschaft Hannover Freundallee
More informationAsymptotic Counting Theorems for Primitive. Juggling Patterns
Asymptotic Counting Theorems for Primitive Juggling Patterns Erik R. Tou January 11, 2018 1 Introduction Juggling patterns are typically described using siteswap notation, which is based on the regular
More informationExample ( x.(p(x) Q(x))) ( x.p(x) x.q(x)) premise. 2. ( x.(p(x) Q(x))) -elim, 1 3. ( x.p(x) x.q(x)) -elim, x. P(x) x.
Announcements CS311H: Discrete Mathematics More Logic Intro to Proof Techniques Homework due next lecture Instructor: Işıl Dillig Instructor: Işıl Dillig, CS311H: Discrete Mathematics More Logic Intro
More information1 The Erdős Ko Rado Theorem
1 The Erdős Ko Rado Theorem A family of subsets of a set is intersecting if any two elements of the family have at least one element in common It is easy to find small intersecting families; the basic
More informationMATH 215 Final. M4. For all a, b in Z, a b = b a.
MATH 215 Final We will assume the existence of a set Z, whose elements are called integers, along with a well-defined binary operation + on Z (called addition), a second well-defined binary operation on
More informationCodegree problems for projective geometries
Codegree problems for projective geometries Peter Keevash Yi Zhao Abstract The codegree density γ(f ) of an r-graph F is the largest number γ such that there are F -free r-graphs G on n vertices such that
More informationMath 3000 Section 003 Intro to Abstract Math Homework 6
Math 000 Section 00 Intro to Abstract Math Homework 6 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 01 Solutions April, 01 Please note that these solutions are
More informationPowers of 2 with five distinct summands
ACTA ARITHMETICA * (200*) Powers of 2 with five distinct summands by Vsevolod F. Lev (Haifa) 0. Summary. We show that every sufficiently large, finite set of positive integers of density larger than 1/3
More informationGraphs with Large Variance
Graphs with Large Variance Yair Caro Raphael Yuster Abstract For a graph G, let V ar(g) denote the variance of the degree sequence of G, let sq(g) denote the sum of the squares of the degrees of G, and
More informationRainbow Hamilton cycles in uniform hypergraphs
Rainbow Hamilton cycles in uniform hypergraphs Andrzej Dude Department of Mathematics Western Michigan University Kalamazoo, MI andrzej.dude@wmich.edu Alan Frieze Department of Mathematical Sciences Carnegie
More information1111: Linear Algebra I
1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Lecture 1 Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Lecture 1 1 / 12 House rules 3 lectures on all odd weeks, 2 lectures and one tutorial on
More informationProperly colored Hamilton cycles in edge colored complete graphs
Properly colored Hamilton cycles in edge colored complete graphs N. Alon G. Gutin Dedicated to the memory of Paul Erdős Abstract It is shown that for every ɛ > 0 and n > n 0 (ɛ), any complete graph K on
More informationSubhypergraph counts in extremal and random hypergraphs and the fractional q-independence
Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence Andrzej Dudek adudek@emory.edu Andrzej Ruciński rucinski@amu.edu.pl June 21, 2008 Joanna Polcyn joaska@amu.edu.pl
More informationNOTE: You have 2 hours, please plan your time. Problems are not ordered by difficulty.
EXAM 2 solutions (COT3100, Sitharam, Spring 2017) NAME:last first: UF-ID Section NOTE: You have 2 hours, please plan your time. Problems are not ordered by difficulty. (1) Are the following functions one-to-one
More informationConvergence in shape of Steiner symmetrized line segments. Arthur Korneychuk
Convergence in shape of Steiner symmetrized line segments by Arthur Korneychuk A thesis submitted in conformity with the requirements for the degree of Master of Science Graduate Department of Mathematics
More informationTHE NUMBER OF PARTITIONS INTO DISTINCT PARTS MODULO POWERS OF 5
THE NUMBER OF PARTITIONS INTO DISTINCT PARTS MODULO POWERS OF 5 JEREMY LOVEJOY Abstract. We establish a relationship between the factorization of n+1 and the 5-divisibility of Q(n, where Q(n is the number
More informationFractional and circular 1-defective colorings of outerplanar graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 6() (05), Pages Fractional and circular -defective colorings of outerplanar graphs Zuzana Farkasová Roman Soták Institute of Mathematics Faculty of Science,
More informationUNAVOIDABLE INDUCED SUBGRAPHS IN LARGE GRAPHS WITH NO HOMOGENEOUS SETS
UNAVOIDABLE INDUCED SUBGRAPHS IN LARGE GRAPHS WITH NO HOMOGENEOUS SETS MARIA CHUDNOVSKY, RINGI KIM, SANG-IL OUM, AND PAUL SEYMOUR Abstract. An n-vertex graph is prime if it has no homogeneous set, that
More informationA CONSTRUCTION OF ARITHMETIC PROGRESSION-FREE SEQUENCES AND ITS ANALYSIS
A CONSTRUCTION OF ARITHMETIC PROGRESSION-FREE SEQUENCES AND ITS ANALYSIS BRIAN L MILLER & CHRIS MONICO TEXAS TECH UNIVERSITY Abstract We describe a particular greedy construction of an arithmetic progression-free
More informationOn p-blocks of symmetric and alternating groups with all irreducible Brauer characters of prime power degree. Christine Bessenrodt
On p-blocks of symmetric and alternating groups with all irreducible Brauer characters of prime power degree Christine Bessenrodt Institut für Algebra, Zahlentheorie und Diskrete Mathematik Leibniz Universität
More informationDecomposing dense bipartite graphs into 4-cycles
Decomposing dense bipartite graphs into 4-cycles Nicholas J. Cavenagh Department of Mathematics The University of Waikato Private Bag 3105 Hamilton 3240, New Zealand nickc@waikato.ac.nz Submitted: Jun
More informationSeries Editor KENNETH H. ROSEN INDUCTION THEORY AND APPLICATIONS. of Manitoba. University. Winnipeg, Canada. CRC Press. Taylor StFrancis Group
DISCIIETE MATHEMATICS AND ITS APPLICATIONS Series Editor KENNETH H. ROSEN HANDBOOK OF MATHEMATICAL INDUCTION THEORY AND APPLICATIONS David S. Gunderson University of Manitoba Winnipeg, Canada CRC Press
More informationApproximation Algorithms (Load Balancing)
July 6, 204 Problem Definition : We are given a set of n jobs {J, J 2,..., J n }. Each job J i has a processing time t i 0. We are given m identical machines. Problem Definition : We are given a set of
More informationMatchings in hypergraphs of large minimum degree
Matchings in hypergraphs of large minimum degree Daniela Kühn Deryk Osthus Abstract It is well known that every bipartite graph with vertex classes of size n whose minimum degree is at least n/2 contains
More information6 Permutations Very little of this section comes from PJE.
6 Permutations Very little of this section comes from PJE Definition A permutation (p147 of a set A is a bijection ρ : A A Notation If A = {a b c } and ρ is a permutation on A we can express the action
More informationZero-sum square matrices
Zero-sum square matrices Paul Balister Yair Caro Cecil Rousseau Raphael Yuster Abstract Let A be a matrix over the integers, and let p be a positive integer. A submatrix B of A is zero-sum mod p if the
More informationDiscrete Math I Exam II (2/9/12) Page 1
Discrete Math I Exam II (/9/1) Page 1 Name: Instructions: Provide all steps necessary to solve the problem. Simplify your answer as much as possible. Additionally, clearly indicate the value or expression
More informationMaximizing the number of independent sets of a fixed size
Maximizing the number of independent sets of a fixed size Wenying Gan Po-Shen Loh Benny Sudakov Abstract Let i t (G be the number of independent sets of size t in a graph G. Engbers and Galvin asked how
More informationUniquely identifying the edges of a graph: the edge metric dimension
Uniquely identifying the edges of a graph: the edge metric dimension Aleksander Kelenc (1), Niko Tratnik (1) and Ismael G. Yero (2) (1) Faculty of Natural Sciences and Mathematics University of Maribor,
More informationc 2010 Society for Industrial and Applied Mathematics
SIAM J. DISCRETE MATH. Vol. 24, No. 3, pp. 1038 1045 c 2010 Society for Industrial and Applied Mathematics SET SYSTEMS WITHOUT A STRONG SIMPLEX TAO JIANG, OLEG PIKHURKO, AND ZELEALEM YILMA Abstract. A
More informationReview. Propositions, propositional operators, truth tables. Logical Equivalences. Tautologies & contradictions
Review Propositions, propositional operators, truth tables Logical Equivalences. Tautologies & contradictions Some common logical equivalences Predicates & quantifiers Some logical equivalences involving
More informationThe Collatz Problem and Analogues
2 3 47 6 23 Journal of Integer Sequences, Vol. (2008), Article 08.4.7 The Collatz roblem and Analogues Bart Snapp and Matt Tracy Department of Mathematics and Statistics Coastal Carolina University Conway,
More informationMathematics for Decision Making: An Introduction. Lecture 13
Mathematics for Decision Making: An Introduction Lecture 13 Matthias Köppe UC Davis, Mathematics February 17, 2009 13 1 Reminder: Flows in networks General structure: Flows in networks In general, consider
More informationParity Dominating Sets in Grid Graphs
Parity Dominating Sets in Grid Graphs John L. Goldwasser and William F. Klostermeyer Dept. of Mathematics West Virginia University Morgantown, WV 26506 Dept. of Computer and Information Sciences University
More informationZero-Sum Flows in Regular Graphs
Zero-Sum Flows in Regular Graphs S. Akbari,5, A. Daemi 2, O. Hatami, A. Javanmard 3, A. Mehrabian 4 Department of Mathematical Sciences Sharif University of Technology Tehran, Iran 2 Department of Mathematics
More informationCHARACTER-FREE APPROACH TO PROGRESSION-FREE SETS
CHARACTR-FR APPROACH TO PROGRSSION-FR STS VSVOLOD F. LV Abstract. We present an elementary combinatorial argument showing that the density of a progression-free set in a finite r-dimensional vector space
More informationWieland drift for triangular fully packed loop configurations
Wieland drift for triangular fully packed loop configurations Sabine Beil Ilse Fischer Fakultät für Mathematik Universität Wien Wien, Austria {sabine.beil,ilse.fischer}@univie.ac.at Philippe Nadeau Institut
More informationRainbow Hamilton cycles in uniform hypergraphs
Rainbow Hamilton cycles in uniform hypergraphs Andrzej Dude Department of Mathematics Western Michigan University Kalamazoo, MI andrzej.dude@wmich.edu Alan Frieze Department of Mathematical Sciences Carnegie
More informationA lattice point problem and additive number theory
A lattice point problem and additive number theory Noga Alon and Moshe Dubiner Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More informationMath.3336: Discrete Mathematics. Proof Methods and Strategy
Math.3336: Discrete Mathematics Proof Methods and Strategy Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall
More information1 Definition of the Riemann integral
MAT337H1, Introduction to Real Analysis: notes on Riemann integration 1 Definition of the Riemann integral Definition 1.1. Let [a, b] R be a closed interval. A partition P of [a, b] is a finite set of
More informationNeighbor-distinguishing k-tuple edge-colorings of graphs
Neighbor-distinguishing k-tuple edge-colorings of graphs Jean-Luc Baril and Olivier Togni 1 LEI UMR-CNRS 5158, Université de Bourgogne B.P. 7 870, 1078 DIJON-Cedex France e-mail: {barjl,olivier.togni}@u-bourgogne.fr
More informationarxiv: v1 [math.co] 30 Nov 2016
Rounds in a combinatorial search problem arxiv:1611.10133v1 [math.co] 30 Nov 2016 Dániel Gerbner Máté Vizer MTA Rényi Institute Hungary H-1053, Budapest, Reáltanoda utca 13-15. gerbner@renyi.hu, vizermate@gmail.com
More informationResolving a conjecture on degree of regularity of linear homogeneous equations
Resolving a conjecture on degree of regularity of linear homogeneous equations Noah Golowich MIT-PRIMES, Department of Mathematics Massachusetts Institute of Technology Massachusetts, U.S.A. Submitted:
More informationReconstructibility of trees from subtree size frequencies
Stud. Univ. Babeş-Bolyai Math. 59(2014), No. 4, 435 442 Reconstructibility of trees from subtree size frequencies Dénes Bartha and Péter Burcsi Abstract. Let T be a tree on n vertices. The subtree frequency
More informationNew infinite families of Candelabra Systems with block size 6 and stem size 2
New infinite families of Candelabra Systems with block size 6 and stem size 2 Niranjan Balachandran Department of Mathematics The Ohio State University Columbus OH USA 4210 email:niranj@math.ohio-state.edu
More informationIndependent Transversals in r-partite Graphs
Independent Transversals in r-partite Graphs Raphael Yuster Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract Let G(r, n) denote
More informationA New Shuffle Convolution for Multiple Zeta Values
January 19, 2004 A New Shuffle Convolution for Multiple Zeta Values Ae Ja Yee 1 yee@math.psu.edu The Pennsylvania State University, Department of Mathematics, University Park, PA 16802 1 Introduction As
More informationSubsequence Sums of Zero-sum free Sequences II
Subsequence Sums of Zero-sum free Sequences II arxiv:0909.2080v2 [math.nt] 14 Sep 2009 Pingzhi Yuan School of Mathematics, South China Normal University, Guangzhou 510631, P.R.CHINA e-mail mcsypz@mail.sysu.edu.cn
More informationLinear independence, a unifying approach to shadow theorems
Linear independence, a unifying approach to shadow theorems by Peter Frankl, Rényi Institute, Budapest, Hungary Abstract The intersection shadow theorem of Katona is an important tool in extremal set theory.
More informationThis manuscript is for review purposes only.
1 2 3 4 5 6 7 8 9 10 LOLLIPOP AND LARIAT SYMMETRIC FUNCTIONS SAMANTHA DAHLBERG AND STEPHANIE VAN WILLIGENBURG Abstract. We compute an explicit e-positive formula for the chromatic symmetric function of
More informationAperiodic Subtraction Games
Aperiodic Subtraction Games Aviezri S. Fraenkel Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot 76100, Israel Submitted: 2011; Accepted: 2011; Published: XX
More informationPacking and decomposition of graphs with trees
Packing and decomposition of graphs with trees Raphael Yuster Department of Mathematics University of Haifa-ORANIM Tivon 36006, Israel. e-mail: raphy@math.tau.ac.il Abstract Let H be a tree on h 2 vertices.
More informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
More informationA diametric theorem for edges. R. Ahlswede and L.H. Khachatrian
A diametric theorem for edges R. Ahlswede and L.H. Khachatrian 1 1 Introduction Whereas there are vertex and edge isoperimetric theorems it went unsaid that diametric theorems are vertex diametric theorems.
More informationOn the intersection of infinite matroids
On the intersection of infinite matroids Elad Aigner-Horev Johannes Carmesin Jan-Oliver Fröhlich University of Hamburg 9 July 2012 Abstract We show that the infinite matroid intersection conjecture of
More informationThe Number of Non-Zero (mod k) Dominating Sets of Some Graphs
The Number of Non-Zero (mod k) Dominating Sets of Some Graphs Cheryl Jerozal The Pennsylvania State University University Park, PA, 16802 E-mail: pseudorandomcheryl@psu.edu William F. Klostermeyer Dept.
More informationOn a Conjecture of Thomassen
On a Conjecture of Thomassen Michelle Delcourt Department of Mathematics University of Illinois Urbana, Illinois 61801, U.S.A. delcour2@illinois.edu Asaf Ferber Department of Mathematics Yale University,
More information