A note on the counterfeit coins problem
|
|
- William Watkins
- 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 this subject refer to see the papers [1]~[7]. 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, which are heavier (or lighter) than the normals. Denoted by gnthe ( ) least number of weighings need to sort S into the normals and fakes by a balance, assumed that additional normal coins will be available if needed, then it has but with a exception that g (3) = 3. n log 2 g( n) 7 n/11, 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. Lemma 2. Let S be same as in Proposition 1, S= A B, B = 3. If there is a algorithm F with at most k weighings, k 1, to find all the fakes in A, then there is also a algorithm F to find all the fakes in S with at most k + 2 weighings. Proof. We apply the algorithm F on set A up to k 1 weighings. Let Γ be a non-empty output after k 1 weighings, clearly, Γ = 1,2,or 3. If Γ= 1, that is, Γ contains only one objective, and so which is the set of all the fakes in A, the rest we need to do is to find the fakes in set B, thus in this case, g( S ) k 1 + g(3) k+ 2.
3 If Γ= 2, suppose that Γ= { X, Y}, then there is one coin x x X(or Y) such that x Y(or X), let B = x B, it is easy to know we are provided to search for all the fakes in set B. On the other hand, it is not difficult to know that g (4) = 3, hence, g( S ) k 1 + g(4) k+ 2. If Γ= 3, suppose that Γ= { X, Y, Z}. If there are two of { X, Y, Z }, say, X and Y, such that X / Y Z and Y / X Z, then take x X \( Y Z) and y Y \( X Z). It is easy to know that which one of three objectives in the set Δ = {, xy, } is fakes will tell which of { X, YZ, } is the set of fakes in A. So it will be suffice to search all the fakes in sets Δ and B in three weighings, such an algorithm is described in Page 21. Thereby, assume that X Y Z and Y X Z. If there is no one of Z X and Z Y is contained in the other one, then take x ( Z X)\( Z Y), y ( Z Y)\( Z X). Similar to the above, which one of three objectives in the set Δ = {, x yx, y} is fakes will tell which of { X, Y, Z} is the set of fakes in A. We have to find all the fakes in sets Δ and B in three weighings. The algorithm is presented in Page 22. If ( Z X) ( Z Y), this implies that X Y. Moreover, from Y = X ( Z Y), it has ( Z Y) X. If X / ( Z Y), then take x X \( Z Y) and z ( Z Y)\ X, then Δ = {,, x zxz }, obviously, the case is similar to Δ. So, the rest to be discussed is X ( Z Y). From Y X Z, it has Y Z. Take y Y \ X and z Z \ Y, then which one of three objectives in the set Δ = { z y, y, } is fakes will tell which of { X, YZ, } is the set of fakes in A. We have to find all the fakes in sets Δ and B in three weighings. The sketch of such an algorithm has been shown in the page 23 of the appendices. 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 not difficult to verified that for n 11, 3 n, it has gn ( ) 7 n/11, and g (3) = 3. For
4 n > 11, let n= 11 m+ r, 0 r < 11, and r 3, by Lemma 1, there is S= A i, Ai = 11, 0 i< m, A m = r. If 0 i m gn ( ) 7m+ 7 r/11 7 n/11. If r = 3, by Lemma 1 and Lemma 2, it has gn ( ) 7m+ 2 7m+ 7 3/11 7 n/11. In the following, we will investigate the sorting case, that is, without provided of additional normal coins. Proposition 2. Suppose that S is a set of n coins with same semblance and with two possible distinct weights. Denoted by gn ( ) the least number of weighings needed to sort S in the weights by a balance, then it has log (2 1) gn ( ) 7 n/11. n 3 (2) To prove Proposition 2, it needs following initial result Lemma 3. For n 11, there is an algorithm with at most 7 n /11 and it will be found if all the coins in S are of same weight in the ( 7 n /11 1) except n = 3. weighings to sort S, -th weighing Proof. It is easy to verify the conclusions in the Lemma for n < 6 directly. Moreover, the required algorithm for n = 7 may be derived from the one for n = 6, and the algorithm for n = 8 may be derived from the one for n = 7. The required algorithm for n = 9 may be obtained from the algorithms for n = 6 and Lemma 2, the one for n = 10 may be derived from the one for n = 9. The case n = 11 is as in Lemma 1. So, the rest algorithm to be designed is the one for n = 6, such an algorithm is provided in the page 24. The Proof of Proposition 2. The lower bound of (2) is the information theoretic bound of gn ( ), so, to be proved is the upper bound of (2). With Lemma 3, we may assume that n > 11. Let n= 11 k+ r, 0 r < 11, and Denoted by 1 i k S = A B, A = 11,1 i k, B = r. 1 i k i i Q = A i, then by Lemma 1, we can spend at most 7k weighings to complete a sorting of the set Q, and if r 3, by Lemma 3, at most 7k+ 7 r/11 weighings will be
5 enough to complete a sorting of whole set S, hence gn ( ) 7k+ 7 r/11 = 7 n/11. So, the rest to be discussed is the case r = 3. With Lemma 2, it spends at most 7k + 2 weighings to complete a sorting of the set S, hence So, the proof is finished. gn ( ) 7k+ 2 = 7k+ 7 3/11 = 7 n/11. It maybe should be mentioned that in Lemma 2 the third algorithm we presented, that is the last one to deal with the case X Y Z, will need a normal coin, clearly which may be provided unless Z =Q, however, this case will not occur in applying the algorithm described in Lemma 1, for we will find whether the coins in set Q are of same weight by 7k 1( = 6k+ k 1) weighings if it is, so, the objective set Γ = { Q }, rather than Γ = { X, Y, Z}. In addition, as a derivative 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 by a balance 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. Acknowledgement: The author greatly appreciates Professor L. Lovasz for his endorsement for this paper, and many thanks to arxiv for publish it. Finally, the author should acknowledge Hagen von Eitzen for he had pointed out the flaws in the statement and the proof of Proposition 1 in the earlier versions, and told me the counter-example n = 19 for the conjecture gn ( ) = n log3 2 once proposed in the original version of this paper.
6 References [1] M. Aigner, Combinatorial Search. Wiley-Teubner 1988 [2] R. Bellman, B. Glass, On various versions of the defective coin problem. Inform. Control 4, (1961) [3] Richard K. Guy; Richard J. Nowakowski, Coin-Weighing Problems, The American Mathematical Monthly, Vol. 102, No. 2. (Feb., 1995), pp [4] A.P. Li, On the conjecture at two counterfeit coins, Disc. Math. 133 (1994), [5] A.P. Li, Three counterfeit coins problem, J. Comb. Theory Ser. A, 66 (1994), [6] A.P. Li, M. Aigner, Searching for counterfeit coins, Graphs Comb. 13 (1997), 9-20 [7] B. Manvel, Counterfeit coin problem, Math. Mag. 50, (1977) [8] L. Pyber, How to find many counterfeit coins? Graphs Comb. 2, (1986)
7 Appendices Algorithm to Sort 11 Coins 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
8 ( 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
9 { 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
10 {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
11 {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
12 {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
13 {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
14 {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
15 {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.
16 The second 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
17 {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
18 {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,10} (>) {5,10}:{ 4,11} (=) { 1} :{2} (<) (=) (<) {1}:{11} {4,10}:{5,11} {5,10} :{6,11 } (<) (=) (>) { 6} :{11} {2}:{4} {2}:{4} Fig.5
19 The third algorithm to sort 11 coins The difference between the third and the first one are in the Figs.3,4,5 and the 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 (=) {5,9}:{6,10} (<) {1,2,7}:{3,4,8} (>) Fig.3 (=) Fig.2 (<) {1,3} :{2,4} (=) Fig.1 Fig. 0
20 {5,6}:{ 10,11} {5,6}:{8,9} (>) (>) {1,3}:{2,8} (=) {3,10}:{4,11} (<) {1,4,9}:{3,7,11} (>) {3,11}:{7,9} (=) {2}:{11} (<) (=) (<) {5}:{7} {4,5}:{6,8} {1} :{2} (<) (=) (>) {6}:{7} {5}:{7} {5}:{7} Fig.3 {10}:{ 11} {10}:{11} (>) (>) {8}:{11} (=) {5}:{6} (<) {1}:{2} (>) {5}:{6} (=) {8}:{11} (<) (=) (<) {9}:{11} {9}:{11} {4,7} :{10,11} (<) (=) (>) {10}:{11} {4}:{6} {8}:{11} Fig.4 {5,6}:{10,11} {6,7}:{5,8} (>) (>) {1,3}:{2,8} (=) {3,9}:{4,11} (<) {1,4,10}:{3,7,11} (>) {3,11}:{7,10} (=) {2}:{11} (<) (=) (<) {6}:{7} {4,5}:{6,7} {1} :{2 } (<) (=) (>) { 5} :{7} {6}:{7} {6}:{7} Fig.5
21 Algorithm for Lemma 2 (1) b. b. y 2 3 (<) b. b (=) : bb b y (<) b : b b y (<) xb : yb 1 2 (>) b (=) (>) 2 b. y (<) : b b b : y (=) 1 (=) (>) (<) (=) (>) bbb... y b. y y bb.. y bbb (<) bb. (=) : y b (<) xb 3 : bb 1 2 (>) b. y (>) (=) 1 b (<) : b b y: b 2 (=) (>) (>) (=) (<) b. b. x bb.. y x. b Fig. A Δ= {, x, y}, B = { b1, b2, b3}. ~ := Null
22 Algorithm for Lemma 2 (2) b. y 3 (<) b. b. x. y (=) x : y (<) bb : bx (<) xb : yb (>) (=) (>) b. b. y (<) x : b bb : b x (=) (>) (<) (=) (>) (=) y b.. x y b. y bb.. y bb.. b. y (<). bb. xy. (=) : b b (<) xb 3 : bb 1 2 (>) b. y (=) (>) 1 bb.. y (<) x : y y: b (=) (>) (>) (=) (<) bb.. b. xy. b. x x. y b.. x y b. b. x Fig. B Δ= {, x yxy,.}, B = { b1, b2, b3}.
23 Algorithm for Lemma 2 (3) yb e : zb b y yb.. b (~) b bb. bbb (>) (=) (<) (>) (=) (<) (>) (=) (<) y: b be: bb yb. (>) (>) yb.. b (>) (>) yzb.. (=) y: z (=) yb : b b b : b bb : yz (=) yb : b b (=) yzb... b. b (<) (<) (~) (<) (>) (=) (<) (<) b 2 (~) (>) b : b : b b (<) yzb.. 2 (=) (<) : 3 y b z: b y: b (>) (=) 1 3 yb.. b b (>) (=) (<) (>) (=) (<) (>) (=) (<) yzb.. yzb... b yb yzb b bb. zy. yb.. b. b yb yzb b b. b 2 3 Fig. C Δ= {, yyz,. }, B = { b1, b2, b3}, e is a normal coin.
24 Algorithm g (6) = 4 in Lemma (<) 5.6 (=) { 2} :{3} (<) { 4} :{6} (<) {1,4}:{2,5} (<) {1,2,3}:{4,5,6} (>) (=) (>) {1,5 } :{ 2,3} (=) (<) (=) (>) (<) 6 (=) {2} :{3} (<) {1,5}:{3,6} (=) (>) (=) (>) (<) {3}:{6} {1} :{4} (=) (>) (<) (=) (>) ~ (<) (=) {1} :{2} (<) {3} :{6 } (<) {1,4 } :{ 2,5} (>) ~ (=) (>) ~ (<) {2}:{3} {2}:{3} (=) (=) (>) (<) (=) (>) ~ (<) 3.6 (=) {1}:{2} (<) {1,2,}:{3,6} (>) (=) (>) {1}:{2} (<) (=) (>) Fig. D
25 The completed list of weighings of the first algorithm to sort 11 coins The 1-th weighing w( ) = {1,2,3}:{4,5,6} The 2-th weighing w(0) = {1,7,8}:{4,9,10} w(1) = {1,7,8}:{2,9,10} w(2) = {1,7,8}:{2,9,10} The 3-th weighing w(0,0) = {1,2,7}:{3,4,8} w(1,0) = {1,5,7,9}:{2,6,8,10} w(2,0) = {1,5,7,9}:{2,6,8,10} w(0,1) = {7,9}:{8,10} w(1,1) = {5,7,9}:{6,8,10} w(2,1) = {5,7,9}:{6,8,10} w(0,2) = {7,9}:{8,10} w(1,2) = {5,7,9}:{6,8,10} w(2,2) = {5,7,9}:{6,8,10} The 4-th weighing w(0,0,0) = {1,3}:{2,4} w(1,0,0) = {1,2,4}:{3,7,10} w(2,0,0) = {1,2,4}:{3,7,10} w(0,1,0) = {5,7,10}:{6,8,9} w(1,1,0) = {2,9,11}:{3,4,5} w(2,1,0) = {1,7,11}:{3,4,5} w(0,2,0) = {5,7,10}:{6,8,9} w(1,2,0) = {1,7,11}:{3,4,5} w(2,2,0) = {2,9,11}:{3,4,5} w(0,0,1) = {1,3,4}:{8,9,11} w(1,0,1) = {2,3,6}:{5,8,9} w(2,0,1) = {1,3,5}:{6,8,9} w(0,1,1) = {1,5,6}:{2,3,7} w(1,1,1) = {3,4,7,10}:{1,2,6,11} w(2,1,1) = {3,4,7,10}:{1,2,5,11} w(0,2,1) = {1,5,6}:{2,3,8} w(1,2,1) = {3,4,8,9}:{1,2,6,11} w(2,2,1) = {3,4,8,9}:{1,2,5,11} w(0,0,2) = {1,3,4}:{8,9,11} w(1,0,2) = {1,3,5}:{6,8,9} w(2,0,2) = {2,3,6}:{5,8,9} w(0,1,2) = {1,5,6}:{2,3,8} w(1,1,2) = {3,4,8,9}:{1,2,5,11} w(2,1,2) = {3,4,8,9}:{1,2,6,11} w(0,2,2) = {1,5,6}:{2,3,7} w(1,2,2) = {3,4,7,10}:{1,2,5,11} w(2,2,2) = {3,4,7,10}:{1,2,6,11} The 5-th weighing w(0,0,0,0) = {1,2}:{10,11} w(1,0,0,0) = {1}:{2} w(2,0,0,0) = {1}:{2} w(0,1,0,0) = {2}:{3} w(1,1,0,0) = {2,6,8}:{3,5,11} w(2,1,0,0) = {1,6,10}:{3,5,11} w(0,2,0,0) = {2}:{3} w(1,2,0,0) = {1,6,10}:{3,5,11} w(2,2,0,0) = {2,6,8}:{3,5,11} w(0,0,1,0) = {5}:{6} w(1,0,1,0) = {2,5,9}:{3,4,7} w(2,0,1,0) = {1,6,8}:{3,4,10} w(0,1,1,0) = {2}:{3} w(1,1,1,0) = {1,2}:{7,11} w(2,1,1,0) = {1,2}:{10,11} w(0,2,1,0) = {2}:{3} w(1,2,1,0) = {1,2}:{9,11} w(2,2,1,0) = {1,2}:{8,11} w(0,0,2,0) = {5}:{6} w(1,0,2,0) = {1,6,8}:{3,4,10} w(2,0,2,0) = {2,5,9}:{3,4,7} w(0,1,2,0) = {2}:{3} w(1,1,2,0) = {1,2}:{8,11} w(2,1,2,0) = {1,2}:{9,11} w(0,2,2,0) = {2}:{3} w(1,2,2,0) = {1,2}:{10,11} w(2,2,2,0) = {1,2}:{7,11} w(0,0,0,1) = {1}:{7} w(1,0,0,1) = {3,7,10}:{4,5,6} w(2,0,0,1) = {1,2}:{8,9} w(0,1,0,1) = {2,5}:{3,7} w(1,1,0,1) = {1,5,9}:{2,4,11} w(2,1,0,1) = {2,4,11}:{3,5,8} w(0,2,0,1) = {2,6}:{3,8} w(1,2,0,1) = {2,5,7}:{1,4,11} w(2,2,0,1) = {1,4,11}:{3,5,10} w(0,0,1,1) = {3,5}:{6,9} w(1,0,1,1) = {1,6,11}:{3,7,10} w(2,0,1,1) = {3,6,7}:{8,10,11} w(0,1,1,1) = {1,10}:{8,9} w(1,1,1,1) = {4,9}:{5,8} w(2,1,1,1) = {2,5,6}:{4,10,11} w(0,2,1,1) = {2}:{3} w(1,2,1,1) = {4,7}:{5,10} w(2,2,1,1) = {1,5,6}:{4,8,11} w(0,0,2,1) = {5}:{6} w(1,0,2,1) = {2,5,11}:{3,7,10} w(2,0,2,1) = {3,5,10}:{7,9,11} w(0,1,2,1) = {1,9}:{7,10} w(1,1,2,1) = {4,10}:{6,7} w(2,1,2,1) = {2,5,6}:{4,9,11} w(0,2,2,1) = {2}:{3} w(1,2,2,1) = {4,8}:{6,9} w(2,2,2,1) = {1,5,6}:{4,7,11} w(0,0,0,2) = {1}:{7} w(1,0,0,2) = {1,2}:{8,9} w(2,0,0,2) = {3,7,10}:{4,5,6} w(0,1,0,2) = {2,6}:{3,8} w(1,1,0,2) = {1,4,11}:{3,5,10} w(2,1,0,2) = {2,5,7}:{1,4,11} w(0,2,0,2) = {2,5}:{3,7} w(1,2,0,2) = {2,4,11}:{3,5,8} w(2,2,0,2) = {1,5,9}:{2,4,11} w(0,0,1,2) = {5}:{6} w(1,0,1,2) = {3,5,10}:{7,9,11} w(2,0,1,2) = {2,5,11}:{3,7,10}
26 w(0,1,1,2) = {2}:{3} w(1,1,1,2) = {1,5,6}:{4,7,11} w(2,1,1,2) = {4,8}:{6,9} w(0,2,1,2) = {1,9}:{7,10} w(1,2,1,2) = {2,5,6}:{4,9,11} w(2,2,1,2) = {4,10}:{6,7} w(0,0,2,2) = {3,5}:{6,9} w(1,0,2,2) = {3,6,7}:{8,10,11} w(2,0,2,2) = {1,6,11}:{3,7,10} w(0,1,2,2) = {2}:{3} w(1,1,2,2) = {1,5,6}:{4,8,11} w(2,1,2,2) = {4,7}:{5,10} w(0,2,2,2) = {1,10}:{8,9} w(1,2,2,2) = {2,5,6}:{4,10,11} w(2,2,2,2) = {4,9}:{5,8} The 6-th weighing w(0,0,0,0,0) = {1}:{2} w(1,0,0,0,0) = {3,4}:{9,11} w(2,0,0,0,0) = {3,4}:{9,11} w(0,1,0,0,0) = {1,11}:{2,3} w(1,1,0,0,0) = {4}:{9} w(2,1,0,0,0) = {4}:{7} w(0,2,0,0,0) = {1,11}:{2,3} w(1,2,0,0,0) = {4}:{7} w(2,2,0,0,0) = {4}:{9} w(0,0,1,0,0) = {9}:{11} w(1,0,1,0,0) = {2,9}:{3,11} w(2,0,1,0,0) = {1,8}:{3,11} w(0,1,1,0,0) = {5,6}:{9,11} w(1,1,1,0,0) = {2,8}:{7,10} w(2,1,1,0,0) = {1,9}:{7,10} w(0,2,1,0,0) = {5,6}:{10,11} w(1,2,1,0,0) = {1,10}:{8,9} w(2,2,1,0,0) = {2,7}:{8,9} w(0,0,2,0,0) = {9}:{11} w(1,0,2,0,0) = {1,8}:{3,11} w(2,0,2,0,0) = {2,9}:{3,11} w(0,1,2,0,0) = {5,6}:{10,11} w(1,1,2,0,0) = {2,7}:{8,9} w(2,1,2,0,0) = {1,10}:{8,9} w(0,2,2,0,0) = {5,6}:{9,11} w(1,2,2,0,0) = {1,9}:{7,10} w(2,2,2,0,0) = {2,8}:{7,10} w(0,0,0,1,0) = {5,11}:{6,9} w(1,0,0,1,0) = {3,4}:{9,11} w(2,0,0,1,0) = {1,2}:{10,11} w(0,1,0,1,0) = {1,10}:{8,11} w(1,1,0,1,0) = {1,4}:{2,6} w(2,1,0,1,0) = {7,9}:{10,11} w(0,2,0,1,0) = {1,9}:{7,11} w(1,2,0,1,0) = {2,4}:{1,6} w(2,2,0,1,0) = {7,9}:{8,11} w(0,0,1,1,0) = {9}:{10} w(1,0,1,1,0) = {5}:{6} w(2,0,1,1,0) = {1,4}:{7,11} w(0,1,1,1,0) = {1,3,11}:{2,5,6} w(1,1,1,1,0) = {1,6}:{8,11} w(2,1,1,1,0) = {8,9}:{5,11} w(0,2,1,1,0) = {5,6}:{10,11} w(1,2,1,1,0) = {2,6}:{10,11} w(2,2,1,1,0) = {7,10}:{5,11} w(0,0,2,1,0) = {2}:{7} w(1,0,2,1,0) = {6}:{5} w(2,0,2,1,0) = {2,4}:{10,11} w(0,1,2,1,0) = {1,3,11}:{2,5,6} w(1,1,2,1,0) = {1,5}:{7,11} w(2,1,2,1,0) = {7,10}:{6,11} w(0,2,2,1,0) = {5,6}:{9,11} w(1,2,2,1,0) = {2,5}:{9,11} w(2,2,2,1,0) = {8,9}:{6,11} w(0,0,0,2,0) = {5,11}:{6,9} w(1,0,0,2,0) = {1,2}:{10,11} w(2,0,0,2,0) = {3,4}:{9,11} w(0,1,0,2,0) = {1,9}:{7,11} w(1,1,0,2,0) = {7,9}:{8,11} w(2,1,0,2,0) = {2,4}:{1,6} w(0,2,0,2,0) = {1,10}:{8,11} w(1,2,0,2,0) = {7,9}:{10,11} w(2,2,0,2,0) = {1,4}:{2,6} w(0,0,1,2,0) = {2}:{7} w(1,0,1,2,0) = {2,4}:{10,11} w(2,0,1,2,0) = {6}:{5} w(0,1,1,2,0) = {5,6}:{9,11} w(1,1,1,2,0) = {8,9}:{6,11} w(2,1,1,2,0) = {2,5}:{9,11} w(0,2,1,2,0) = {1,3,11}:{2,5,6} w(1,2,1,2,0) = {7,10}:{6,11} w(2,2,1,2,0) = {1,5}:{7,11} w(0,0,2,2,0) = {9}:{10} w(1,0,2,2,0) = {1,4}:{7,11} w(2,0,2,2,0) = {5}:{6} w(0,1,2,2,0) = {5,6}:{10,11} w(1,1,2,2,0) = {7,10}:{5,11} w(2,1,2,2,0) = {2,6}:{10,11} w(0,2,2,2,0) = {1,3,11}:{2,5,6} w(1,2,2,2,0) = {8,9}:{5,11} w(2,2,2,2,0) = {1,6}:{8,11} w(0,0,0,0,1) = {10}:{11} w(1,0,0,0,1) = {3,4}:{9,11} w(2,0,0,0,1) = {3,4}:{9,11} w(0,1,0,0,1) = {3,11}:{9,10} w(1,1,0,0,1) = {1,6}:{5,8} w(2,1,0,0,1) = {2,6}:{7,10} w(0,2,0,0,1) = {2,11}:{9,10} w(1,2,0,0,1) = {2,6}:{5,10} w(2,2,0,0,1) = {1,6}:{8,9} w(0,0,1,0,1) = {9}:{10} w(1,0,1,0,1) = {5,11}:{7,9} w(2,0,1,0,1) = {2,4}:{10,11} w(0,1,1,0,1) = {5,9}:{6,11} w(1,1,1,0,1) = {2,4}:{5,9} w(2,1,1,0,1) = {6}:{8} w(0,2,1,0,1) = {5,10}:{6,11} w(1,2,1,0,1) = {1,4}:{5,7} w(2,2,1,0,1) = {6}:{10} w(0,0,2,0,1) = {9}:{10} w(1,0,2,0,1) = {6,11}:{8,10} w(2,0,2,0,1) = {1,4}:{7,11} w(0,1,2,0,1) = {5,10}:{6,11} w(1,1,2,0,1) = {2,4}:{6,10} w(2,1,2,0,1) = {5}:{7} w(0,2,2,0,1) = {5,9}:{6,11} w(1,2,2,0,1) = {1,4}:{6,8} w(2,2,2,0,1) = {5}:{9} w(0,0,0,1,1) = {3,5}:{1,11} w(1,0,0,1,1) = {3,8}:{4,11} w(2,0,0,1,1) = {1,10}:{2,11} w(0,1,0,1,1) = {1,11}:{2,8} w(1,1,0,1,1) = {3,6}:{7,10} w(2,1,0,1,1) = {5,6}:{9,11}
27 w(0,2,0,1,1) = {1,5}:{6,11} w(1,2,0,1,1) = {3,6}:{8,9} w(2,2,0,1,1) = {5,6}:{7,11} w(0,0,1,1,1) = {3,6}:{7,9} w(1,0,1,1,1) = {1,5}:{7,11} w(2,0,1,1,1) = {1,9}:{7,11} w(0,1,1,1,1) = {1,3,11}:{2,5,6} w(1,1,1,1,1) = {1,2}:{4,11} w(2,1,1,1,1) = {1,4}:{3,8} w(0,2,1,1,1) = {5,10}:{6,11} w(1,2,1,1,1) = {1,2}:{4,11} w(2,2,1,1,1) = {2,4}:{3,10} w(0,0,2,1,1) = {1,9}:{8,11} w(1,0,2,1,1) = {2,6}:{10,11} w(2,0,2,1,1) = {2,8}:{10,11} w(0,1,2,1,1) = {1,3,11}:{2,5,6} w(1,1,2,1,1) = {1,2}:{4,11} w(2,1,2,1,1) = {1,4}:{3,7} w(0,2,2,1,1) = {5,9}:{6,11} w(1,2,2,1,1) = {1,2}:{4,11} w(2,2,2,1,1) = {2,4}:{3,9} w(0,0,0,2,1) = {5,11}:{6,9} w(1,0,0,2,1) = {1,5}:{7,11} w(2,0,0,2,1) = {3,5}:{9,11} w(0,1,0,2,1) = {1,11}:{2,7} w(1,1,0,2,1) = {2,9}:{10,11} w(2,1,0,2,1) = {2,4}:{7,10} w(0,2,0,2,1) = {1,6}:{5,11} w(1,2,0,2,1) = {1,7}:{8,11} w(2,2,0,2,1) = {1,4}:{8,9} w(0,0,1,2,1) = {1,9}:{8,11} w(1,0,1,2,1) = {2}:{10} w(2,0,1,2,1) = {6,7}:{1,11} w(0,1,1,2,1) = {5,9}:{6,11} w(1,1,1,2,1) = {8,9}:{3,11} w(2,1,1,2,1) = {1,8}:{7,11} w(0,2,1,2,1) = {1,3,11}:{2,5,6} w(1,2,1,2,1) = {7,10}:{3,11} w(2,2,1,2,1) = {2,10}:{9,11} w(0,0,2,2,1) = {9}:{11} w(1,0,2,2,1) = {1}:{7} w(2,0,2,2,1) = {5,10}:{2,11} w(0,1,2,2,1) = {5,10}:{6,11} w(1,1,2,2,1) = {7,10}:{3,11} w(2,1,2,2,1) = {1,7}:{8,11} w(0,2,2,2,1) = {1,3,11}:{2,5,6} w(1,2,2,2,1) = {8,9}:{3,11} w(2,2,2,2,1) = {2,9}:{10,11} w(0,0,0,0,2) = {10}:{11} w(1,0,0,0,2) = {3,4}:{9,11} w(2,0,0,0,2) = {3,4}:{9,11} w(0,1,0,0,2) = {2,11}:{9,10} w(1,1,0,0,2) = {1,6}:{8,9} w(2,1,0,0,2) = {2,6}:{5,10} w(0,2,0,0,2) = {3,11}:{9,10} w(1,2,0,0,2) = {2,6}:{7,10} w(2,2,0,0,2) = {1,6}:{5,8} w(0,0,1,0,2) = {9}:{10} w(1,0,1,0,2) = {1,4}:{7,11} w(2,0,1,0,2) = {6,11}:{8,10} w(0,1,1,0,2) = {5,9}:{6,11} w(1,1,1,0,2) = {5}:{9} w(2,1,1,0,2) = {1,4}:{6,8} w(0,2,1,0,2) = {5,10}:{6,11} w(1,2,1,0,2) = {5}:{7} w(2,2,1,0,2) = {2,4}:{6,10} w(0,0,2,0,2) = {9}:{10} w(1,0,2,0,2) = {2,4}:{10,11} w(2,0,2,0,2) = {5,11}:{7,9} w(0,1,2,0,2) = {5,10}:{6,11} w(1,1,2,0,2) = {6}:{10} w(2,1,2,0,2) = {1,4}:{5,7} w(0,2,2,0,2) = {5,9}:{6,11} w(1,2,2,0,2) = {6}:{8} w(2,2,2,0,2) = {2,4}:{5,9} w(0,0,0,1,2) = {5,11}:{6,9} w(1,0,0,1,2) = {3,5}:{9,11} w(2,0,0,1,2) = {1,5}:{7,11} w(0,1,0,1,2) = {1,6}:{5,11} w(1,1,0,1,2) = {1,4}:{8,9} w(2,1,0,1,2) = {1,7}:{8,11} w(0,2,0,1,2) = {1,11}:{2,7} w(1,2,0,1,2) = {2,4}:{7,10} w(2,2,0,1,2) = {2,9}:{10,11} w(0,0,1,1,2) = {9}:{11} w(1,0,1,1,2) = {5,10}:{2,11} w(2,0,1,1,2) = {1}:{7} w(0,1,1,1,2) = {1,3,11}:{2,5,6} w(1,1,1,1,2) = {2,9}:{10,11} w(2,1,1,1,2) = {8,9}:{3,11} w(0,2,1,1,2) = {5,10}:{6,11} w(1,2,1,1,2) = {1,7}:{8,11} w(2,2,1,1,2) = {7,10}:{3,11} w(0,0,2,1,2) = {1,9}:{8,11} w(1,0,2,1,2) = {6,7}:{1,11} w(2,0,2,1,2) = {2}:{10} w(0,1,2,1,2) = {1,3,11}:{2,5,6} w(1,1,2,1,2) = {2,10}:{9,11} w(2,1,2,1,2) = {7,10}:{3,11} w(0,2,2,1,2) = {5,9}:{6,11} w(1,2,2,1,2) = {1,8}:{7,11} w(2,2,2,1,2) = {8,9}:{3,11} w(0,0,0,2,2) = {3,5}:{1,11} w(1,0,0,2,2) = {1,10}:{2,11} w(2,0,0,2,2) = {3,8}:{4,11} w(0,1,0,2,2) = {1,5}:{6,11} w(1,1,0,2,2) = {5,6}:{7,11} w(2,1,0,2,2) = {3,6}:{8,9} w(0,2,0,2,2) = {1,11}:{2,8} w(1,2,0,2,2) = {5,6}:{9,11} w(2,2,0,2,2) = {3,6}:{7,10} w(0,0,1,2,2) = {1,9}:{8,11} w(1,0,1,2,2) = {2,8}:{10,11} w(2,0,1,2,2) = {2,6}:{10,11} w(0,1,1,2,2) = {5,9}:{6,11} w(1,1,1,2,2) = {2,4}:{3,9} w(2,1,1,2,2) = {1,2}:{4,11} w(0,2,1,2,2) = {1,3,11}:{2,5,6} w(1,2,1,2,2) = {1,4}:{3,7} w(2,2,1,2,2) = {1,2}:{4,11} w(0,0,2,2,2) = {3,6}:{7,9} w(1,0,2,2,2) = {1,9}:{7,11} w(2,0,2,2,2) = {1,5}:{7,11} w(0,1,2,2,2) = {5,10}:{6,11} w(1,1,2,2,2) = {2,4}:{3,10} w(2,1,2,2,2) = {1,2}:{4,11} w(0,2,2,2,2) = {1,3,11}:{2,5,6} w(1,2,2,2,2) = {1,4}:{3,8} w(2,2,2,2,2) = {1,2}:{4,11} The 7-th weighing
28 w(0,0,0,0,0,0) = {}:{} w(1,0,0,0,0,0) = {6}:{8} w(2,0,0,0,0,0) = {6}:{8} w(0,1,0,0,0,0) = {6}:{9} w(1,1,0,0,0,0) = {10}:{11} w(2,1,0,0,0,0) = {8}:{11} w(0,2,0,0,0,0) = {6}:{9} w(1,2,0,0,0,0) = {8}:{11} w(2,2,0,0,0,0) = {10}:{11} w(0,0,1,0,0,0) = {9}:{10} w(1,0,1,0,0,0) = {10}:{11} w(2,0,1,0,0,0) = {7}:{11} w(0,1,1,0,0,0) = {9}:{10} w(1,1,1,0,0,0) = {5}:{9} w(2,1,1,0,0,0) = {6}:{8} w(0,2,1,0,0,0) = {10}:{9} w(1,2,1,0,0,0) = {5}:{7} w(2,2,1,0,0,0) = {6}:{10} w(0,0,2,0,0,0) = {9}:{10} w(1,0,2,0,0,0) = {7}:{11} w(2,0,2,0,0,0) = {10}:{11} w(0,1,2,0,0,0) = {10}:{9} w(1,1,2,0,0,0) = {6}:{10} w(2,1,2,0,0,0) = {5}:{7} w(0,2,2,0,0,0) = {9}:{10} w(1,2,2,0,0,0) = {6}:{8} w(2,2,2,0,0,0) = {5}:{9} w(0,0,0,1,0,0) = {9}:{10} w(1,0,0,1,0,0) = {3}:{5} w(2,0,0,1,0,0) = {3,4}:{6,7} w(0,1,0,1,0,0) = {6}:{9} w(1,1,0,1,0,0) = {5}:{7} w(2,1,0,1,0,0) = {2}:{9} w(0,2,0,1,0,0) = {5}:{10} w(1,2,0,1,0,0) = {5}:{9} w(2,2,0,1,0,0) = {1}:{7} w(0,0,1,1,0,0) = {1}:{2} w(1,0,1,1,0,0) = {4}:{6} w(2,0,1,1,0,0) = {7}:{11} w(0,1,1,1,0,0) = {5}:{6} w(1,1,1,1,0,0) = {1,2}:{6,7} w(2,1,1,1,0,0) = {1,4}:{3,6} w(0,2,1,1,0,0) = {10}:{9} w(1,2,1,1,0,0) = {1,2}:{6,9} w(2,2,1,1,0,0) = {2,4}:{3,6} w(0,0,2,1,0,0) = {1}:{3} w(1,0,2,1,0,0) = {4}:{5} w(2,0,2,1,0,0) = {10}:{11} w(0,1,2,1,0,0) = {5}:{6} w(1,1,2,1,0,0) = {1,2}:{5,8} w(2,1,2,1,0,0) = {1,4}:{3,5} w(0,2,2,1,0,0) = {9}:{10} w(1,2,2,1,0,0) = {1,2}:{5,10} w(2,2,2,1,0,0) = {2,4}:{3,5} w(0,0,0,2,0,0) = {9}:{10} w(1,0,0,2,0,0) = {3,4}:{6,7} w(2,0,0,2,0,0) = {3}:{5} w(0,1,0,2,0,0) = {5}:{10} w(1,1,0,2,0,0) = {1}:{7} w(2,1,0,2,0,0) = {5}:{9} w(0,2,0,2,0,0) = {6}:{9} w(1,2,0,2,0,0) = {2}:{9} w(2,2,0,2,0,0) = {5}:{7} w(0,0,1,2,0,0) = {1}:{3} w(1,0,1,2,0,0) = {10}:{11} w(2,0,1,2,0,0) = {4}:{5} w(0,1,1,2,0,0) = {9}:{10} w(1,1,1,2,0,0) = {2,4}:{3,5} w(2,1,1,2,0,0) = {1,2}:{5,10} w(0,2,1,2,0,0) = {5}:{6} w(1,2,1,2,0,0) = {1,4}:{3,5} w(2,2,1,2,0,0) = {1,2}:{5,8} w(0,0,2,2,0,0) = {1}:{2} w(1,0,2,2,0,0) = {7}:{11} w(2,0,2,2,0,0) = {4}:{6} w(0,1,2,2,0,0) = {10}:{9} w(1,1,2,2,0,0) = {2,4}:{3,6} w(2,1,2,2,0,0) = {1,2}:{6,9} w(0,2,2,2,0,0) = {5}:{6} w(1,2,2,2,0,0) = {1,4}:{3,6} w(2,2,2,2,0,0) = {1,2}:{6,7} w(0,0,0,0,1,0) = {1}:{2} w(1,0,0,0,1,0) = {6}:{8} w(2,0,0,0,1,0) = {10}:{11} w(0,1,0,0,1,0) = {1}:{7} w(1,1,0,0,1,0) = {3}:{4} w(2,1,0,0,1,0) = {1}:{9} w(0,2,0,0,1,0) = {1}:{7} w(1,2,0,0,1,0) = {3}:{4} w(2,2,0,0,1,0) = {2}:{7} w(0,0,1,0,1,0) = {1}:{2} w(1,0,1,0,1,0) = {10}:{11} w(2,0,1,0,1,0) = {1}:{4} w(0,1,1,0,1,0) = {9}:{11} w(1,1,1,0,1,0) = {5}:{8} w(2,1,1,0,1,0) = {5,10}:{8,9} w(0,2,1,0,1,0) = {10}:{11} w(1,2,1,0,1,0) = {5}:{10} w(2,2,1,0,1,0) = {5,8}:{7,10} w(0,0,2,0,1,0) = {1}:{2} w(1,0,2,0,1,0) = {7}:{11} w(2,0,2,0,1,0) = {2}:{4} w(0,1,2,0,1,0) = {10}:{11} w(1,1,2,0,1,0) = {6}:{7} w(2,1,2,0,1,0) = {6,9}:{7,10} w(0,2,2,0,1,0) = {9}:{11} w(1,2,2,0,1,0) = {6}:{9} w(2,2,2,0,1,0) = {6,7}:{8,9} w(0,0,0,1,1,0) = {9}:{10} w(1,0,0,1,1,0) = {3}:{4} w(2,0,0,1,1,0) = {2}:{11} w(0,1,0,1,1,0) = {6}:{8} w(1,1,0,1,1,0) = {2}:{11} w(2,1,0,1,1,0) = {1,4}:{5,6} w(0,2,0,1,1,0) = {5}:{7} w(1,2,0,1,1,0) = {1}:{11} w(2,2,0,1,1,0) = {2,4}:{5,6} w(0,0,1,1,1,0) = {10}:{11} w(1,0,1,1,1,0) = {2}:{3} w(2,0,1,1,1,0) = {2,3}:{9,10} w(0,1,1,1,1,0) = {5}:{6} w(1,1,1,1,1,0) = {6,7}:{8,9} w(2,1,1,1,1,0) = {3}:{8} w(0,2,1,1,1,0) = {10}:{11} w(1,2,1,1,1,0) = {6,9}:{7,10} w(2,2,1,1,1,0) = {3}:{10} w(0,0,2,1,1,0) = {10}:{11} w(1,0,2,1,1,0) = {1}:{3} w(2,0,2,1,1,0) = {1,3}:{7,8} w(0,1,2,1,1,0) = {5}:{6} w(1,1,2,1,1,0) = {5,8}:{7,10} w(2,1,2,1,1,0) = {3}:{7}
29 w(0,2,2,1,1,0) = {9}:{11} w(1,2,2,1,1,0) = {5,10}:{8,9} w(2,2,2,1,1,0) = {3}:{9} w(0,0,0,2,1,0) = {5}:{6} w(1,0,0,2,1,0) = {2}:{11} w(2,0,0,2,1,0) = {3}:{4} w(0,1,0,2,1,0) = {5}:{7} w(1,1,0,2,1,0) = {2}:{7} w(2,1,0,2,1,0) = {1,5}:{3,4} w(0,2,0,2,1,0) = {6}:{8} w(1,2,0,2,1,0) = {1}:{9} w(2,2,0,2,1,0) = {2,5}:{3,4} w(0,0,1,2,1,0) = {10}:{11} w(1,0,1,2,1,0) = {2,4}:{5,6} w(2,0,1,2,1,0) = {2,4}:{5,6} w(0,1,1,2,1,0) = {9}:{11} w(1,1,1,2,1,0) = {2}:{3} w(2,1,1,2,1,0) = {5,6}:{8,9} w(0,2,1,2,1,0) = {5}:{6} w(1,2,1,2,1,0) = {1}:{3} w(2,2,1,2,1,0) = {5,6}:{7,10} w(0,0,2,2,1,0) = {2}:{10} w(1,0,2,2,1,0) = {1,4}:{5,6} w(2,0,2,2,1,0) = {1,4}:{5,6} w(0,1,2,2,1,0) = {10}:{11} w(1,1,2,2,1,0) = {2}:{3} w(2,1,2,2,1,0) = {5,6}:{7,10} w(0,2,2,2,1,0) = {5}:{6} w(1,2,2,2,1,0) = {1}:{3} w(2,2,2,2,1,0) = {5,6}:{8,9} w(0,0,0,0,2,0) = {1}:{2} w(1,0,0,0,2,0) = {10}:{11} w(2,0,0,0,2,0) = {6}:{8} w(0,1,0,0,2,0) = {1}:{7} w(1,1,0,0,2,0) = {2}:{7} w(2,1,0,0,2,0) = {3}:{4} w(0,2,0,0,2,0) = {1}:{7} w(1,2,0,0,2,0) = {1}:{9} w(2,2,0,0,2,0) = {3}:{4} w(0,0,1,0,2,0) = {1}:{2} w(1,0,1,0,2,0) = {2}:{4} w(2,0,1,0,2,0) = {7}:{11} w(0,1,1,0,2,0) = {9}:{11} w(1,1,1,0,2,0) = {6,7}:{8,9} w(2,1,1,0,2,0) = {6}:{9} w(0,2,1,0,2,0) = {10}:{11} w(1,2,1,0,2,0) = {6,9}:{7,10} w(2,2,1,0,2,0) = {6}:{7} w(0,0,2,0,2,0) = {1}:{2} w(1,0,2,0,2,0) = {1}:{4} w(2,0,2,0,2,0) = {10}:{11} w(0,1,2,0,2,0) = {10}:{11} w(1,1,2,0,2,0) = {5,8}:{7,10} w(2,1,2,0,2,0) = {5}:{10} w(0,2,2,0,2,0) = {9}:{11} w(1,2,2,0,2,0) = {5,10}:{8,9} w(2,2,2,0,2,0) = {5}:{8} w(0,0,0,1,2,0) = {5}:{6} w(1,0,0,1,2,0) = {3}:{4} w(2,0,0,1,2,0) = {2}:{11} w(0,1,0,1,2,0) = {6}:{8} w(1,1,0,1,2,0) = {2,5}:{3,4} w(2,1,0,1,2,0) = {1}:{9} w(0,2,0,1,2,0) = {5}:{7} w(1,2,0,1,2,0) = {1,5}:{3,4} w(2,2,0,1,2,0) = {2}:{7} w(0,0,1,1,2,0) = {2}:{10} w(1,0,1,1,2,0) = {1,4}:{5,6} w(2,0,1,1,2,0) = {1,4}:{5,6} w(0,1,1,1,2,0) = {5}:{6} w(1,1,1,1,2,0) = {5,6}:{8,9} w(2,1,1,1,2,0) = {1}:{3} w(0,2,1,1,2,0) = {10}:{11} w(1,2,1,1,2,0) = {5,6}:{7,10} w(2,2,1,1,2,0) = {2}:{3} w(0,0,2,1,2,0) = {10}:{11} w(1,0,2,1,2,0) = {2,4}:{5,6} w(2,0,2,1,2,0) = {2,4}:{5,6} w(0,1,2,1,2,0) = {5}:{6} w(1,1,2,1,2,0) = {5,6}:{7,10} w(2,1,2,1,2,0) = {1}:{3} w(0,2,2,1,2,0) = {9}:{11} w(1,2,2,1,2,0) = {5,6}:{8,9} w(2,2,2,1,2,0) = {2}:{3} w(0,0,0,2,2,0) = {9}:{10} w(1,0,0,2,2,0) = {2}:{11} w(2,0,0,2,2,0) = {3}:{4} w(0,1,0,2,2,0) = {5}:{7} w(1,1,0,2,2,0) = {2,4}:{5,6} w(2,1,0,2,2,0) = {1}:{11} w(0,2,0,2,2,0) = {6}:{8} w(1,2,0,2,2,0) = {1,4}:{5,6} w(2,2,0,2,2,0) = {2}:{11} w(0,0,1,2,2,0) = {10}:{11} w(1,0,1,2,2,0) = {1,3}:{7,8} w(2,0,1,2,2,0) = {1}:{3} w(0,1,1,2,2,0) = {9}:{11} w(1,1,1,2,2,0) = {3}:{9} w(2,1,1,2,2,0) = {5,10}:{8,9} w(0,2,1,2,2,0) = {5}:{6} w(1,2,1,2,2,0) = {3}:{7} w(2,2,1,2,2,0) = {5,8}:{7,10} w(0,0,2,2,2,0) = {10}:{11} w(1,0,2,2,2,0) = {2,3}:{9,10} w(2,0,2,2,2,0) = {2}:{3} w(0,1,2,2,2,0) = {10}:{11} w(1,1,2,2,2,0) = {3}:{10} w(2,1,2,2,2,0) = {6,9}:{7,10} w(0,2,2,2,2,0) = {5}:{6} w(1,2,2,2,2,0) = {3}:{8} w(2,2,2,2,2,0) = {6,7}:{8,9} w(0,0,0,0,0,1) = {10}:{11} w(1,0,0,0,0,1) = {8}:{11} w(2,0,0,0,0,1) = {8}:{11} w(0,1,0,0,0,1) = {1}:{11} w(1,1,0,0,0,1) = {1}:{8} w(2,1,0,0,0,1) = {1}:{9} w(0,2,0,0,0,1) = {1}:{11} w(1,2,0,0,0,1) = {2}:{10} w(2,2,0,0,0,1) = {2}:{7} w(0,0,1,0,0,1) = {3}:{10} w(1,0,1,0,0,1) = {3}:{11} w(2,0,1,0,0,1) = {7}:{11} w(0,1,1,0,0,1) = {9}:{11} w(1,1,1,0,0,1) = {5}:{9} w(2,1,1,0,0,1) = {3,5}:{6,8} w(0,2,1,0,0,1) = {10}:{11} w(1,2,1,0,0,1) = {5}:{7} w(2,2,1,0,0,1) = {3,5}:{6,10} w(0,0,2,0,0,1) = {3}:{4} w(1,0,2,0,0,1) = {3}:{11} w(2,0,2,0,0,1) = {10}:{11}
30 w(0,1,2,0,0,1) = {10}:{11} w(1,1,2,0,0,1) = {6}:{10} w(2,1,2,0,0,1) = {3,6}:{5,7} w(0,2,2,0,0,1) = {9}:{11} w(1,2,2,0,0,1) = {6}:{8} w(2,2,2,0,0,1) = {3,6}:{5,9} w(0,0,0,1,0,1) = {10}:{11} w(1,0,0,1,0,1) = {9}:{11} w(2,0,0,1,0,1) = {10}:{11} w(0,1,0,1,0,1) = {8}:{11} w(1,1,0,1,0,1) = {8}:{10} w(2,1,0,1,0,1) = {1}:{11} w(0,2,0,1,0,1) = {2}:{11} w(1,2,0,1,0,1) = {10}:{8} w(2,2,0,1,0,1) = {2}:{11} w(0,0,1,1,0,1) = {2,10}:{3,11} w(1,0,1,1,0,1) = {4}:{6} w(2,0,1,1,0,1) = {3,4}:{9,10} w(0,1,1,1,0,1) = {5}:{6} w(1,1,1,1,0,1) = {2}:{9} w(2,1,1,1,0,1) = {1}:{3} w(0,2,1,1,0,1) = {10}:{11} w(1,2,1,1,0,1) = {1}:{7} w(2,2,1,1,0,1) = {2}:{3} w(0,0,2,1,0,1) = {9}:{11} w(1,0,2,1,0,1) = {4}:{5} w(2,0,2,1,0,1) = {3,4}:{7,8} w(0,1,2,1,0,1) = {5}:{6} w(1,1,2,1,0,1) = {2}:{10} w(2,1,2,1,0,1) = {1}:{3} w(0,2,2,1,0,1) = {9}:{11} w(1,2,2,1,0,1) = {1}:{8} w(2,2,2,1,0,1) = {2}:{3} w(0,0,0,2,0,1) = {10}:{11} w(1,0,0,2,0,1) = {4}:{5} w(2,0,0,2,0,1) = {9}:{11} w(0,1,0,2,0,1) = {7}:{11} w(1,1,0,2,0,1) = {6}:{8} w(2,1,0,2,0,1) = {1,4}:{3,10} w(0,2,0,2,0,1) = {2}:{11} w(1,2,0,2,0,1) = {6}:{10} w(2,2,0,2,0,1) = {2,4}:{3,8} w(0,0,1,2,0,1) = {10}:{11} w(1,0,1,2,0,1) = {1}:{3} w(2,0,1,2,0,1) = {4}:{11} w(0,1,1,2,0,1) = {9}:{11} w(1,1,1,2,0,1) = {2,4}:{3,5} w(2,1,1,2,0,1) = {9}:{11} w(0,2,1,2,0,1) = {9}:{11} w(1,2,1,2,0,1) = {1,4}:{3,5} w(2,2,1,2,0,1) = {7}:{11} w(0,0,2,2,0,1) = {2}:{11} w(1,0,2,2,0,1) = {2}:{3} w(2,0,2,2,0,1) = {4}:{11} w(0,1,2,2,0,1) = {10}:{11} w(1,1,2,2,0,1) = {2,4}:{3,6} w(2,1,2,2,0,1) = {10}:{11} w(0,2,2,2,0,1) = {10}:{11} w(1,2,2,2,0,1) = {1,4}:{3,6} w(2,2,2,2,0,1) = {8}:{11} w(0,0,0,0,1,1) = {}:{} w(1,0,0,0,1,1) = {8}:{11} w(2,0,0,0,1,1) = {8}:{11} w(0,1,0,0,1,1) = {1}:{7} w(1,1,0,0,1,1) = {2}:{8} w(2,1,0,0,1,1) = {2}:{9} w(0,2,0,0,1,1) = {2}:{11} w(1,2,0,0,1,1) = {1}:{10} w(2,2,0,0,1,1) = {1}:{7} w(0,0,1,0,1,1) = {2}:{3} w(1,0,1,0,1,1) = {5,9}:{7,11} w(2,0,1,0,1,1) = {2,11}:{4,10} w(0,1,1,0,1,1) = {2,3}:{9,11} w(1,1,1,0,1,1) = {3}:{8} w(2,1,1,0,1,1) = {9}:{7} w(0,2,1,0,1,1) = {2,3}:{10,11} w(1,2,1,0,1,1) = {3}:{10} w(2,2,1,0,1,1) = {7}:{9} w(0,0,2,0,1,1) = {2}:{3} w(1,0,2,0,1,1) = {6,8}:{10,11} w(2,0,2,0,1,1) = {1,11}:{4,7} w(0,1,2,0,1,1) = {2,3}:{10,11} w(1,1,2,0,1,1) = {3}:{7} w(2,1,2,0,1,1) = {10}:{8} w(0,2,2,0,1,1) = {2,3}:{9,11} w(1,2,2,0,1,1) = {3}:{9} w(2,2,2,0,1,1) = {8}:{10} w(0,0,0,1,1,1) = {9}:{10} w(1,0,0,1,1,1) = {3,4}:{9,11} w(2,0,0,1,1,1) = {2}:{11} w(0,1,0,1,1,1) = {4,5}:{10,11} w(1,1,0,1,1,1) = {6}:{11} w(2,1,0,1,1,1) = {2}:{10} w(0,2,0,1,1,1) = {1,4}:{9,11} w(1,2,0,1,1,1) = {6}:{11} w(2,2,0,1,1,1) = {1}:{8} w(0,0,1,1,1,1) = {1,4}:{10,11} w(1,0,1,1,1,1) = {4}:{6} w(2,0,1,1,1,1) = {7}:{11} w(0,1,1,1,1,1) = {5}:{6} w(1,1,1,1,1,1) = {2}:{9} w(2,1,1,1,1,1) = {1,3}:{4,9} w(0,2,1,1,1,1) = {2,3}:{10,11} w(1,2,1,1,1,1) = {1}:{7} w(2,2,1,1,1,1) = {2,3}:{4,7} w(0,0,2,1,1,1) = {6,9}:{7,10} w(1,0,2,1,1,1) = {4}:{5} w(2,0,2,1,1,1) = {10}:{11} w(0,1,2,1,1,1) = {5}:{6} w(1,1,2,1,1,1) = {2}:{10} w(2,1,2,1,1,1) = {1,3}:{4,10} w(0,2,2,1,1,1) = {2,3}:{9,11} w(1,2,2,1,1,1) = {1}:{8} w(2,2,2,1,1,1) = {2,3}:{4,8} w(0,0,0,2,1,1) = {10}:{11} w(1,0,0,2,1,1) = {2}:{4} w(2,0,0,2,1,1) = {9}:{11} w(0,1,0,2,1,1) = {4,6}:{9,11} w(1,1,0,2,1,1) = {7}:{8} w(2,1,0,2,1,1) = {1,2}:{3,11} w(0,2,0,2,1,1) = {1,4}:{10,11} w(1,2,0,2,1,1) = {9}:{10} w(2,2,0,2,1,1) = {1,2}:{3,11} w(0,0,1,2,1,1) = {1}:{7} w(1,0,1,2,1,1) = {4}:{6} w(2,0,1,2,1,1) = {4}:{6} w(0,1,1,2,1,1) = {2,3}:{9,11} w(1,1,1,2,1,1) = {3,6}:{4,9} w(2,1,1,2,1,1) = {5,10}:{8,11} w(0,2,1,2,1,1) = {9}:{11} w(1,2,1,2,1,1) = {3,6}:{4,7} w(2,2,1,2,1,1) = {5,8}:{10,11}
31 w(0,0,2,2,1,1) = {7}:{8} w(1,0,2,2,1,1) = {4}:{5} w(2,0,2,2,1,1) = {4}:{5} w(0,1,2,2,1,1) = {2,3}:{10,11} w(1,1,2,2,1,1) = {3,5}:{4,10} w(2,1,2,2,1,1) = {6,9}:{7,11} w(0,2,2,2,1,1) = {10}:{11} w(1,2,2,2,1,1) = {3,5}:{4,8} w(2,2,2,2,1,1) = {6,7}:{9,11} w(0,0,0,0,2,1) = {}:{} w(1,0,0,0,2,1) = {8}:{11} w(2,0,0,0,2,1) = {8}:{11} w(0,1,0,0,2,1) = {1}:{7} w(1,1,0,0,2,1) = {6}:{10} w(2,1,0,0,2,1) = {5}:{9} w(0,2,0,0,2,1) = {3}:{11} w(1,2,0,0,2,1) = {6}:{8} w(2,2,0,0,2,1) = {5}:{7} w(0,0,1,0,2,1) = {2}:{3} w(1,0,1,0,2,1) = {7}:{11} w(2,0,1,0,2,1) = {3}:{11} w(0,1,1,0,2,1) = {2,3}:{9,11} w(1,1,1,0,2,1) = {1}:{8} w(2,1,1,0,2,1) = {5,6}:{9,10} w(0,2,1,0,2,1) = {2,3}:{10,11} w(1,2,1,0,2,1) = {2}:{10} w(2,2,1,0,2,1) = {5,6}:{7,8} w(0,0,2,0,2,1) = {2}:{3} w(1,0,2,0,2,1) = {10}:{11} w(2,0,2,0,2,1) = {3}:{11} w(0,1,2,0,2,1) = {2,3}:{10,11} w(1,1,2,0,2,1) = {1}:{7} w(2,1,2,0,2,1) = {5,6}:{9,10} w(0,2,2,0,2,1) = {2,3}:{9,11} w(1,2,2,0,2,1) = {2}:{9} w(2,2,2,0,2,1) = {5,6}:{7,8} w(0,0,0,1,2,1) = {10}:{11} w(1,0,0,1,2,1) = {9}:{11} w(2,0,0,1,2,1) = {1,11}:{3,4} w(0,1,0,1,2,1) = {5}:{11} w(1,1,0,1,2,1) = {3}:{4} w(2,1,0,1,2,1) = {10}:{8} w(0,2,0,1,2,1) = {1}:{11} w(1,2,0,1,2,1) = {3}:{4} w(2,2,0,1,2,1) = {8}:{10} w(0,0,1,1,2,1) = {2}:{3} w(1,0,1,1,2,1) = {4}:{6} w(2,0,1,1,2,1) = {10}:{11} w(0,1,1,1,2,1) = {5}:{6} w(1,1,1,1,2,1) = {1}:{2} w(2,1,1,1,2,1) = {1}:{11} w(0,2,1,1,2,1) = {2,3}:{10,11} w(1,2,1,1,2,1) = {2}:{1} w(2,2,1,1,2,1) = {2}:{11} w(0,0,2,1,2,1) = {5,9}:{7,10} w(1,0,2,1,2,1) = {4}:{5} w(2,0,2,1,2,1) = {7}:{11} w(0,1,2,1,2,1) = {5}:{6} w(1,1,2,1,2,1) = {1}:{2} w(2,1,2,1,2,1) = {1}:{11} w(0,2,2,1,2,1) = {2,3}:{9,11} w(1,2,2,1,2,1) = {2}:{1} w(2,2,2,1,2,1) = {2}:{11} w(0,0,0,2,2,1) = {6}:{11} w(1,0,0,2,2,1) = {7}:{11} w(2,0,0,2,2,1) = {3,4}:{9,11} w(0,1,0,2,2,1) = {6}:{11} w(1,1,0,2,2,1) = {2,6}:{4,5} w(2,1,0,2,2,1) = {3,11}:{4,8} w(0,2,0,2,2,1) = {1}:{11} w(1,2,0,2,2,1) = {1,6}:{4,5} w(2,2,0,2,2,1) = {3,11}:{4,10} w(0,0,1,2,2,1) = {1}:{7} w(1,0,1,2,2,1) = {7}:{8} w(2,0,1,2,2,1) = {3,4}:{5,6} w(0,1,1,2,2,1) = {2,3}:{9,11} w(1,1,1,2,2,1) = {3,4}:{8,9} w(2,1,1,2,2,1) = {5,10}:{8,9} w(0,2,1,2,2,1) = {9}:{11} w(1,2,1,2,2,1) = {3,4}:{7,10} w(2,2,1,2,2,1) = {5,8}:{7,10} w(0,0,2,2,2,1) = {9}:{11} w(1,0,2,2,2,1) = {10}:{9} w(2,0,2,2,2,1) = {3,4}:{5,6} w(0,1,2,2,2,1) = {2,3}:{10,11} w(1,1,2,2,2,1) = {3,4}:{7,10} w(2,1,2,2,2,1) = {6,9}:{7,10} w(0,2,2,2,2,1) = {10}:{11} w(1,2,2,2,2,1) = {3,4}:{8,9} w(2,2,2,2,2,1) = {6,7}:{8,9} w(0,0,0,0,0,2) = {10}:{11} w(1,0,0,0,0,2) = {8}:{11} w(2,0,0,0,0,2) = {8}:{11} w(0,1,0,0,0,2) = {1}:{11} w(1,1,0,0,0,2) = {2}:{7} w(2,1,0,0,0,2) = {2}:{10} w(0,2,0,0,0,2) = {1}:{11} w(1,2,0,0,0,2) = {1}:{9} w(2,2,0,0,0,2) = {1}:{8} w(0,0,1,0,0,2) = {3}:{4} w(1,0,1,0,0,2) = {10}:{11} w(2,0,1,0,0,2) = {3}:{11} w(0,1,1,0,0,2) = {9}:{11} w(1,1,1,0,0,2) = {3,6}:{5,9} w(2,1,1,0,0,2) = {6}:{8} w(0,2,1,0,0,2) = {10}:{11} w(1,2,1,0,0,2) = {3,6}:{5,7} w(2,2,1,0,0,2) = {6}:{10} w(0,0,2,0,0,2) = {3}:{10} w(1,0,2,0,0,2) = {7}:{11} w(2,0,2,0,0,2) = {3}:{11} w(0,1,2,0,0,2) = {10}:{11} w(1,1,2,0,0,2) = {3,5}:{6,10} w(2,1,2,0,0,2) = {5}:{7} w(0,2,2,0,0,2) = {9}:{11} w(1,2,2,0,0,2) = {3,5}:{6,8} w(2,2,2,0,0,2) = {5}:{9} w(0,0,0,1,0,2) = {10}:{11} w(1,0,0,1,0,2) = {9}:{11} w(2,0,0,1,0,2) = {4}:{5} w(0,1,0,1,0,2) = {2}:{11} w(1,1,0,1,0,2) = {2,4}:{3,8} w(2,1,0,1,0,2) = {6}:{10} w(0,2,0,1,0,2) = {7}:{11} w(1,2,0,1,0,2) = {1,4}:{3,10} w(2,2,0,1,0,2) = {6}:{8} w(0,0,1,1,0,2) = {2}:{11} w(1,0,1,1,0,2) = {4}:{11} w(2,0,1,1,0,2) = {2}:{3} w(0,1,1,1,0,2) = {10}:{11} w(1,1,1,1,0,2) = {8}:{11} w(2,1,1,1,0,2) = {1,4}:{3,6}
32 w(0,2,1,1,0,2) = {10}:{11} w(1,2,1,1,0,2) = {10}:{11} w(2,2,1,1,0,2) = {2,4}:{3,6} w(0,0,2,1,0,2) = {10}:{11} w(1,0,2,1,0,2) = {4}:{11} w(2,0,2,1,0,2) = {1}:{3} w(0,1,2,1,0,2) = {9}:{11} w(1,1,2,1,0,2) = {7}:{11} w(2,1,2,1,0,2) = {1,4}:{3,5} w(0,2,2,1,0,2) = {9}:{11} w(1,2,2,1,0,2) = {9}:{11} w(2,2,2,1,0,2) = {2,4}:{3,5} w(0,0,0,2,0,2) = {10}:{11} w(1,0,0,2,0,2) = {10}:{11} w(2,0,0,2,0,2) = {9}:{11} w(0,1,0,2,0,2) = {2}:{11} w(1,1,0,2,0,2) = {2}:{11} w(2,1,0,2,0,2) = {10}:{8} w(0,2,0,2,0,2) = {8}:{11} w(1,2,0,2,0,2) = {1}:{11} w(2,2,0,2,0,2) = {8}:{10} w(0,0,1,2,0,2) = {9}:{11} w(1,0,1,2,0,2) = {3,4}:{7,8} w(2,0,1,2,0,2) = {4}:{5} w(0,1,1,2,0,2) = {9}:{11} w(1,1,1,2,0,2) = {2}:{3} w(2,1,1,2,0,2) = {1}:{8} w(0,2,1,2,0,2) = {5}:{6} w(1,2,1,2,0,2) = {1}:{3} w(2,2,1,2,0,2) = {2}:{10} w(0,0,2,2,0,2) = {2,10}:{3,11} w(1,0,2,2,0,2) = {3,4}:{9,10} w(2,0,2,2,0,2) = {4}:{6} w(0,1,2,2,0,2) = {10}:{11} w(1,1,2,2,0,2) = {2}:{3} w(2,1,2,2,0,2) = {1}:{7} w(0,2,2,2,0,2) = {5}:{6} w(1,2,2,2,0,2) = {1}:{3} w(2,2,2,2,0,2) = {2}:{9} w(0,0,0,0,1,2) = {}:{} w(1,0,0,0,1,2) = {8}:{11} w(2,0,0,0,1,2) = {8}:{11} w(0,1,0,0,1,2) = {3}:{11} w(1,1,0,0,1,2) = {5}:{7} w(2,1,0,0,1,2) = {6}:{8} w(0,2,0,0,1,2) = {1}:{7} w(1,2,0,0,1,2) = {5}:{9} w(2,2,0,0,1,2) = {6}:{10} w(0,0,1,0,1,2) = {2}:{3} w(1,0,1,0,1,2) = {3}:{11} w(2,0,1,0,1,2) = {10}:{11} w(0,1,1,0,1,2) = {2,3}:{9,11} w(1,1,1,0,1,2) = {5,6}:{7,8} w(2,1,1,0,1,2) = {2}:{9} w(0,2,1,0,1,2) = {2,3}:{10,11} w(1,2,1,0,1,2) = {5,6}:{9,10} w(2,2,1,0,1,2) = {1}:{7} w(0,0,2,0,1,2) = {2}:{3} w(1,0,2,0,1,2) = {3}:{11} w(2,0,2,0,1,2) = {7}:{11} w(0,1,2,0,1,2) = {2,3}:{10,11} w(1,1,2,0,1,2) = {5,6}:{7,8} w(2,1,2,0,1,2) = {2}:{10} w(0,2,2,0,1,2) = {2,3}:{9,11} w(1,2,2,0,1,2) = {5,6}:{9,10} w(2,2,2,0,1,2) = {1}:{8} w(0,0,0,1,1,2) = {6}:{11} w(1,0,0,1,1,2) = {3,4}:{9,11} w(2,0,0,1,1,2) = {7}:{11} w(0,1,0,1,1,2) = {1}:{11} w(1,1,0,1,1,2) = {3,11}:{4,10} w(2,1,0,1,1,2) = {1,6}:{4,5} w(0,2,0,1,1,2) = {6}:{11} w(1,2,0,1,1,2) = {3,11}:{4,8} w(2,2,0,1,1,2) = {2,6}:{4,5} w(0,0,1,1,1,2) = {9}:{11} w(1,0,1,1,1,2) = {3,4}:{5,6} w(2,0,1,1,1,2) = {10}:{9} w(0,1,1,1,1,2) = {10}:{11} w(1,1,1,1,1,2) = {6,7}:{8,9} w(2,1,1,1,1,2) = {3,4}:{8,9} w(0,2,1,1,1,2) = {2,3}:{10,11} w(1,2,1,1,1,2) = {6,9}:{7,10} w(2,2,1,1,1,2) = {3,4}:{7,10} w(0,0,2,1,1,2) = {1}:{7} w(1,0,2,1,1,2) = {3,4}:{5,6} w(2,0,2,1,1,2) = {7}:{8} w(0,1,2,1,1,2) = {9}:{11} w(1,1,2,1,1,2) = {5,8}:{7,10} w(2,1,2,1,1,2) = {3,4}:{7,10} w(0,2,2,1,1,2) = {2,3}:{9,11} w(1,2,2,1,1,2) = {5,10}:{8,9} w(2,2,2,1,1,2) = {3,4}:{8,9} w(0,0,0,2,1,2) = {10}:{11} w(1,0,0,2,1,2) = {1,11}:{3,4} w(2,0,0,2,1,2) = {9}:{11} w(0,1,0,2,1,2) = {1}:{11} w(1,1,0,2,1,2) = {8}:{10} w(2,1,0,2,1,2) = {3}:{4} w(0,2,0,2,1,2) = {5}:{11} w(1,2,0,2,1,2) = {10}:{8} w(2,2,0,2,1,2) = {3}:{4} w(0,0,1,2,1,2) = {5,9}:{7,10} w(1,0,1,2,1,2) = {7}:{11} w(2,0,1,2,1,2) = {4}:{5} w(0,1,1,2,1,2) = {2,3}:{9,11} w(1,1,1,2,1,2) = {2}:{11} w(2,1,1,2,1,2) = {2}:{1} w(0,2,1,2,1,2) = {5}:{6} w(1,2,1,2,1,2) = {1}:{11} w(2,2,1,2,1,2) = {1}:{2} w(0,0,2,2,1,2) = {2}:{3} w(1,0,2,2,1,2) = {10}:{11} w(2,0,2,2,1,2) = {4}:{6} w(0,1,2,2,1,2) = {2,3}:{10,11} w(1,1,2,2,1,2) = {2}:{11} w(2,1,2,2,1,2) = {2}:{1} w(0,2,2,2,1,2) = {5}:{6} w(1,2,2,2,1,2) = {1}:{11} w(2,2,2,2,1,2) = {1}:{2} w(0,0,0,0,2,2) = {}:{} w(1,0,0,0,2,2) = {8}:{11} w(2,0,0,0,2,2) = {8}:{11} w(0,1,0,0,2,2) = {2}:{11} w(1,1,0,0,2,2) = {1}:{7} w(2,1,0,0,2,2) = {1}:{10} w(0,2,0,0,2,2) = {1}:{7} w(1,2,0,0,2,2) = {2}:{9} w(2,2,0,0,2,2) = {2}:{8} w(0,0,1,0,2,2) = {2}:{3} w(1,0,1,0,2,2) = {1,11}:{4,7} w(2,0,1,0,2,2) = {6,8}:{10,11}
33 w(0,1,1,0,2,2) = {2,3}:{9,11} w(1,1,1,0,2,2) = {8}:{10} w(2,1,1,0,2,2) = {3}:{9} w(0,2,1,0,2,2) = {2,3}:{10,11} w(1,2,1,0,2,2) = {10}:{8} w(2,2,1,0,2,2) = {3}:{7} w(0,0,2,0,2,2) = {2}:{3} w(1,0,2,0,2,2) = {2,11}:{4,10} w(2,0,2,0,2,2) = {5,9}:{7,11} w(0,1,2,0,2,2) = {2,3}:{10,11} w(1,1,2,0,2,2) = {7}:{9} w(2,1,2,0,2,2) = {3}:{10} w(0,2,2,0,2,2) = {2,3}:{9,11} w(1,2,2,0,2,2) = {9}:{7} w(2,2,2,0,2,2) = {3}:{8} w(0,0,0,1,2,2) = {10}:{11} w(1,0,0,1,2,2) = {9}:{11} w(2,0,0,1,2,2) = {2}:{4} w(0,1,0,1,2,2) = {1,4}:{10,11} w(1,1,0,1,2,2) = {1,2}:{3,11} w(2,1,0,1,2,2) = {9}:{10} w(0,2,0,1,2,2) = {4,6}:{9,11} w(1,2,0,1,2,2) = {1,2}:{3,11} w(2,2,0,1,2,2) = {7}:{8} w(0,0,1,1,2,2) = {7}:{8} w(1,0,1,1,2,2) = {4}:{5} w(2,0,1,1,2,2) = {4}:{5} w(0,1,1,1,2,2) = {10}:{11} w(1,1,1,1,2,2) = {6,7}:{9,11} w(2,1,1,1,2,2) = {3,5}:{4,8} w(0,2,1,1,2,2) = {2,3}:{10,11} w(1,2,1,1,2,2) = {6,9}:{7,11} w(2,2,1,1,2,2) = {3,5}:{4,10} w(0,0,2,1,2,2) = {1}:{7} w(1,0,2,1,2,2) = {4}:{6} w(2,0,2,1,2,2) = {4}:{6} w(0,1,2,1,2,2) = {9}:{11} w(1,1,2,1,2,2) = {5,8}:{10,11} w(2,1,2,1,2,2) = {3,6}:{4,7} w(0,2,2,1,2,2) = {2,3}:{9,11} w(1,2,2,1,2,2) = {5,10}:{8,11} w(2,2,2,1,2,2) = {3,6}:{4,9} w(0,0,0,2,2,2) = {9}:{10} w(1,0,0,2,2,2) = {2}:{11} w(2,0,0,2,2,2) = {3,4}:{9,11} w(0,1,0,2,2,2) = {1,4}:{9,11} w(1,1,0,2,2,2) = {1}:{8} w(2,1,0,2,2,2) = {6}:{11} w(0,2,0,2,2,2) = {4,5}:{10,11} w(1,2,0,2,2,2) = {2}:{10} w(2,2,0,2,2,2) = {6}:{11} w(0,0,1,2,2,2) = {6,9}:{7,10} w(1,0,1,2,2,2) = {10}:{11} w(2,0,1,2,2,2) = {4}:{5} w(0,1,1,2,2,2) = {2,3}:{9,11} w(1,1,1,2,2,2) = {2,3}:{4,8} w(2,1,1,2,2,2) = {1}:{8} w(0,2,1,2,2,2) = {5}:{6} w(1,2,1,2,2,2) = {1,3}:{4,10} w(2,2,1,2,2,2) = {2}:{10} w(0,0,2,2,2,2) = {1,4}:{10,11} w(1,0,2,2,2,2) = {7}:{11} w(2,0,2,2,2,2) = {4}:{6} w(0,1,2,2,2,2) = {2,3}:{10,11} w(1,1,2,2,2,2) = {2,3}:{4,7} w(2,1,2,2,2,2) = {1}:{7} w(0,2,2,2,2,2) = {5}:{6} w(1,2,2,2,2,2) = {1,3}:{4,9} w(2,2,2,2,2,2) = {2}:{9} List 1 1:= <, 0:= =, 2:= >, and w(x) is the weighing in the direction x.
34 The completed map of the first algorithm to sort 11 coins f(0,0,0,0,0,0) = 2047 f(1,0,0,0,0,0,0) = 1468 f(2,0,0,0,0,0,0) = 579 f(0,1,0,0,0,0,0) = 1855 f(1,1,0,0,0,0,0) = 2046 f(2,1,0,0,0,0,0) = 2 f(0,2,0,0,0,0,0) = 192 f(1,2,0,0,0,0,0) = 2045 f(2,2,0,0,0,0,0) = 1 f(0,0,1,0,0,0,0) = 138 f(1,0,1,0,0,0,0) = 1786 f(2,0,1,0,0,0,0) = 134 f(0,1,1,0,0,0,0) = 1974 f(1,1,1,0,0,0,0) = 944 f(2,1,1,0,0,0,0) = 1551 f(0,2,1,0,0,0,0) = 137 f(1,2,1,0,0,0,0) = 752 f(2,2,1,0,0,0,0) = 1167 f(0,0,2,0,0,0,0) = 1909 f(1,0,2,0,0,0,0) = 1913 f(2,0,2,0,0,0,0) = 261 f(0,1,2,0,0,0,0) = 1910 f(1,1,2,0,0,0,0) = 880 f(2,1,2,0,0,0,0) = 1295 f(0,2,2,0,0,0,0) = 73 f(1,2,2,0,0,0,0) = 496 f(2,2,2,0,0,0,0) = 1103 f(1,0,0,1,0,0,0) = 2044 f(2,0,0,1,0,0,0) = 1991 f(0,1,0,1,0,0,0) = 1838 f(1,1,0,1,0,0,0) = 300 f(2,1,0,1,0,0,0) = 774 f(0,2,0,1,0,0,0) = 225 f(1,2,0,1,0,0,0) = 108 f(2,2,0,1,0,0,0) = 197 f(1,0,1,1,0,0,0) = 696 f(2,0,1,1,0,0,0) = 2031 f(0,1,1,1,0,0,0) = 1674 f(1,1,1,1,0,0,0) = 1594 f(2,1,1,1,0,0,0) = 1827 f(0,2,1,1,0,0,0) = 128 f(1,2,1,1,0,0,0) = 1209 f(2,2,1,1,0,0,0) = 1251 f(1,0,2,1,0,0,0) = 376 f(2,0,2,1,0,0,0) = 2015 f(0,1,2,1,0,0,0) = 1354 f(1,1,2,1,0,0,0) = 1338 f(2,1,2,1,0,0,0) = 1811 f(0,2,2,1,0,0,0) = 64 f(1,2,2,1,0,0,0) = 1145 f(2,2,2,1,0,0,0) = 1235 f(1,0,0,2,0,0,0) = 56 f(2,0,0,2,0,0,0) = 3 f(0,1,0,2,0,0,0) = 1822 f(1,1,0,2,0,0,0) = 1850 f(2,1,0,2,0,0,0) = 1939 f(0,2,0,2,0,0,0) = 209 f(1,2,0,2,0,0,0) = 1273 f(2,2,0,2,0,0,0) = 1747 f(1,0,1,2,0,0,0) = 32 f(2,0,1,2,0,0,0) = 1671 f(0,1,1,2,0,0,0) = 1983 f(1,1,1,2,0,0,0) = 812 f(2,1,1,2,0,0,0) = 902 f(0,2,1,2,0,0,0) = 693 f(1,2,1,2,0,0,0) = 236 f(2,2,1,2,0,0,0) = 709 f(1,0,2,2,0,0,0) = 16 f(2,0,2,2,0,0,0) = 1351 f(0,1,2,2,0,0,0) = 1919 f(1,1,2,2,0,0,0) = 796 f(2,1,2,2,0,0,0) = 838 f(0,2,2,2,0,0,0) = 373 f(1,2,2,2,0,0,0) = 220 f(2,2,2,2,0,0,0) = 453 f(0,0,0,0,1,0,0) = 1984 f(1,0,0,0,1,0,0) = 1534 f(2,0,0,0,1,0,0) = 66 f(0,1,0,0,1,0,0) = 1804 f(1,1,0,0,1,0,0) = 1854 f(2,1,0,0,1,0,0) = 1943 f(0,2,0,0,1,0,0) = 245 f(1,2,0,0,1,0,0) = 1277 f(2,2,0,0,1,0,0) = 1751 f(0,0,1,0,1,0,0) = 1060 f(2,0,1,0,1,0,0) = 710 f(1,1,1,0,1,0,0) = 1832 f(2,1,1,0,1,0,0) = 1702 f(1,2,1,0,1,0,0) = 1256 f(2,2,1,0,1,0,0) = 1701 f(0,0,2,0,1,0,0) = 1003 f(2,0,2,0,1,0,0) = 837 f(1,1,2,0,1,0,0) = 1816 f(2,1,2,0,1,0,0) = 1366 f(1,2,2,0,1,0,0) = 1240 f(2,2,2,0,1,0,0) = 1365 f(0,0,0,1,1,0,0) = 1134 f(2,0,0,1,1,0,0) = 388 f(1,1,0,1,1,0,0) = 1662 f(2,1,0,1,1,0,0) = 919 f(1,2,0,1,1,0,0) = 1469 f(2,2,0,1,1,0,0) = 727 f(0,0,1,1,1,0,0) = 2020 f(1,0,1,1,1,0,0) = 648 f(2,0,1,1,1,0,0) = 1699 f(0,1,1,1,1,0,0) = 1930 f(1,1,1,1,1,0,0) = 1714 f(2,1,1,1,1,0,0) = 1538 f(1,2,1,1,1,0,0) = 1713 f(2,2,1,1,1,0,0) = 1153 f(0,0,2,1,1,0,0) = 2027 f(1,0,2,1,1,0,0) = 328 f(2,0,2,1,1,0,0) = 1363 f(0,1,2,1,1,0,0) = 1866 f(1,1,2,1,1,0,0) = 1394 f(2,1,2,1,1,0,0) = 1282 f(1,2,2,1,1,0,0) = 1393 f(2,2,2,1,1,0,0) = 1089 f(1,0,0,2,1,0,0) = 392 f(1,1,0,2,1,0,0) = 2034 f(2,1,0,2,1,0,0) = 1799 f(1,2,0,2,1,0,0) = 2033 f(2,2,0,2,1,0,0) = 1223
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 informationarxiv: v1 [math.ra] 3 Oct 2009
ACTOR OF AN ALTERNATIVE ALGEBRA J.M. CASAS, T. DATUASHVILI, AND M. LADRA arxiv:0910.0550v1 [math.ra] 3 Oct 2009 Abstract. We define a category galt of g-alternative algebras over a field F and present
More informationLocally maximal product-free sets of size 3
Locally maximal product-free sets of size 3 By Chimere S. Anabanti and Sarah B. Hart Birkbeck Pure Mathematics Preprint Series Preprint Number 10 www.bbk.ac.uk/ems/research/pure/preprints Locally maximal
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 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 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 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 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 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 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 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 information..«W- tn^zmxmmrrx/- NEW STORE. Popular Goods at Popular D. E. SPRING, Mas just opened a large fdo.k of DRY GOODS & GROCERIES,
B y «X }() z zxx/ X y y y y )3 y «y
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 informationOn complete permutation polynomials 1
Fourteenth International Workshop on Algebraic and Combinatorial Coding Theory September 7 13, 2014, Svetlogorsk (Kaliningrad region), Russia pp. 57 62 On complete permutation polynomials 1 L. A. Bassalygo
More informationDYNAMIC ONE-PILE NIM Arthur Holshouser 3600 Bullard St., Charlotte, NC, USA, 28208
Arthur Holshouser 3600 Bullard St., Charlotte, NC, USA, 28208 Harold Reiter Department of Mathematics, UNC Charlotte, Charlotte, NC 28223 James Riidzinski Undergraduate, Dept. of Math., UNC Charlotte,
More informationc i r i i=1 r 1 = [1, 2] r 2 = [0, 1] r 3 = [3, 4].
Lecture Notes: Rank of a Matrix Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk 1 Linear Independence Definition 1. Let r 1, r 2,..., r m
More informationFinite connectivity in infinite matroids
Finite connectivity in infinite matroids Henning Bruhn Paul Wollan Abstract We introduce a connectivity function for infinite matroids with properties similar to the connectivity function of a finite matroid,
More informationKent Co. Received Red Cross Service Abundantly in ' 4 9 E
G N GN Y 95 89 N - q» B < ) < - 9 - - - - q ( B 6 - q - Q» x x 8 {) N - 9» -
More informationOrientations of Simplices Determined by Orderings on the Coordinates of their Vertices. September 30, 2018
Orientations of Simplices Determined by Orderings on the Coordinates of their Vertices Emeric Gioan 1 Kevin Sol 2 Gérard Subsol 1 September 30, 2018 arxiv:1602.01641v1 [cs.dm] 4 Feb 2016 Abstract Provided
More informationCycles with consecutive odd lengths
Cycles with consecutive odd lengths arxiv:1410.0430v1 [math.co] 2 Oct 2014 Jie Ma Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA 15213. Abstract It is proved that there
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 informationPacking of Rigid Spanning Subgraphs and Spanning Trees
Packing of Rigid Spanning Subgraphs and Spanning Trees Joseph Cheriyan Olivier Durand de Gevigney Zoltán Szigeti December 14, 2011 Abstract We prove that every 6k + 2l, 2k-connected simple graph contains
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 informationMaximal non-commuting subsets of groups
Maximal non-commuting subsets of groups Umut Işık March 29, 2005 Abstract Given a finite group G, we consider the problem of finding the maximal size nc(g) of subsets of G that have the property that no
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 informationThis exam contains 9 problems. CHECK THAT YOU HAVE A COMPLETE EXAM.
Math 126 Final Examination Autumn 2011 Your Name Your Signature Student ID # Quiz Section Professor s Name TA s Name This exam contains 9 problems. CHECK THAT YOU HAVE A COMPLETE EXAM. This exam is closed
More informationGallai s Conjecture For Graphs of Girth at Least Four. Peter Harding and Sean McGuinness Thompson Rivers University
Gallai s Conjecture For Graphs of Girth at Least Four Peter Harding and Sean McGuinness Thompson Rivers University i Gallai s Conjecture For Graphs of Girth at Least Four Peter Harding and Sean McGuinness
More informationNowhere-zero 3-flows in triangularly connected graphs
Nowhere-zero 3-flows in triangularly connected graphs Genghua Fan 1, Hongjian Lai 2, Rui Xu 3, Cun-Quan Zhang 2, Chuixiang Zhou 4 1 Center for Discrete Mathematics Fuzhou University Fuzhou, Fujian 350002,
More informationAnalysis of odd/odd vertex removal games on special graphs
Analysis of odd/odd vertex removal games on special graphs Master Thesis, Royal Institute of Technology - KTH, 2012 Oliver Krüger okruger@kth.se May 21, 2012 Thesis advisor: Jonas Sjöstrand, KTH Abstract
More informationPolynomial Functions
Polynomial Functions NOTE: Some problems in this file are used with permission from the engageny.org website of the New York State Department of Education. Various files. Internet. Available from https://www.engageny.org/ccss-library.
More informationInserting plus signs and adding
Inserting plus signs and adding Steve Butler Ron Graham Richard Stong Abstract. For a fixed base b, we consider the following operation called insert and add on a natural number: Write the number as a
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 informationToppling Conjectures
Games of No Chance 4 MSRI Publications Volume 63, 2015 Toppling Conjectures ALEX FINK, RICHARD NOWAKOWSKI, AARON SIEGEL AND DAVID WOLFE Positions of the game of TOPPLING DOMINOES exhibit many familiar
More informationOne Pile Nim with Arbitrary Move Function
One Pile Nim with Arbitrary Move Function by Arthur Holshouser and Harold Reiter Arthur Holshouser 3600 Bullard St. Charlotte, NC, USA, 28208 Harold Reiter Department of Mathematics UNC Charlotte Charlotte,
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 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 informationSeunghee Ye Ma 8: Week 1 Notes September 29, 2016
Week Notes Summary This week, we will learn about mathematical proofs. We start by defining what we mean by a mathematical proof and look at a few important things to avoid/keep in mind when writing mathematical
More informationEhrhart polynomial for lattice squares, cubes, and hypercubes
Ehrhart polynomial for lattice squares, cubes, and hypercubes Eugen J. Ionascu UWG, REU, July 10th, 2015 math@ejionascu.ro, www.ejionascu.ro 1 Abstract We are investigating the problem of constructing
More informationMath 203A - Solution Set 1
Math 203A - Solution Set 1 Problem 1. Show that the Zariski topology on A 2 is not the product of the Zariski topologies on A 1 A 1. Answer: Clearly, the diagonal Z = {(x, y) : x y = 0} A 2 is closed in
More informationStrongly 2-connected orientations of graphs
Downloaded from orbit.dtu.dk on: Jul 04, 2018 Strongly 2-connected orientations of graphs Thomassen, Carsten Published in: Journal of Combinatorial Theory. Series B Link to article, DOI: 10.1016/j.jctb.2014.07.004
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 informationCS154 Final Examination
CS154 Final Examination June 7, 2010, 7-10PM Directions: CS154 students: answer all 13 questions on this paper. Those taking CS154N should answer only questions 8-13. The total number of points on this
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 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 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 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 informationFifty Years of Fine and Wilf
Fifty Years of Fine and Wilf Jeffrey Shallit School of Computer Science, University of Waterloo Waterloo, Ontario N2L 3G1, Canada shallit@cs.uwaterloo.ca https://www.cs.uwaterloo.ca/~shallit 1 / 51 Words
More information1.1 Line Reflections and Point Reflections
1.1 Line Reflections and Point Reflections Since this is a book on Transformation Geometry, we shall start by defining transformations of the Euclidean plane and giving basic examples. Definition 1. A
More informationBinary dicots, a core of dicot games
Binary dicots, a core of dicot games Gabriel Renault Univ. Bordeaux, LaBRI, UMR5800, F-33400 Talence CNRS, LaBRI, UMR5800, F-33400 Talence Department of Mathematics, Beijing Jiaotong University, Beijing
More informationCycles in 4-Connected Planar Graphs
Cycles in 4-Connected Planar Graphs Guantao Chen Department of Mathematics & Statistics Georgia State University Atlanta, GA 30303 matgcc@panther.gsu.edu Genghua Fan Institute of Systems Science Chinese
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 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 informationProve proposition 68. It states: Let R be a ring. We have the following
Theorem HW7.1. properties: Prove proposition 68. It states: Let R be a ring. We have the following 1. The ring R only has one additive identity. That is, if 0 R with 0 +b = b+0 = b for every b R, then
More informationarxiv: v1 [math.co] 22 Jan 2018
arxiv:1801.07025v1 [math.co] 22 Jan 2018 Spanning trees without adjacent vertices of degree 2 Kasper Szabo Lyngsie, Martin Merker Abstract Albertson, Berman, Hutchinson, and Thomassen showed in 1990 that
More informationMisère canonical forms of partizan games
Games of No Chance 4 MSRI Publications Volume 63, 2015 Misère canonical forms of partizan games AARON N. SIEGEL We show that partizan games admit canonical forms in misère play. The proof is a synthesis
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationFactor: x 2 11x + 30 = 0. Factoring Quadratic Equations. Fractional and Negative Exponents
Factor: For each of the following, could the answer be an integer if x is an integer greater than 1? x 11x + 30 = 0 a) x 10 + x 10 = b) x 1/6 + x 1/ = Answer: (x 5)(x 6) = 0 Factoring Since the last sign
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 informationArithmetic Operations. The real numbers have the following properties: In particular, putting a 1 in the Distributive Law, we get
MCA AP Calculus AB Summer Assignment The following packet is a review of many of the skills needed as we begin the study of Calculus. There two major sections to this review. Pages 2-9 are review examples
More informationALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers
ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some
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 informationFifty Years of Fine and Wilf
Fifty Years of Fine and Wilf Jeffrey Shallit School of Computer Science, University of Waterloo Waterloo, Ontario N2L 3G1, Canada shallit@cs.uwaterloo.ca https://www.cs.uwaterloo.ca/~shallit 1 / 56 Words
More informationOn atoms in BCC-algebras
Discussiones Mathematicae ser. Algebra and Stochastic Methods 15 (1995), 81 85 On atoms in BCC-algebras Wies law A. DUDEK and Xiaohong ZHANG Abstract We characterize the the set of all atoms of a BCC-algebra
More informationSolutions to November 2006 Problems
Solutions to November 2006 Problems Problem 1. A six-sided convex polygon is inscribed in a circle. All its angles are equal. Show that its sides need not be equal. What can be said about seven-sided equal-angled
More informationLinear and Combinatorial Optimization
Linear and Combinatorial Optimization The dual of an LP-problem. Connections between primal and dual. Duality theorems and complementary slack. Philipp Birken (Ctr. for the Math. Sc.) Lecture 3: Duality
More informationBipartite decomposition of random graphs
Bipartite decomposition of random graphs Noga Alon Abstract For a graph G = (V, E, let τ(g denote the minimum number of pairwise edge disjoint complete bipartite subgraphs of G so that each edge of G belongs
More informationSum-product estimates over arbitrary finite fields
Sum-product estimates over arbitrary finite fields Doowon Koh Sujin Lee Thang Pham Chun-Yen Shen Abstract arxiv:1805.08910v3 [math.nt] 16 Jul 2018 In this paper we prove some results on sum-product estimates
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 informationON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS
ON THE NUMBER OF ALTERNATING PATHS IN BIPARTITE COMPLETE GRAPHS PATRICK BENNETT, ANDRZEJ DUDEK, ELLIOT LAFORGE December 1, 016 Abstract. Let C [r] m be a code such that any two words of C have Hamming
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 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 informationThe Interlace Polynomial of Graphs at 1
The Interlace Polynomial of Graphs at 1 PN Balister B Bollobás J Cutler L Pebody July 3, 2002 Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152 USA Abstract In this paper we
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 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 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 informationDiskrete Mathematik und Optimierung
Diskrete Mathematik und Optimierung Winfried Hochstättler Michael Wilhelmi: Sticky matroids and Kantor s Conjecture Technical Report feu-dmo044.17 Contact: {Winfried.Hochstaettler, Michael.Wilhelmi}@fernuni-hagen.de
More informationDecomposing planar cubic graphs
Decomposing planar cubic graphs Arthur Hoffmann-Ostenhof Tomáš Kaiser Kenta Ozeki Abstract The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree,
More informationTeaching Duality in Linear Programming - the Multiplier Approach
Teaching Duality in Linear Programming - the Multiplier Approach Jens Clausen DIKU, Department of Computer Science University of Copenhagen Universitetsparken 1 DK 2100 Copenhagen Ø June 3, 1998 Abstract
More informationOn the Composite Terms in Sequence Generated from Mersenne-type Recurrence Relations
On the Composite Terms in Sequence Generated from Mersenne-type Recurrence Relations Pingyuan Zhou E-mail:zhoupingyuan49@hotmail.com Abstract We conjecture that there is at least one composite term in
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 informationDirac s Map-Color Theorem for Choosability
Dirac s Map-Color Theorem for Choosability T. Böhme B. Mohar Technical University of Ilmenau, University of Ljubljana, D-98684 Ilmenau, Germany Jadranska 19, 1111 Ljubljana, Slovenia M. Stiebitz Technical
More informationPLAYING END-NIM WITH A MULLER TWIST
#G5 INTEGERS 17 (2017) PLAYING END-NIM WITH A MULLER TWIST David G. C. Horrocks School of Mathematical and Computational Sciences, University of Prince Edward Island, Charlottetown, PE, Canada dhorrocks@upei.ca
More information6.2 Deeper Properties of Continuous Functions
6.2. DEEPER PROPERTIES OF CONTINUOUS FUNCTIONS 69 6.2 Deeper Properties of Continuous Functions 6.2. Intermediate Value Theorem and Consequences When one studies a function, one is usually interested in
More informationChris Smyth School of Mathematics and Maxwell Institute for Mathematical Sciences, University of Edinburgh, Edinburgh EH9 3JZ, UK.
THE DIVISIBILITY OF a n b n BY POWERS OF n Kálmán Győry Institute of Mathematics, University of Debrecen, Debrecen H-4010, Hungary. gyory@math.klte.hu Chris Smyth School of Mathematics and Maxwell Institute
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 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 informationON THE CONJUGACY PROBLEM AND GREENDLINGER'S EIGHTH-GROUPS
ON THE CONJUGACY PROBLEM AND GREENDLINGER'S EIGHTH-GROUPS SEYMOUR LIPSCHUTZ 1. Introduction. In 1912 Max Dehn [l], [2] solved the conjugacy problem for the fundamental group Gk of a closed 2-manifold of
More informationEE 209 Spiral 1 Exam Solutions Name:
EE 29 Spiral Exam Solutions Name:.) Answer the following questions as True or False a.) A 4-to- multiplexer requires at least 4 select lines: true / false b.) An 8-to- mux and no other logic can be used
More informationInverses and Elementary Matrices
Inverses and Elementary Matrices 1-12-2013 Matrix inversion gives a method for solving some systems of equations Suppose a 11 x 1 +a 12 x 2 + +a 1n x n = b 1 a 21 x 1 +a 22 x 2 + +a 2n x n = b 2 a n1 x
More informationThis is logically equivalent to the conjunction of the positive assertion Minimal Arithmetic and Representability
16.2. MINIMAL ARITHMETIC AND REPRESENTABILITY 207 If T is a consistent theory in the language of arithmetic, we say a set S is defined in T by D(x) if for all n, if n is in S, then D(n) is a theorem of
More informationOn the Turán number of forests
On the Turán number of forests Bernard Lidický Hong Liu Cory Palmer April 13, 01 Abstract The Turán number of a graph H, ex(n, H, is the maximum number of edges in a graph on n vertices which does not
More informationMath 203A - Solution Set 1
Math 203A - Solution Set 1 Problem 1. Show that the Zariski topology on A 2 is not the product of the Zariski topologies on A 1 A 1. Answer: Clearly, the diagonal Z = {(x, y) : x y = 0} A 2 is closed in
More informationPARTIAL NIM. Chu-Wee Lim Department of Mathematics, University of California Berkeley, Berkeley, CA , USA.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 5 (005), #G0 PARTIAL NIM Chu-Wee Lim Department of Mathematics, University of California Berkeley, Berkeley, CA 9470-3840, USA limchuwe@math.berkeley.edu
More informationHAMILTONIAN CYCLES AVOIDING SETS OF EDGES IN A GRAPH
HAMILTONIAN CYCLES AVOIDING SETS OF EDGES IN A GRAPH MICHAEL J. FERRARA, MICHAEL S. JACOBSON UNIVERSITY OF COLORADO DENVER DENVER, CO 8017 ANGELA HARRIS UNIVERSITY OF WISCONSIN-WHITEWATER WHITEWATER, WI
More informationThe maximum product of sizes of cross-t-intersecting uniform families
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 60(1 (2014, Pages 69 78 The maximum product of sizes of cross-t-intersecting uniform families Peter Borg Department of Mathematics University of Malta Malta
More informationKiddie Talk - The Diamond Lemma and its applications
Kiddie Tal - The Diamond Lemma and its applications April 22, 2013 1 Intro Start with an example: consider the following game, a solitaire. Tae a finite graph G with n vertices and a function e : V (G)
More informationThe Complete Intersection Theorem for Systems of Finite Sets
Europ. J. Combinatorics (1997) 18, 125 136 The Complete Intersection Theorem for Systems of Finite Sets R UDOLF A HLSWEDE AND L EVON H. K HACHATRIAN 1. H ISTORIAL B ACKGROUND AND THE N EW T HEOREM We are
More information