KY FAN S INEQUALITIES FOR VECTOR-VALUED MULTIFUNCTIONS IN TOPOLOGICAL ORDERED SPACES
|
|
- Marcia Cooper
- 5 years ago
- Views:
Transcription
1 Fixed Point They, 15(2014), No. 1, nodeacj/sfptcj.html KY FAN S INEQUALITIES FOR VECTOR-VALUED MULTIFUNCTIONS IN TOPOLOGICAL ORDERED SPACES NGUYEN THE VINH AND PHAM THI HOAI Department of Mathematical Analysis University of Transpt and Communications, Hanoi, Vietnam thevinhbn@gmail.com School of Applied Mathematics and Infmatics Ha Noi University of Science and Technology, Hanoi, Vietnam phamhoai051087@gmail.com Abstract. The aim of this paper is using the cone semicontinuity and cone quasiconvexity f multivalued mappings to present four variants of Ky Fan s type inequality f vect-valued multifunctions in topological dered spaces. Key Wds and Phrases: fixed point theem, multivalued mapping, Ky Fan minimax inequality, topological semilattices, C -quasiconvex (quasiconcave), C-upper (lower) semicontinuous Mathematics Subject Classification: 47H04, 49J53, 47H Introduction In 1972, Ky Fan [5] proved the following minimax inequality f real-valued functions. Theem 1.1. Let X be a Hausdff topological vect space, and let K be a nonempty compact convex subset of X. Suppose that f : K K R satisfies the following: (1) f(x, x) 0, x K; (2) y K, f(., y) is quasiconcave; (3) x K, f(x,.) is lower semicontinuous. Then there exists y K such that f(x, y ) 0, x K. The above Ky Fan minimax inequality is well known. It plays a very imptant role in many fields, such as variational inequalities, game they, mathematical economics, optimization they, and fixed point they. Because of wide applications, this inequality has been generalized in a number ways (e.g., see Allen [1], Aubin and Ekeland [2], Chang [3], Ding and Tan [4], Tian [14], Yen [16], Yuan [17], and Zhou and Chen [19], Hvath [7], Gegiev and Tanaka [6]). In the framewk of topological semilattices, Hvath and Llinares Ciscar (1996, [8]) first established an der theetical version of the classical result of Knaster-Kuratowski-Mazurkiewicz, as well as 253
2 254 NGUYEN THE VINH AND PHAM THI HOAI fixed point theems f multivalued mappings. In 2001, by using Hvath and Llinares Ciscar s results, Luo [10] proved a similar result to Theem 1.1 in topological semilattices. In 2006, Luo [11] studied Ky Fan s minimax inequalities f vect multivalued mappings in topological semilattices. However, his results does not imply scalar Ky Fan minimax inequality in the setting of topological semilattice spaces. Recently, Song and Wang [13] gave an extension of Ky Fan minimax inequality but only f vect single-valued mappings in topological semilattices. Motivated and inspired by research wks mentioned above, in this paper, we will use the cone semicontinuity and cone quasiconvexity f multivalued mappings to show four kinds of vect valued Ky Fan s type inequality f multivalued mappings. Any of our Theems implies the scalar Fan minimax inequality in topological semilattices, while the main result in [11] does not imply it in its full generality, but only f continuous functions. The rest of the paper is ganized as follows. In Section 2, we introduce about topological semilattices and recall some concepts of cone semicontinuity and cone convexity. In Section 3, we prove the existence of solutions f multivalued Ky Fan inequalities (SKFI) as an application by means of Browder-Fan fixed point theem in the setting of topological semilattices. We also give some examples to illustrate our results. 2. Preliminaries Definition 2.1. ([8]) A partially dered set (X, ) is called a sup-semilattice if any two elements x, y of X have a least upper bound, denoted by sup{x, y}. The partially dered set (X, ) is a topological semilattice if X is a sup-semilattice equipped with a topology such that the mapping is continuous. X X X (x, y) sup{x, y} We have given the definition of a sup-semilattice, we could obviously also consider inf-semilattices. When no confusion can arise we will simply use the wd semilattice. It is also evident that each nonempty finite set A of X will have a least upper bound, denoted by sup A. In a partially dered set (X, ), two arbitrary elements x and x do not have to be comparable but, in the case where x x, the set [x, x ] = {y X : x y x } is called an der interval simply, an interval. Now assume that (X, ) is a semilattice and A is a nonempty finite subset; then the set (A) = [a, sup A] a A is well defined and it has the following properties:
3 KY FAN S INEQUALITIES FOR VECTOR VALUED MULTIFUNCTIONS 255 (1) A (A); (2) if A A, then (A) (A ). We say that a subset E X is -convex if f any nonempty finite subset A E we have (A) E. Example 2.2. We consider R 2 with usual der defined by (a, b), (c, d) R 2, (a, b) (c, d) a c; b d. Clearly, (R 2, ) is a topological semilattice. (1) The set X = {(x, 1) : 0 x 1} {(1, y) : 0 y 1} is -convex but not convex in the usual sense. (2) The set X = {(x, y) : 0 x 1; y = 1 x} is convex in the usual sense but not -convex. Lemma 2.3. ([18], Lemma 1.1) Let Y be a topological vect space and C a closed, convex and pointed cone of Y with int C, where int C denotes the interi of C. Then we have int C + C int C. We now recall some concepts of generalized convexity of multivalued mappings. Let X be a nonempty convex subset of a vect space E, C be a convex cone of a vect space Y, and F : X 2 Y be a set-valued mapping with nonempty values. The mapping F is called C-quasiconvex if f all x i X, i = 1, 2 and x conv{x 1, x 2 }, either F (x) F (x 1 ) C, F (x) F (x 2 ) C. The mapping F is called C-quasiconcave if f all x i X, i = 1, 2, and x conv{x 1, x 2 }, either F (x 1 ) F (x) + C, F (x 2 ) F (x) + C. Similarly, in the setting of topological semilattices, we introduce the following definition. Definition 2.4. Let X be a topological semilattice a -convex subset of a topological semilattice, Y be a topological vect space, C Y be a convex cone. Let F : X 2 Y be a multivalued mapping with nonempty values.
4 256 NGUYEN THE VINH AND PHAM THI HOAI (1) F is called C -quasiconvex mapping if, f any pair x 1, x 2 X and f any x ({x 1, x 2 }), we have either F (x) F (x 1 ) C F (x) F (x 2 ) C. (2) F is called C -quasiconcave mapping if, f any pair x 1, x 2 X and f any x ({x 1, x 2 }), we have either F (x 1 ) F (x) + C, F (x 2 ) F (x) + C. We use instead of when F is single-valued. Remark 2.5. If Y = R = (, + ) and C = [0, + ), and F is a real function, then the C -quasiconvexity of ϕ is equivalent to the -quasiconvexity of ϕ (see [10]). Example 2.6. Let X = [0, 1] [0, 1]. We set x 1 x 2 denoting that x 2 x 1 + R 2 +, x 1, x 2 X, where R 2 + = {(y 1, y 2 ) R 2 : y 1 0, y 2 0}. It is obvious that (X, ) is a topological semilattice, in which x 1 x 2 = (max(x 1 1, x 2 1), max(x 1 2, x 2 2)), x i = (x i 1, x i 2) X, i = 1, 2. (1) Let F : X 2 R and C = R + such that F (x) = [(1 x 1 )(1 x 2 ), + ), x = (x 1, x 2 ) X. It is clear that F is C -quasiconcave mapping but not C-quasiconcave. Indeed, f x 1 = (0, 1), x 2 = (1, 0), x = 1 2 x x2 = ( 1 2, 1 2 ), we see that [ ) 1 F (x 1 ) = F (x 2 ) = [0, + ), F (x) = 4, + while F (x 1 ) = F (x 2 ) = [0, + ) F (x) + C = (2) Let F : X 2 R and C = R + such that F (x) = {x x 2 2}, x = (x 1, x 2 ) X. [ ) 1 4, +. It is easy to see that F is C-quasiconvex but not C -quasiconvex. Now, we recall the semicontinuous properties of multivalued mappings (see Ref. [2]). Let F : X 2 Y be a multivalued mapping between topological spaces X and Y. The domain of F is defined to be the set domf = {x D : F (x) }. The mapping F is upper semicontinuous (shtly, usc) at x 0 domf if, f any open set V of Y with F (x 0 ) V, there exists a neighbhood U of x 0 such that F (x) V f all x U. The mapping F is lower semicontinuous (shtly, lsc) at x 0 domf if, f any open set V of Y with F (x 0 ) V, there exists a neighbhood U of x 0 such that F (x) V f all x U.
5 KY FAN S INEQUALITIES FOR VECTOR VALUED MULTIFUNCTIONS 257 The mapping F is continuous at x 0 domf if it is both usc and lsc at x 0. The mapping F is continuous (resp. usc, lsc) if domf = X and if F is continuous (resp. usc, lsc) at each point x X. If Y is a partially dered topological vect space, then the above definitions of semicontinuous can be weakened. Me precisely, we can introduce the following definitions taken from Ref. [9, 12]. Definition 2.7. Let X be a topological space, Y be a topological vect space with a cone C. Let F : X 2 Y. We say that (1) F is C-upper semicontinuous (shtly, C-usc) at x 0 domf if f any open set V of Y with F (x 0 ) V there exists a neighbhood U of x 0 such that F (x) V + C f each x domf U. (2) F is C-lower semicontinuous (shtly, C-lsc) at x 0 domf if f any open set V of Y with F (x 0 ) V there exists a neighbhood U of x 0 such that F (x) [V C] f each x domf U. (3) F is C-usc (resp. C-lsc) if domf = X and if F is C-usc (resp. C-lsc) at each point of domf. Remark 2.8. If Y = R and C = R + = {x R : x 0} (resp. C = R + ), F is single-valued and C-usc at x 0, then F is lower semicontinuous (resp. upper semicontinuous) at x 0 in the usual sense. Remark 2.9. The upper (resp. lower) semicontinuity of F implies the C-upper (resp. C-lower) semicontinuity of F. Example 3.1 in Section 3 will show that the converse statement is no longer true. Definition Let X, Y be two topological spaces; F : X 2 Y is said to have open lower sections if F 1 (y) = {x X : y F (x)} is open f any y Y. The following lemma is a special case of [8, Collary 1, pp. 298]. Lemma (Browder-Fan fixed point theem) Let K be a nonempty compact - convex subset of a topological semilattice with path-connected intervals M, F : K 2 K with nonempty -convex values, and F 1 (y) K be open, f any y K. Then F has a fixed point. 3. Ky Fan s inequalities f vect-valued multifunctions Let X be a topological semilattice, K X a nonempty -convex subset, Y a topological vect space, A : K 2 K, f : K K 2 Y, C a closed, pointed and convex cone in Y with int C. We consider the following multivalued Ky Fan inequalities (SKFI): (SKFI1) Find x K such that x A(x), f(x, y) int C, y A(x).
6 258 NGUYEN THE VINH AND PHAM THI HOAI (SKFI2) Find x K such that (SKFI3) Find x K such that (SKFI4) Find x K such that x A(x), f(x, y) int C =, y A(x). x A(x), f(x, y) ( C), y A(x). x A(x), f(x, y) C, y A(x). The existence of solutions f the problems (SKFI1), (SKFI2), (SKFI4) were studied by Luo in [11]. However, he used either upper semicontinuous lower semicontinuous multifunctions. So, in the scalar case, the single-valued function f is continuous with respect to the first variable, and therefe, his results are weaker than the iginal fm. In this paper, we use the cone semicontinuity and cone convexity of multivalued mappings to give some genuine generalizations of scalar Ky Fan minimax inequality in the setting of topological semilattices. Theem 3.1. Let K be a nonempty compact -convex subset of a topological semilattice with path-connected intervals M, Y a topological vect space, A : K 2 K with nonempty -convex values, f : K K 2 Y, C a closed, pointed and convex cone in Y with int C. Assume that (1) A has open lower sections and B := {x K : x A(x)} is closed; (2) f(x, x) int C, x K; (3) x K, f(x,.) is C -quasiconvex; (4) y K, f(., y) is C-upper semicontinuous. Then there exists x K such that x A(x ) and f(x, y) int C, y A(x ). Proof. Define P : K 2 K by P (x) = {y K : f(x, y) int C}, x K. Suppose that there exists x K such that P (x ) is not -convex; then there exist y 1, y 2 P (x ) such that ({y 1, y 2 }) P (x ), i.e., there exists z ({y 1, y 2 }) and z P (x ); hence f(x, z) int C. By (3), we have either By Lemma 2.1, we have either f(x, z) f(x, y 1 ) + C f(x, z) f(x, y 2 ) + C. f(x, z) f(x, y 1 ) + C int C + C int C f(x, z) f(x, y 2 ) + C int C + C int C
7 KY FAN S INEQUALITIES FOR VECTOR VALUED MULTIFUNCTIONS 259 which is a contradiction. Therefe, f any x X, P (x) is -convex. Next, we prove that P 1 (y) is open f each y K. We have P 1 (y) = {x K : f(x, y) int C} F each y K and each x P 1 (y), we have f(x, y) int C. By (4), there exists a neighbhood U(x) of x such that f(x, y) int C + C int C whenever x U(x), which implies that U(x) P 1 (y), i.e., P 1 (y) is open. By Lemma 2.2, B is a nonempty set. Define S : K 2 K by { A(x) P (x), if x B, S(x) = A(x), if x K \ B. Then f any x K, S(x) is -convex. And f any y K, S 1 (y) = (A 1 (y) P 1 (y)) ((K \ B) A 1 (y)) is open. Suppose that x K, S(x) is nonempty. By Lemma 2.2, we deduce that S has a fixed point, i.e., there exists x 0 K such that x 0 S(x 0 ). If x 0 B, then x 0 S(x 0 ) = A(x 0 ) P (x 0 ). Hence x 0 P (x 0 ), f(x 0, x 0 ) int C which contradicts our assumption (2). If x 0 K \ B, then x 0 S(x 0 ) = A(x 0 ) A(x 0 ), and hence x 0 B which contradicts x 0 K \ B. Therefe, there exists x K such that S(x ) =. Since A(x) is nonempty f all x K, hence x B, S(x ) = A(x ) P (x ) =, i.e., x A(x ) and f any y A(x ), y P (x ), we have x A(x ), f(x, y) int C =, y A(x ). Therefe, the assertion of Theem 3.1 is true. In Theem 3.1, when f is single-valued, we have the following collary. Collary 3.2. Let K be a nonempty compact -convex subset of a topological semilattice with path-connected intervals M, Y a topological vect space, A : K 2 K with nonempty -convex values, f : K K Y, C a closed, pointed and convex cone in Y with int C. Assume that (1) A has open lower sections and B := {x K : x A(x)} is closed; (2) f(x, x) int C, x K; (3) x K, f(x,.) is C -quasiconvex; (4) y K, f(., y) is C-upper semicontinuous. Then there exists x K such that x A(x ) and f(x, y) int C, y A(x ). Now we give an example to explain that Collary 3.2 is applicable. Example 3.3. Let X be given in Example 2.6 and Y = R with C = R +. F each x X, let A(x) = [(0, 1), (1, 1)] [(1, 0), (1, 1)], where [(0, 1), (1, 1)] denotes the line segment joining points (0, 1) and (1, 1). Then we have: (1) f each x X, A(x) is nonempty and -convex;
8 260 NGUYEN THE VINH AND PHAM THI HOAI (2) f y = (y 1, y 2 ) X, A 1 (y) = { X if y [(0, 1), (1, 1)] [(1, 0), (1, 1)] if y X \ {[(0, 1), (1, 1)] [(1, 0), (1, 1)]} Therefe, f each y X, A 1 (y) is open in X. (3) The set B = {x X : x A(x)} = [(0, 1), (1, 1)] [(1, 0), (1, 1)] is closed. F any x = (x 1, x 2 ), y = (y 1, y 2 ) X, we define f : X X Y by { (1 + x 1 y 1 )(1 + x 2 y 2 ), if (x, y) (0, 0) f(x, y) = 2, if (x, y) = (0, 0) Then all the assumptions of Collary 3.2 are satisfied. So Collary 3.2 is applicable. The set of solutions f the (SKFI1) is the overall B. Remark 3.4. F every fixed x, following the same argument as Example 2.1 in Ref. [13], we see that f(x,.) is not a usual quasiconcave function. Indeed, f x = 0, we have { (1 y 1 )(1 y 2 ), if (y 1, y 2 ) (0, 0) f(0, y) = 2, if (y 1, y 2 ) = (0, 0) Clearly, f y 1 = (1, 0), y 2 = (0, 1), y = 1 2 y y2 = ( 1 2, 1 2 ), we see that f(0, y1 ) = 0, f(0, y 2 ) = 0, while f(0, y) = 1 4. When Y = (, + ), C = [0, + ) and A(x) = K, x K, from Collary 3.2, we get scalar Ky Fan inequality f real-valued functions in topological semilattices (see, f instance, [10, 15]). Collary 3.5. Let K be a nonempty compact -convex subset of a topological semilattice with path-connected intervals M and let f : K K R be such that (1) f(x, x) 0, x K; (2) x K, f(x,.) is -quasiconcave; (3) y K, f(., y) is lower semicontinuous. Then there exists x K such that f(x, y) 0, y K. Theem 3.6. Let K be a nonempty compact -convex subset of a topological semilattice with path-connected intervals M, Y a topological vect space, A : K 2 K with nonempty -convex values, f : K K 2 Y, C a closed, pointed and convex cone in Y with int C. Assume that (1) A has open lower sections and B := {x K : x A(x)} is closed; (2) f(x, x) int C =, x K; (3) x K, f(x,.) is C -quasiconvex; (4) y K, f(., y) is C-lower semicontinuous.
9 KY FAN S INEQUALITIES FOR VECTOR VALUED MULTIFUNCTIONS 261 Then there exists x K such that x A(x ) and f(x, y) int C =, y A(x ). Proof. Define P : K K by P (x) = {y K : f(x, y) int C }, x K. Suppose that there exists x K such that P (x ) is not -convex; then there exist y 1, y 2 P (x ) such that ({y 1, y 2 }) P (x ), i.e., there exists z ({y 1, y 2 }) and z P (x ); hence f(x, z) int C =. By (3), we have either f(x, y 1 ) f(x, z) C f(x, y 2 ) f(x, z) C. Since f(x, y i ) int C, take u i f(x, y i ) int C, i = 1, 2. Then there exist v i f(x, z) and w i C such that either u 1 = v 1 w 1 u 2 = v 2 w 2. By Lemma 2.1, we have either v 1 = u 1 + w 1 int C v 2 = u 2 + w 2 int C which contradicts f(x, z) int C =. Therefe, f any x X, P (x) is -convex. Next, we prove that P 1 (y) is open f each y K. We have P 1 (y) = {x K : f(x, y) int C }. Take arbitrarily x P 1 (y), we have f(x, y) int C. By assumption (4), there exists an open neighbhood U(x) such that f(x, y) (int C + C) = f(x, y) int C, f all x U(x). Let {x α } be any net in D converging to x, hence there exists β such that x α U, α β and then f(x α, y) int C, which contradicts x α D. Therefe, x D and D is closed. Consequently, we infer that P 1 (y) is open f each y K. The rest of the proof is similar to that of Theem 3.1. Hence the proof is complete. Theem 3.7. Let K be a nonempty compact -convex subset of a topological semilattice with path-connected intervals M, Y a topological vect space, A : K 2 K with nonempty -convex values, f : K K 2 Y, C a closed, pointed and convex cone in Y with int C. Assume that (1) A has open lower sections and B := {x K : x A(x)} is closed; (2) f(x, x) ( C), x K; (3) x K, f(x,.) is C -quasiconvex; (4) y K, f(., y) is C-upper semicontinuous. Then there exists x K such that x A(x ) and f(x, y) ( C), y A(x ). Proof. Define P : K 2 K by P (x) = {y K : f(x, y) ( C) = }, x K. Suppose that there exists x K such that P (x ) is not -convex; then there exist y 1, y 2 P (x ) such that ({y 1, y 2 }) P (x ), i.e., there exists z ({y 1, y 2 }) and
10 262 NGUYEN THE VINH AND PHAM THI HOAI z P (x ); hence f(x, z) ( C). Take u f(x, z) ( C). By (3), we have either f(x, z) f(x, y 1 ) + C f(x, z) f(x, y 2 ) + C. Since u f(x, z), then there exist v i f(x, y i ) and w i C such that either u = v 1 + w 1 u = v 2 + w 2. Therefe either v 1 = u w 1 C v 2 = u w 2 C, which is a contradiction. Therefe, f any x X, P (x) is -convex. Next, we prove that P 1 (y) is open f each y K. We have Take arbitrarily x P 1 (y), we have P 1 (y) = {x K : f(x, y) ( C) = }. f(x, y) ( C) = f(x, y) Y \ ( C). By assumption (4), there exists an open neighbhood U(x) such that f(x, y) Y \ ( C) + C Y \ ( C), f all x U(x), it means f(x, y) ( C) = f all x U(x). We infer that P 1 (y) is open f each y K. The rest of the proof is similar to that of Theem 3.1. Hence our proof is finished. Theem 3.8. Let K be a nonempty compact -convex subset of a topological semilattice with path-connected intervals M, Y a topological vect space, A : K 2 K with nonempty -convex values, f : K K 2 Y, C a closed, pointed and convex cone in Y with int C. Assume that (1) A has open lower sections and B := {x K : x A(x)} is closed; (2) f(x, x) C, x K; (3) x K, f(x,.) is C -quasiconcave; (4) y K, f(., y) is C-lower semicontinuous. Then there exists x K such that x A(x ) and f(x, y) C, y A(x ). Proof. Define P : K 2 K by P (x) = {y K : f(x, y) C}, x K. Suppose that there exists x K such that P (x ) is not -convex; then there exist y 1, y 2 P (x ) such that ({y 1, y 2 }) P (x ), i.e., there exists z ({y 1, y 2 }) and z P (x ); hence f(x, z) C. By (3), we have either Consequently, we have either f(x, y 1 ) f(x, z) C f(x, y 2 ) f(x, z) C. f(x, y 1 ) f(x, z) C C C C
11 KY FAN S INEQUALITIES FOR VECTOR VALUED MULTIFUNCTIONS 263 f(x, y 2 ) f(x, z) C C C C, which is a contradiction. Therefe, f any x X, P (x) is -convex. Next, we prove that P 1 (y) is open f each y K. We have P 1 (y) = {x K : f(x, y) C}. Take arbitrarily x P 1 (y), we have f(x, y) C. It is equivalent to f(x, y) [Y \( C)]. By assumption (4), there exists an open neighbhood U(x) such that f(x, y) [Y \ ( C) + C], f all x U(x). Since Y \ ( C) + C Y \ ( C), it follows that f(x, y) [Y \ ( C)], f all x U(x). Therefe f(x, y) C f all x U(x). We infer that P 1 (y) is open f each y K. The rest of the proof is similar to that of Theem 3.1. Hence our proof is finished. Acknowledgment. This research is funded by Vietnam National Foundation f Science and Technology Development (NAFOSTED). References [1] G. Allen, Variational inequalities, complementarity problems and duality theems, J. Math. Anal. Appl., 58(1977), [2] J.P. Aubin, I. Ekeland, Applied Nonlinear Analysis, John Wiley, New Yk, [3] S.S. Chang, Y. Zhang, Generalized KKM theem and variational inequalities, J. Math. Anal. Appl., 159(1991), [4] X.P. Ding, K.K. Tan, A minimax inequality with applications to existence of equilibrium point and fixed point theems, Colloq. Math., 63(1992), [5] K. Fan, A minimax inequality and applications, in: Inequalities III. (O. Shisha, ed.) Proc. of the Third Symposium on Inequalities, Academic Press, New Yk, [6] P.G. Gegiev, T. Tanaka, Fan s inequality f set-valued maps, Nonlinear Anal., 47(2001), [7] C.D. Hvath, Contractibility and generalized convexity, J. Math. Anal. Appl., 156(1991), [8] C.D. Hvath, J.V. Llinares Ciscar, Maximal elements and fixed points f binary relations on topological dered spaces, J. Math. Econom., 25(1996), [9] D.T. Luc, They of Vect Optimization, in Lecture Notes in Economics and Mathematical Systems, Vol. 319, Springer-Verlag, Berlin, [10] Q. Luo, KKM and Nash equilibria type theems in topological dered spaces, J. Math. Anal. Appl., 264(2001), [11] Q. Luo, The applications of the Fan-Browder fixed point theem in topological dered spaces, Appl. Math. Lett., 19(2006), [12] P.H. Sach, New nonlinear scalarization functions and applications, Nonlinear Anal., 75(2012), [13] Q.Q. Song, L.S. Wang, The existence of solutions f the system of vect quasi-equilibrium problems in topological der spaces, Comput. Math. Appl., 62(2011), [14] G. Tian, Generalized KKM theems, minimax inequalities, and their applications, J. Optim. They Appl., 83(1994), [15] N.T. Vinh, Matching theems, fixed point theems and minimax inequalities in topological dered spaces, Acta Math. Vietnam., 30(2005),
12 264 NGUYEN THE VINH AND PHAM THI HOAI [16] C.L. Yen, A minimax inequality and its applications to variational inequalities, Pacific J. Math., 97(1981), [17] X.Z. Yuan, KKM principle, Ky Fan minimax inequalities and fixed point theems, Nonlinear Wld, 2(1995), [18] H. Yang, J. Yu, Essential component of the set of weakly Pareto-Nash equilibrium points, Appl. Math. Lett., 15(2002), [19] J. Zhou, G. Chen, Diagonal convexity conditions f problems in convex analysis and quasivariational inequalities, J. Math. Anal. Appl., 132(1988), Received: May 2, 2012; Accepted: March 28, 2013.
Ky Fan minimax inequalities for set-valued mappings
RESEARCH Ky Fan minimax inequalities for set-valued mappings Yu Zhang 1* and Sheng-Jie Li 1,2 Open Access * Correspondence: zhangyu198606@sina.com 1 College of Mathematics and Statistics, Chongqing University,
More informationStrongly nonlinear elliptic problem without growth condition
2002-Fez conference on Partial Differential Equations, Electronic Journal of Differential Equations, Conference 09, 2002, pp 41 47. http://ejde.math.swt.edu or http://ejde.math.unt.edu ftp ejde.math.swt.edu
More informationMonotone Comparative Statics 1
John Nachbar Washington University March 27, 2016 1 Overview Monotone Comparative Statics 1 Given an optimization problem indexed by some parameter θ, comparative statics seeks a qualitative understanding
More informationM.Tolotti - Mathematics (Preparatory) - September Exercises. Maximize p(g(x))g(x) q x subject to x R +
M.Tolotti - Mathematics (Preparatory) - September 2010 1 Exercises EXERCISE 1. where Maximize p(g(x))g(x) q x subject to x R + p : R R is constant, i.e. p(g(x)) = p = 1 for all x. g(x) = 35x x 2. q = 10.
More informationMATHEMATICS ON THE CHESSBOARD
MATHEMATICS ON THE CHESSBOARD Problem 1. Consider a 8 8 chessboard and remove two diametrically opposite corner unit squares. Is it possible to cover (without overlapping) the remaining 62 unit squares
More informationInternational Journal of Mathematical Archive-5(6), 2014, Available online through ISSN
International Journal of Mathematical Archive-5(6), 2014, 119-124 Available online through www.ijma.info ISSN 2229 5046 CLOSURE OPERATORS ON COMPLETE ALMOST DISTRIBUTIVE LATTICES-I G. C. Rao Department
More informationContinuity of the Norm of a Composition Operator
Integr. equ. oper. theory 45 (003) 35 358 0378-60X/03035-8 $.50+0.0/0 c 003 Birkhäuser Verlag Basel/Switzerl Integral Equations Operator Theory Continuity of the Norm of a Composition Operator David B.
More informationarxiv:math/ v1 [math.cv] 12 Dec 2005
arxiv:math/0512241v1 [math.cv] 12 Dec 2005 The pluri-fine topology is locally connected Said El Marzguioui and Jan Wiegerinck November 1, 2018 Abstract We prove that the pluri-fine topology on any open
More informationGame Theory and Randomized Algorithms
Game Theory and Randomized Algorithms Guy Aridor Game theory is a set of tools that allow us to understand how decisionmakers interact with each other. It has practical applications in economics, international
More informationProofs of a Trigonometric Inequality
Proofs of a Trigonometric Inequality Abstract A trigonometric inequality is introduced and proved using Hölder s inequality Cauchy-Schwarz inequality and Chebyshev s order inequality AMS Subject Classification:
More informationQUOTIENT AND PSEUDO-OPEN IMAGES OF SEPARABLE METRIC SPACES
proceedings of the american mathematical society Volume 33, Number 2, June 1972 QUOTIENT AND PSEUDO-OPEN IMAGES OF SEPARABLE METRIC SPACES PAUL L. STRONG Abstract. Ernest A. Michael has given a characterization
More informationDiscussion 8 Solution Thursday, February 10th. Consider the function f(x, y) := y 2 x 2.
Discussion 8 Solution Thursday, February 10th. 1. Consider the function f(x, y) := y 2 x 2. (a) This function is a mapping from R n to R m. Determine the values of n and m. The value of n is 2 corresponding
More informationNote: A player has, at most, one strictly dominant strategy. When a player has a dominant strategy, that strategy is a compelling choice.
Game Theoretic Solutions Def: A strategy s i 2 S i is strictly dominated for player i if there exists another strategy, s 0 i 2 S i such that, for all s i 2 S i,wehave ¼ i (s 0 i ;s i) >¼ i (s i ;s i ):
More informationTopic 1: defining games and strategies. SF2972: Game theory. Not allowed: Extensive form game: formal definition
SF2972: Game theory Mark Voorneveld, mark.voorneveld@hhs.se Topic 1: defining games and strategies Drawing a game tree is usually the most informative way to represent an extensive form game. Here is one
More informationTOPOLOGY, LIMITS OF COMPLEX NUMBERS. Contents 1. Topology and limits of complex numbers 1
TOPOLOGY, LIMITS OF COMPLEX NUMBERS Contents 1. Topology and limits of complex numbers 1 1. Topology and limits of complex numbers Since we will be doing calculus on complex numbers, not only do we need
More informationMinimal generating sets of Weierstrass semigroups of certain m-tuples on the norm-trace function field
Minimal generating sets of Weierstrass semigroups of certain m-tuples on the norm-trace function field Gretchen L. Matthews and Justin D. Peachey Abstract. The norm-trace function field is a generalization
More informationGeneralized Ordered Whist Tournaments for 6n+1 Players
Rhode Island College Digital Commons @ RIC Hons Projects Overview Hons Projects 5-7-2013 Generalized Ordered Whist Tournaments f 6n+1 Players Elyssa Cipriano Rhode Island College, ecipriano_4212@ric.edu
More informationPermutation Tableaux and the Dashed Permutation Pattern 32 1
Permutation Tableaux and the Dashed Permutation Pattern William Y.C. Chen, Lewis H. Liu, Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 7, P.R. China chen@nankai.edu.cn, lewis@cfc.nankai.edu.cn
More informationSymmetric Decentralized Interference Channels with Noisy Feedback
4 IEEE International Symposium on Information Theory Symmetric Decentralized Interference Channels with Noisy Feedback Samir M. Perlaza Ravi Tandon and H. Vincent Poor Institut National de Recherche en
More informationDEPARTMENT OF ECONOMICS WORKING PAPER SERIES. Stable Networks and Convex Payoffs. Robert P. Gilles Virginia Tech University
DEPARTMENT OF ECONOMICS WORKING PAPER SERIES Stable Networks and Convex Payoffs Robert P. Gilles Virginia Tech University Sudipta Sarangi Louisiana State University Working Paper 2005-13 http://www.bus.lsu.edu/economics/papers/pap05_13.pdf
More informationSOLUTIONS FOR PROBLEM SET 4
SOLUTIONS FOR PROBLEM SET 4 A. A certain integer a gives a remainder of 1 when divided by 2. What can you say about the remainder that a gives when divided by 8? SOLUTION. Let r be the remainder that a
More informationNon-overlapping permutation patterns
PU. M. A. Vol. 22 (2011), No.2, pp. 99 105 Non-overlapping permutation patterns Miklós Bóna Department of Mathematics University of Florida 358 Little Hall, PO Box 118105 Gainesville, FL 326118105 (USA)
More informationFunctions of several variables
Chapter 6 Functions of several variables 6.1 Limits and continuity Definition 6.1 (Euclidean distance). Given two points P (x 1, y 1 ) and Q(x, y ) on the plane, we define their distance by the formula
More informationNON-OVERLAPPING PERMUTATION PATTERNS. To Doron Zeilberger, for his Sixtieth Birthday
NON-OVERLAPPING PERMUTATION PATTERNS MIKLÓS BÓNA Abstract. We show a way to compute, to a high level of precision, the probability that a randomly selected permutation of length n is nonoverlapping. As
More informationEnumeration of Two Particular Sets of Minimal Permutations
3 47 6 3 Journal of Integer Sequences, Vol. 8 (05), Article 5.0. Enumeration of Two Particular Sets of Minimal Permutations Stefano Bilotta, Elisabetta Grazzini, and Elisa Pergola Dipartimento di Matematica
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Define and compute the cardinality of a set. Use functions to compare the sizes of sets. Classify sets
More informationTopology and its Applications
Topology and its Applications 157 (2010) 1541 1547 Contents lists available at ScienceDirect Topology and its Applications www.elsevier.com/locate/topol On a core concept of Arhangel skiĭ Franklin D. Tall
More informationGame Theory and Economics of Contracts Lecture 4 Basics in Game Theory (2)
Game Theory and Economics of Contracts Lecture 4 Basics in Game Theory (2) Yu (Larry) Chen School of Economics, Nanjing University Fall 2015 Extensive Form Game I It uses game tree to represent the games.
More informationUnivalence Conditions for a New Family of Integral Operators
Filomat 30:5 (2016, 1243 1251 DOI 10.2298/FIL1605243O Published by Faculty of Sciences Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Univalence Conditions for a New
More informationSOLUTIONS TO PROBLEM SET 5. Section 9.1
SOLUTIONS TO PROBLEM SET 5 Section 9.1 Exercise 2. Recall that for (a, m) = 1 we have ord m a divides φ(m). a) We have φ(11) = 10 thus ord 11 3 {1, 2, 5, 10}. We check 3 1 3 (mod 11), 3 2 9 (mod 11), 3
More informationSolutions to the problems from Written assignment 2 Math 222 Winter 2015
Solutions to the problems from Written assignment 2 Math 222 Winter 2015 1. Determine if the following limits exist, and if a limit exists, find its value. x2 y (a) The limit of f(x, y) = x 4 as (x, y)
More informationSTRATEGY AND COMPLEXITY OF THE GAME OF SQUARES
STRATEGY AND COMPLEXITY OF THE GAME OF SQUARES FLORIAN BREUER and JOHN MICHAEL ROBSON Abstract We introduce a game called Squares where the single player is presented with a pattern of black and white
More informationCharacterization of regular semigroup through interval valued fuzzy ideals. N. Thillaigovindan, V. Chinnadurai, S. Coumaressane
Annals of Fuzzy Mathematics and Informatics Volume 11, No. 5, (May 2016), pp. 769 781 ISSN: 2093 9310 (print version) ISSN: 2287 6235 (electronic version) http://www.afmi.or.kr @FMI c Kyung Moon Sa Co.
More informationZhanjiang , People s Republic of China
Math. Comp. 78(2009), no. 267, 1853 1866. COVERS OF THE INTEGERS WITH ODD MODULI AND THEIR APPLICATIONS TO THE FORMS x m 2 n AND x 2 F 3n /2 Ke-Jian Wu 1 and Zhi-Wei Sun 2, 1 Department of Mathematics,
More informationBAND SURGERY ON KNOTS AND LINKS, III
BAND SURGERY ON KNOTS AND LINKS, III TAIZO KANENOBU Abstract. We give two criteria of links concerning a band surgery: The first one is a condition on the determinants of links which are related by a band
More informationA STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A31 A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP Shinji Tanimoto Department of Mathematics, Kochi Joshi University
More informationThe Strong Finiteness of Double Mersenne Primes and the Infinity of Root Mersenne Primes and Near-square Primes of Mersenne Primes
The Strong Finiteness of Double Mersenne Primes and the Infinity of Root Mersenne Primes and Near-square Primes of Mersenne Primes Pingyuan Zhou E-mail:zhoupingyuan49@hotmail.com Abstract In this paper
More informationPermutation Tableaux and the Dashed Permutation Pattern 32 1
Permutation Tableaux and the Dashed Permutation Pattern William Y.C. Chen and Lewis H. Liu Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin, P.R. China chen@nankai.edu.cn, lewis@cfc.nankai.edu.cn
More information2.1 Partial Derivatives
.1 Partial Derivatives.1.1 Functions of several variables Up until now, we have only met functions of single variables. From now on we will meet functions such as z = f(x, y) and w = f(x, y, z), which
More informationWe like to depict a vector field by drawing the outputs as vectors with their tails at the input (see below).
Math 55 - Vector Calculus II Notes 4. Vector Fields A function F is a vector field on a subset S of R n if F is a function from S to R n. particular, this means that F(x, x,..., x n ) = f (x, x,..., x
More informationResearch Article Some New Sets and Topologies in Ideal Topological Spaces
Chinese Mathematics Volume 2013, Article ID 973608, 6 pages http://dx.doi.org/10.1155/2013/973608 Research Article Some New Sets and Topologies in Ideal Topological Spaces R. Manoharan 1 and P. Thangavelu
More informationStanford University CS261: Optimization Handout 9 Luca Trevisan February 1, 2011
Stanford University CS261: Optimization Handout 9 Luca Trevisan February 1, 2011 Lecture 9 In which we introduce the maximum flow problem. 1 Flows in Networks Today we start talking about the Maximum Flow
More informationSF2972 Game Theory Written Exam March 17, 2011
SF97 Game Theory Written Exam March 7, Time:.-9. No permitted aids Examiner: Boualem Djehiche The exam consists of two parts: Part A on classical game theory and Part B on combinatorial game theory. Each
More informationLECTURE 3: CONGRUENCES. 1. Basic properties of congruences We begin by introducing some definitions and elementary properties.
LECTURE 3: CONGRUENCES 1. Basic properties of congruences We begin by introducing some definitions and elementary properties. Definition 1.1. Suppose that a, b Z and m N. We say that a is congruent to
More informationIndependence of Path and Conservative Vector Fields
Independence of Path and onservative Vector Fields MATH 311, alculus III J. Robert Buchanan Department of Mathematics Summer 2011 Goal We would like to know conditions on a vector field function F(x, y)
More information1.6 Congruence Modulo m
1.6 Congruence Modulo m 47 5. Let a, b 2 N and p be a prime. Prove for all natural numbers n 1, if p n (ab) and p - a, then p n b. 6. In the proof of Theorem 1.5.6 it was stated that if n is a prime number
More informationand problem sheet 7
1-18 and 15-151 problem sheet 7 Solutions to the following five exercises and optional bonus problem are to be submitted through gradescope by 11:30PM on Friday nd November 018. Problem 1 Let A N + and
More informationSummary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility
Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility theorem (consistent decisions under uncertainty should
More informationA variation on the game SET
A variation on the game SET David Clark 1, George Fisk 2, and Nurullah Goren 3 1 Grand Valley State University 2 University of Minnesota 3 Pomona College June 25, 2015 Abstract Set is a very popular card
More informationMulti-Agent Bilateral Bargaining and the Nash Bargaining Solution
Multi-Agent Bilateral Bargaining and the Nash Bargaining Solution Sang-Chul Suh University of Windsor Quan Wen Vanderbilt University December 2003 Abstract This paper studies a bargaining model where n
More informationDynamic Programming in Real Life: A Two-Person Dice Game
Mathematical Methods in Operations Research 2005 Special issue in honor of Arie Hordijk Dynamic Programming in Real Life: A Two-Person Dice Game Henk Tijms 1, Jan van der Wal 2 1 Department of Econometrics,
More informationDomination game and minimal edge cuts
Domination game and minimal edge cuts Sandi Klavžar a,b,c Douglas F. Rall d a Faculty of Mathematics and Physics, University of Ljubljana, Slovenia b Faculty of Natural Sciences and Mathematics, University
More informationVariations on a Theme of Sierpiński
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 10 (2007), Article 07.4.4 Variations on a Theme of Sierpiński Lenny Jones Department of Mathematics Shippensburg University Shippensburg, Pennsylvania
More informationON COMMUTATION PROPERTIES OF THE COMPOSITION RELATION OF CONVERGENT AND DIVERGENT PERMUTATIONS (PART I)
t m Mathematical Publications DOI: 10.2478/tmmp-2014-0002 Tatra Mt. Math. Publ. 58 (2014), 13 22 ON COMMUTATION PROPERTIES OF THE COMPOSITION RELATION OF CONVERGENT AND DIVERGENT PERMUTATIONS (PART I)
More informationCongruences Modulo Small Powers of 2 and 3 for Partitions into Odd Designated Summands
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 0 (017), Article 17.4.3 Congruences Modulo Small Powers of 3 for Partitions into Odd Designated Summs B. Hemanthkumar Department of Mathematics M. S. Ramaiah
More informationLossy Compression of Permutations
204 IEEE International Symposium on Information Theory Lossy Compression of Permutations Da Wang EECS Dept., MIT Cambridge, MA, USA Email: dawang@mit.edu Arya Mazumdar ECE Dept., Univ. of Minnesota Twin
More informationGame Theory and Algorithms Lecture 3: Weak Dominance and Truthfulness
Game Theory and Algorithms Lecture 3: Weak Dominance and Truthfulness March 1, 2011 Summary: We introduce the notion of a (weakly) dominant strategy: one which is always a best response, no matter what
More informationLECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI
LECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI 1. Hensel Lemma for nonsingular solutions Although there is no analogue of Lagrange s Theorem for prime power moduli, there is an algorithm for determining
More informationConstructions of Coverings of the Integers: Exploring an Erdős Problem
Constructions of Coverings of the Integers: Exploring an Erdős Problem Kelly Bickel, Michael Firrisa, Juan Ortiz, and Kristen Pueschel August 20, 2008 Abstract In this paper, we study necessary conditions
More informationOn uniquely k-determined permutations
On uniquely k-determined permutations Sergey Avgustinovich and Sergey Kitaev 16th March 2007 Abstract Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce
More informationChapter 1. The alternating groups. 1.1 Introduction. 1.2 Permutations
Chapter 1 The alternating groups 1.1 Introduction The most familiar of the finite (non-abelian) simple groups are the alternating groups A n, which are subgroups of index 2 in the symmetric groups S n.
More informationMinimal tilings of a unit square
arxiv:1607.00660v1 [math.mg] 3 Jul 2016 Minimal tilings of a unit square Iwan Praton Franklin & Marshall College Lancaster, PA 17604 Abstract Tile the unit square with n small squares. We determine the
More informationA theorem on the cores of partitions
A theorem on the cores of partitions Jørn B. Olsson Department of Mathematical Sciences, University of Copenhagen Universitetsparken 5,DK-2100 Copenhagen Ø, Denmark August 9, 2008 Abstract: If s and t
More informationPermutation Groups. Every permutation can be written as a product of disjoint cycles. This factorization is unique up to the order of the factors.
Permutation Groups 5-9-2013 A permutation of a set X is a bijective function σ : X X The set of permutations S X of a set X forms a group under function composition The group of permutations of {1,2,,n}
More informationPareto Optimization for Uplink NOMA Power Control
Pareto Optimization for Uplink NOMA Power Control Eren Balevi, Member, IEEE, and Richard D. Gitlin, Life Fellow, IEEE Department of Electrical Engineering, University of South Florida Tampa, Florida 33620,
More informationExtensive-Form Correlated Equilibrium: Definition and Computational Complexity
MATHEMATICS OF OPERATIONS RESEARCH Vol. 33, No. 4, November 8, pp. issn 364-765X eissn 56-547 8 334 informs doi.87/moor.8.34 8 INFORMS Extensive-Form Correlated Equilibrium: Definition and Computational
More informationThe tenure game. The tenure game. Winning strategies for the tenure game. Winning condition for the tenure game
The tenure game The tenure game is played by two players Alice and Bob. Initially, finitely many tokens are placed at positions that are nonzero natural numbers. Then Alice and Bob alternate in their moves
More informationTHREE LECTURES ON SQUARE-TILED SURFACES (PRELIMINARY VERSION) Contents
THREE LECTURES ON SQUARE-TILED SURFACES (PRELIMINARY VERSION) CARLOS MATHEUS Abstract. This text corresponds to a minicourse delivered on June 11, 12 & 13, 2018 during the summer school Teichmüller dynamics,
More informationTilings with T and Skew Tetrominoes
Quercus: Linfield Journal of Undergraduate Research Volume 1 Article 3 10-8-2012 Tilings with T and Skew Tetrominoes Cynthia Lester Linfield College Follow this and additional works at: http://digitalcommons.linfield.edu/quercus
More informationSYMMETRIES OF FIBONACCI POINTS, MOD m
PATRICK FLANAGAN, MARC S. RENAULT, AND JOSH UPDIKE Abstract. Given a modulus m, we examine the set of all points (F i,f i+) Z m where F is the usual Fibonacci sequence. We graph the set in the fundamental
More informationInternational Journal of Multidisciplinary Research and Development 2015; 2(2): Mani Laxman Aiyar, Ravi Prakash G
2015; 2(2): 317-326 IJMRD 2015; 2(2): 317-326 www.allsubjectjournal.com Received: 02-02-2015 Accepted: 18-02-2015 E-ISSN: 2349-4182 P-ISSN: 2349-5979 Impact factor: 3.762 Mani Laxman Aiyar ECE Dept., Alliance
More informationTwo-person symmetric whist
Two-person symmetric whist Johan Wästlund Linköping studies in Mathematics, No. 4, February 21, 2005 Series editor: Bengt Ove Turesson The publishers will keep this document on-line on the Internet (or
More information#A2 INTEGERS 18 (2018) ON PATTERN AVOIDING INDECOMPOSABLE PERMUTATIONS
#A INTEGERS 8 (08) ON PATTERN AVOIDING INDECOMPOSABLE PERMUTATIONS Alice L.L. Gao Department of Applied Mathematics, Northwestern Polytechnical University, Xi an, Shaani, P.R. China llgao@nwpu.edu.cn Sergey
More informationFinite homomorphism-homogeneous permutations via edge colourings of chains
Finite homomorphism-homogeneous permutations via edge colourings of chains Igor Dolinka dockie@dmi.uns.ac.rs Department of Mathematics and Informatics, University of Novi Sad First of all there is Blue.
More informationSOLITAIRE CLOBBER AS AN OPTIMIZATION PROBLEM ON WORDS
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #G04 SOLITAIRE CLOBBER AS AN OPTIMIZATION PROBLEM ON WORDS Vincent D. Blondel Department of Mathematical Engineering, Université catholique
More informationSOME CONSTRUCTIONS OF MUTUALLY ORTHOGONAL LATIN SQUARES AND SUPERIMPOSED CODES
Discrete Mathematics, Algorithms and Applications Vol 4, No 3 (2012) 1250022 (8 pages) c World Scientific Publishing Company DOI: 101142/S179383091250022X SOME CONSTRUCTIONS OF MUTUALLY ORTHOGONAL LATIN
More information1 Simultaneous move games of complete information 1
1 Simultaneous move games of complete information 1 One of the most basic types of games is a game between 2 or more players when all players choose strategies simultaneously. While the word simultaneously
More informationAN EXAMPLE OF A COMMUTATIVE BASIC ALGEBRA WHICH IS NOT AN MV-ALGEBRA
ao DOI: 10.2478/s12175-010-0003-0 Math. Slovaca 60 (2010), No. 2, 171 178 AN EXAMPLE OF A COMMUTATIVE BASIC ALGEBRA WHICH IS NOT AN MV-ALGEBRA Michal Botur (Communicated by Anatolij Dvurečenskij ) ABSTRACT.
More informationby Michael Filaseta University of South Carolina
by Michael Filaseta University of South Carolina Background: A covering of the integers is a system of congruences x a j (mod m j, j =, 2,..., r, with a j and m j integral and with m j, such that every
More informationMath236 Discrete Maths with Applications
Math236 Discrete Maths with Applications P. Ittmann UKZN, Pietermaritzburg Semester 1, 2012 Ittmann (UKZN PMB) Math236 2012 1 / 43 The Multiplication Principle Theorem Let S be a set of k-tuples (s 1,
More informationA Survey on Supermodular Games
A Survey on Supermodular Games Ashiqur R. KhudaBukhsh December 27, 2006 Abstract Supermodular games are an interesting class of games that exhibits strategic complementarity. There are several compelling
More informationSome constructions of mutually orthogonal latin squares and superimposed codes
University of Wollongong Research Online Faculty of Engineering and Information Sciences - Papers: Part A Faculty of Engineering and Information Sciences 2012 Some constructions of mutually orthogonal
More informationSimple permutations and pattern restricted permutations
Simple permutations and pattern restricted permutations M.H. Albert and M.D. Atkinson Department of Computer Science University of Otago, Dunedin, New Zealand. Abstract A simple permutation is one that
More information12th Bay Area Mathematical Olympiad
2th Bay Area Mathematical Olympiad February 2, 200 Problems (with Solutions) We write {a,b,c} for the set of three different positive integers a, b, and c. By choosing some or all of the numbers a, b and
More informationcode V(n,k) := words module
Basic Theory Distance Suppose that you knew that an English word was transmitted and you had received the word SHIP. If you suspected that some errors had occurred in transmission, it would be impossible
More informationMechanism Design without Money II: House Allocation, Kidney Exchange, Stable Matching
Algorithmic Game Theory Summer 2016, Week 8 Mechanism Design without Money II: House Allocation, Kidney Exchange, Stable Matching ETH Zürich Peter Widmayer, Paul Dütting Looking at the past few lectures
More informationDEGRADED broadcast channels were first studied by
4296 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 54, NO 9, SEPTEMBER 2008 Optimal Transmission Strategy Explicit Capacity Region for Broadcast Z Channels Bike Xie, Student Member, IEEE, Miguel Griot,
More informationOptimal Spectrum Management in Multiuser Interference Channels
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 59, NO. 8, AUGUST 2013 4961 Optimal Spectrum Management in Multiuser Interference Channels Yue Zhao,Member,IEEE, and Gregory J. Pottie, Fellow, IEEE Abstract
More informationOn the isomorphism problem of Coxeter groups and related topics
On the isomorphism problem of Coxeter groups and related topics Koji Nuida 1 Graduate School of Mathematical Sciences, University of Tokyo E-mail: nuida@ms.u-tokyo.ac.jp At the conference the author gives
More informationIntroduction to Computational Manifolds and Applications
IMPA - Instituto de Matemática Pura e Aplicada, Rio de Janeiro, RJ, Brazil Introduction to Computational Manifolds and Applications Part 1 - Foundations Prof. Jean Gallier jean@cis.upenn.edu Department
More informationA NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA
A NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA JOEL LOUWSMA, ADILSON EDUARDO PRESOTO, AND ALAN TARR Abstract. Krakowski and Regev found a basis of polynomial identities satisfied
More informationCardinality of Accumulation Points of Infinite Sets
International Mathematical Forum, Vol. 11, 2016, no. 11, 539-546 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2016.6224 Cardinality of Accumulation Points of Infinite Sets A. Kalapodi CTI
More informationREVIEW SHEET FOR MIDTERM 2: ADVANCED
REVIEW SHEET FOR MIDTERM : ADVANCED MATH 195, SECTION 59 (VIPUL NAIK) To maximize efficiency, please bring a copy (print or readable electronic) of this review sheet to the review session. The document
More informationPattern Avoidance in Unimodal and V-unimodal Permutations
Pattern Avoidance in Unimodal and V-unimodal Permutations Dido Salazar-Torres May 16, 2009 Abstract A characterization of unimodal, [321]-avoiding permutations and an enumeration shall be given.there is
More informationMaxima and Minima. Terminology note: Do not confuse the maximum f(a, b) (a number) with the point (a, b) where the maximum occurs.
10-11-2010 HW: 14.7: 1,5,7,13,29,33,39,51,55 Maxima and Minima In this very important chapter, we describe how to use the tools of calculus to locate the maxima and minima of a function of two variables.
More informationLecture 5: Subgame Perfect Equilibrium. November 1, 2006
Lecture 5: Subgame Perfect Equilibrium November 1, 2006 Osborne: ch 7 How do we analyze extensive form games where there are simultaneous moves? Example: Stage 1. Player 1 chooses between fin,outg If OUT,
More informationOutline. Sets of Gluing Data. Constructing Manifolds. Lecture 3 - February 3, PM
Constructing Manifolds Lecture 3 - February 3, 2009-1-2 PM Outline Sets of gluing data The cocycle condition Parametric pseudo-manifolds (PPM s) Conclusions 2 Let n and k be integers such that n 1 and
More informationThe pairing strategies of the 9-in-a-row game
ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 16 (2019) 97 109 https://doi.org/10.26493/1855-3974.1350.990 (Also available at http://amc-journal.eu) The
More informationUnique Sequences Containing No k-term Arithmetic Progressions
Unique Sequences Containing No k-term Arithmetic Progressions Tanbir Ahmed Department of Computer Science and Software Engineering Concordia University, Montréal, Canada ta ahmed@cs.concordia.ca Janusz
More informationFinal exam. Question Points Score. Total: 150
MATH 11200/20 Final exam DECEMBER 9, 2016 ALAN CHANG Please present your solutions clearly and in an organized way Answer the questions in the space provided on the question sheets If you run out of room
More information