Journal of Inequalities in Pure and Applied Mathematics
|
|
- Baldwin Parrish
- 5 years ago
- Views:
Transcription
1 Journal of Inequalities in Pure and Applied Mathematics SOME BOAS-BELLMAN TYPE INEQUALITIES IN -INNER PRODUCT SPACES S.S. DRAGOMIR, Y.J. CHO, S.S. KIM, AND A. SOFO School of Computer Science and Mathematics Victoria University of Technology PO Box 1448, MCMC Victoria 8001, Australia. URL: Department of Mathematics College of Education Gyeongsang National University Chinju , Korea. Department of Mathematics Dongeui University Pusan , Korea. School of Computer Science and Mathematics Victoria University of Technology PO Box 1448, MCMC Victoria 8001, Australia. URL: c 000 Victoria University ISSN (electronic): volume 6, issue, article 55, 005. Received 01 April, 005; accepted 3 April, 005. Communicated by: J.M. Rassias Abstract Home Page
2 Abstract Some inequalities in -inner product spaces generalizing Bessel s result that are similar to the Boas-Bellman inequality from inner product spaces, are given. Applications for determinantal integral inequalities are also provided. 000 Mathematics Subject Classification: 6D15, 6D10, 46C05, 46C99. Key words: Bessel s inequality in -Inner Product, Boas-Bellman type inequalities, -Inner Products, -Norms. S.S. Dragomir and Y.J. Cho greatly acknowledge the financial support from the Brain Pool Program (00) of the Korean Federation of Science and Technology Societies. The research was performed under the "Memorandum of Understanding" between Victoria University and Gyeongsang National University. 1 Introduction Bessel s Inequality in -Inner Product Some Inequalities for -Norms Some Inequalities for Fourier Coefficients Applications for Determinantal Integral Inequalities References Page of 8
3 1. Introduction Let (H; (, )) be an inner product space over the real or complex number field K. If (e i ) are orthonormal vectors in the inner product space H, i.e., (e i, e j ) = δ ij for all i, j {1,..., n} where δ ij is the Kronecker delta, then the following inequality is well known in the literature as Bessel s inequality (see for example [9, p. 391]): (x, e i ) x for any x H. For other results related to Bessel s inequality, see [5] [7] and Chapter XV in the book [9]. In 1941, R.P. Boas [] and in 1944, independently, R. Bellman [1] proved the following generalization of Bessel s inequality (see also [9, p. 39]). Theorem 1.1. If x, y 1,..., y n are elements of an inner product space (H; (, )), then the following inequality: ( ) 1 (x, y i ) x max y i + (y i, y j ) holds. It is the main aim of the present paper to point out the corresponding version of Boas-Bellman inequality in -inner product spaces. Some natural generalizations and related results are also pointed out. Applications for determinantal integral inequalities are provided. Page 3 of 8
4 For a comprehensive list of fundamental results on -inner product spaces and linear -normed spaces, see the recent books [3] and [8] where further references are given. Page 4 of 8
5 . Bessel s Inequality in -Inner Product The concepts of -inner products and -inner product spaces have been intensively studied by many authors in the last three decades. A systematic presentation of the recent results related to the theory of -inner product spaces as well as an extensive list of the related references can be found in the book [3]. Here we give the basic definitions and the elementary properties of -inner product spaces. Let X be a linear space of dimension greater than 1 over the field K = R of real numbers or the field K = C of complex numbers. Suppose that (, ) is a K-valued function defined on X X X satisfying the following conditions: (I 1 ) (x, x z) 0 and (x, x z) = 0 if and only if x and z are linearly dependent; (I ) (x, x z) = (z, z x), (I 3 ) (y, x z) = (x, y z), (I 4 ) (αx, y z) = α(x, y z) for any scalar α K, (I 5 ) (x + x, y z) = (x, y z) + (x, y z). (, ) is called a -inner product on X and (X, (, )) is called a -inner product space (or -pre-hilbert space). Some basic properties of -inner products (, ) can be immediately obtained as follows [4]: (1) If K = R, then (I 3 ) reduces to (y, x z) = (x, y z). Page 5 of 8
6 () From (I 3 ) and (I 4 ), we have (0, y z) = 0, (x, 0 z) = 0 and (.1) (x, αy z) = ᾱ(x, y z). (3) Using (I ) (I 5 ), we have and (z, z x ± y) = (x ± y, x ± y z) = (x, x z) + (y, y z) ± Re(x, y z) (.) Re(x, y z) = 1 [(z, z x + y) (z, z x y)]. 4 In the real case, (.) reduces to (.3) (x, y z) = 1 [(z, z x + y) (z, z x y)] 4 and, using this formula, it is easy to see that, for any α R, (.4) (x, y αz) = α (x, y z). In the complex case, using (.1) and (.), we have Im(x, y z) = Re[ i(x, y z)] = 1 [(z, z x + iy) (z, z x iy)], 4 Page 6 of 8
7 which, in combination with (.), yields (.5) (x, y z) = 1 4 [(z, z x+y) (z, z x y)]+ i [(z, z x+iy) (z, z x iy)]. 4 Using the above formula and (.1), we have, for any α C, (.6) (x, y αz) = α (x, y z). However, for α R, (.6) reduces to (.4). Also, from (.6) it follows that (x, y 0) = 0. (4) For any three given vectors x, y, z X, consider the vector u = (y, y z)x (x, y z)y. By (I 1 ), we know that (u, u z) 0 with the equality if and only if u and z are linearly dependent. The inequality (u, u z) 0 can be rewritten as (.7) (y, y z)[(x, x z)(y, y z) (x, y z) ] 0. For x = z, (.7) becomes which implies that (y, y z) (z, y z) 0, (.8) (z, y z) = (y, z z) = 0, provided y and z are linearly independent. Obviously, when y and z are linearly dependent, (.8) holds too. Thus (.8) is true for any two vectors y, z X. Page 7 of 8
8 Now, if y and z are linearly independent, then (y, y z) > 0 and, from (.7), it follows that (.9) (x, y z) (x, x z)(y, y z). Using (.8), it is easy to check that (.9) is trivially fulfilled when y and z are linearly dependent. Therefore, the inequality (.9) holds for any three vectors x, y, z X and is strict unless the vectors u = (y, y z)x (x, y z)y and z are linearly dependent. In fact, we have the equality in (.9) if and only if the three vectors x, y and z are linearly dependent. In any given -inner product space (X, (, )), we can define a function on X X by (.10) x z = (x, x z) for all x, z X. It is easy to see that this function satisfies the following conditions: (N 1 ) x z 0 and x z = 0 if and only if x and z are linearly dependent, (N ) z x = x z, (N 3 ) αx z = α x z for any scalar α K, (N 4 ) x + x z x z + x z. Any function defined on X X and satisfying the conditions (N 1 ) (N 4 ) is called a -norm on X and (X, ) is called a linear -normed Page 8 of 8
9 space [8]. Whenever a -inner product space (X, (, )) is given, we consider it as a linear -normed space (X, ) with the -norm defined by (.10). Let (X; (, )) be a -inner product space over the real or complex number field K. If (e i ) are linearly independent vectors in the -inner product space X, and, for a given z X, (e i, e j z) = δ ij for all i, j {1,..., n} where δ ij is the Kronecker delta (we say that the family (e i ) is z orthonormal), then the following inequality is the corresponding Bessel s inequality (see for example [4]) for the z orthonormal family (e i ) in the -inner product space (X; (, )): (.11) (x, e i z) x z for any x X. For more details about this inequality, see the recent paper [4] and the references therein. Page 9 of 8
10 3. Some Inequalities for -Norms We start with the following lemma which is also interesting in itself. Lemma 3.1. Let z 1,..., z n, z X and µ 1,..., µ n K. Then one has the inequality: (3.1) µ i z i z max µ i n z i z ; ( n µ i α) 1 ( n α z i z β) 1 β, where α > 1, = 1; α β n µ i max z i z, max { µ iµ j } (z i, z j z) ; [ ( n + µ i γ ) ( ( n µ i γ)] 1 γ ) 1 δ (z i, z j z) δ where γ > 1, 1 γ + 1 δ = 1; [ ( n µ i ) n µ i ] max (z i, z j z)., Page 10 of 8
11 Proof. We observe that ( (3.) µ i z i z = µ i z i, ) µ j z j z j=1 = µ i µ j (z i, z j z) j=1 = µ i µ j (z i, z j z) = j=1 µ i µ j (z i, z j z) j=1 µ i z i z + Using Hölder s inequality, we may write that max µ i z i z ; µ i µ j (z i, z j z). (3.3) µ i z i z ( n ) 1 ( ) 1 µ i α α z i z β β, where α > 1, = 1; α β µ i max z i z. Page 11 of 8
12 By Hölder s inequality for double sums, we also have (3.4) µ i µ j (z i, z j z) max µ iµ j (z i, z j z) ; ( ) 1 ( ) 1 γ δ µ i γ µ j γ (z i, z j z) δ, 1 where γ > 1, + 1 = 1; γ δ µ i µ j max (z i, z j z), max { µ iµ j } (z i, z j z) ; [ ( n ) ( n ) µ i γ ] 1 ( γ µ i γ = [ ( n ) ] µ i n µ i (z i, z j z) δ ) 1 δ, where γ > 1, 1 γ + 1 δ = 1; max (z i, z j z). Utilizing (3.3) and (3.4) in (3.), we may deduce the desired result (3.1). Remark 1. Inequality (3.1) contains in fact 9 different inequalities which may be obtained combining the first 3 ones with the last 3 ones. A particular result of interest is embodied in the following inequality. Page 1 of 8
13 Corollary 3.. With the assumptions in Lemma 3.1, we have (3.5) µ i z i z { µ i max z i z + [ ( n µ i ) n µ i 4] 1 ( n µ i ( µ i max z i z + ) 1 (z i, z j z) ) 1 (z i, z j z). The first inequality follows by taking the third branch in the first curly bracket with the second branch in the second curly bracket for γ = δ =. The second inequality in (3.5) follows by the fact that ( ) 1 µ i µ i 4 µ i. Applying the following Cauchy-Bunyakovsky-Schwarz inequality ( ) (3.6) a i n a i, a i R +, 1 i n, Page 13 of 8
14 we may write that ( ) (3.7) µ i γ and (3.8) ( µ i ) Also, it is obvious that: µ i γ (n 1) µ i (n 1) µ i γ (n 1) µ i (n 1). (3.9) max { µ iµ j } max µ i. Consequently, we may state the following coarser upper bounds for n µ iz i z that may be useful in applications. Corollary 3.3. With the assumptions in Lemma 3.1, we have the inequalities: (3.10) µ i z i z max µ i n z i z ; ( n µ i α) 1 α ( n z i z β) 1 β, where α > 1, 1 α + 1 β = 1, n µ i max z i z, Page 14 of 8
15 max µ i (z i, z j z) ; + (n 1) 1 γ ( n µ i γ) 1 γ (n 1) n µ i max (z i, z j z). ( z ( i, z j z) δ) 1 δ, where γ > 1, 1 γ + 1 δ = 1; The proof is obvious by Lemma 3.1 on applying the inequalities (3.7) (3.9). Remark. The following inequalities which are incorporated in (3.10) are of special interest: [ (3.11) µ i z i z max µ i z i z + ] (z i, z j z) ; (3.1) µ i z i z ( ) 1 ( p ) 1 q µ i p z i z q + (n 1) 1 p ( ) 1 q (z i, z j z) q, Page 15 of 8
16 where p > 1, = 1; and p q (3.13) µ i z i z [ ] µ i max z i z + (n 1) max (z i, z j z). Page 16 of 8
17 4. Some Inequalities for Fourier Coefficients The following results holds Theorem 4.1. Let x, y 1,..., y n, z be vectors of a -inner product space (X; (, )) and c 1,..., c n K (K = C, R). Then one has the inequalities: (4.1) c i (x, y i z) max c i n y i z ; x z + x z Proof. We note that ( n c i α) 1 α ( n y i z β) 1 β, where α > 1, = 1; α β c i max y i z ; max { c ic j } (y i, y j z) ; [ ( n c i γ ) ( n c i γ)] 1 γ ( (y i, y j z) δ ) 1 δ, where γ >1, 1 γ + 1 δ =1; [ ( n c i ) n c i ] max (y i, y j z). ( c i (x, y i z) = x, ) c i y i z. Page 17 of 8
18 Using Schwarz s inequality in -inner product spaces, we have c i (x, y i z) x z c i y i z. Now using Lemma 3.1 with µ i = c i, z i = y i (i = 1,..., n), we deduce the desired inequality (4.1). The following particular inequalities that may be obtained by the Corollaries 3., 3.3, and Remark, hold. Corollary 4.. With the assumptions in Theorem 4.1, one has the inequalities: (4.) c i (x, y i z) ( ) 1 n c i max y i z + (y i, y j z) ; { n y i z + } (y i, y j z) ; x z max c i ( n c i p) 1 { ( n p y i z q) 1 q ( + (n 1) 1 p q ) 1 (y i, y j z) q, where p > 1, { = 1; p q } n c i max y i z + (n 1) max (y i, y j z). Page 18 of 8
19 5. Inequalities in -Inner Product If one chooses c i = (x, y i z) (i = 1,..., n) in (4.1), then it is possible to obtain 9 different inequalities between the Fourier coefficients (x, y i z) and the -norms and -inner products of the vectors y i (i = 1,..., n). We restrict ourselves only to those inequalities that may be obtained from (4.). From the first inequality in (4.) for c i = (x, y i z), we get ( ) (x, y i z) x z ( (x, y i z) max y i z + ) 1 (y i, y j z), which is clearly equivalent to the following Boas-Bellman type inequality for -inner products: (5.1) (x, y i z) ( x z max y i z + ) 1 (y i, y j z). Page 19 of 8
20 From the second inequality in (4.) for c i = (x, y i z), we get ( ) (x, y i z) x z max (x, y i z) { y i z + (y i, y j z) }. Taking the square root in this inequality, we obtain (5.) (x, y i z) { x z max (x, y i z) y i z + (y i, y j z) for any x, y 1,..., y n, z vectors in the -inner product space (X; (, )). If we assume that (e i ) is an orthonormal family in X with respect with the vector z, i.e., (e i, e j z) = δ ij for all i, j {1,..., n}, then by (5.1) we deduce Bessel s inequality (.11), while from (5.) we have } 1 (5.3) (x, e i z) n x z max (x, e i z), x X. Page 0 of 8
21 From the third inequality in (4.) for c i = (x, y i z), we deduce ( ) (x, y i z) ( x z ( for p > 1 with 1 p + 1 q (5.4) (x, y i z) p ) 1 p y i z q ) 1 q (x, y i z) x z + (n 1) 1 p ( q ) 1 (y i, y j z) q = 1. Taking the square root in this inequality, we get ( ( ) 1 q y i z q (x, y i z) p ) 1 p + (n 1) 1 p ( ) 1 q (y i, y j z) q for any x, y 1,..., y n, z X and p > 1 with 1 p + 1 q = 1. The above inequality (5.4) becomes, for an orthornormal family (e i ) 1 Page 1 of 8
22 with respect of the vector z, (5.5) ( (x, e i z) n 1 q x z (x, e i z) p ) 1 p, x X. Finally, the choice c i = (x, y i z) (i = 1,..., n) will produce in the last inequality in (4.) ( ) (x, y i z) x z { } (x, y i z) max y i z + (n 1) max (y i, y j z), which gives the following inequality { } (5.6) (x, y i z) x z max y i z + (n 1) max (y i, y j z) for any x, y 1,..., y n, z X. It is obvious that (5.6) will give for z orthonormal families, the Bessel inequality mentioned in (.11) from the Introduction. Remark 3. Observe that, both the Boas-Bellman type inequality for -inner products incorporated in (5.1) and the inequality (5.6) become in the particular case of z orthonormal families, the regular Bessel s inequality. Consequently, a comparison of the upper bounds is necessary. Page of 8
23 It suffices to consider the quantities A n := ( (y i, y j z) ) 1 and where n 1, and y 1,..., y n, z X. If we choose n = 3, we have and B n := (n 1) max (y i, y j z), A 3 = ( (y 1, y z) + (y, y 3 z) + (y 3, y 1 z) ) 1 B 3 = max { (y 1, y z), (y, y 3 z), (y 3, y 1 z) }, where y 1, y, y 3, z X. If we consider a := (y 1, y z) 0, b := (y, y 3 z) 0 and c := (y 3, y 1 z) 0, then we have to compare with A 3 := ( a + b + c ) 1 B 3 = max {a, b, c}. If we assume that b = c = 1, then A 3 := (a + ) 1, B 3 = max {a, 1}. Finally, for a = 1, we get A 3 = 6, B 3 = showing that A 3 > B 3, while for a = we have A 3 = 1, B 3 = 4 showing that B 3 > A 3. Page 3 of 8
24 In conclusion, we may state that the bounds ( M 1 := x z max y i z + ) 1 (y i, y j z) and { } M := x z max y i z + (n 1) max (y i, y j z) for the Bessel s sum n (x, y i z) cannot be compared in general, meaning that sometimes one is better than the other. Page 4 of 8
25 6. Applications for Determinantal Integral Inequalities Let (Ω, Σ, µ) be a measure space consisting of a set Ω, a σ algebra Σ of subsets of Ω and a countably additive and positive measure µ on Σ with values in R { }. Denote by L ρ (Ω) the Hilbert space of all real-valued functions f defined on Ω that are ρ integrable on Ω, i.e., Ω ρ (s) f (s) dµ (s) <, where ρ : Ω [0, ) is a measurable function on Ω. We can introduce the following -inner product on L ρ (Ω) by the formula (6.1) where, by (f, g h) ρ := 1 Ω Ω f (s) ρ (s) ρ (t) h (s) f (s) h (s) f (t) g (s) h (t) h (s) f (t) h (t) we denote the determinant of the matrix [ f (s) f (t) h (s) h (t), ], g (t) h (t) dµ (s) dµ (t), Page 5 of 8
26 generating the -norm on L ρ (Ω) expressed by (6.) f h ρ := 1 Ω Ω ρ (s) ρ (t) f (s) h (s) f (t) h (t) 1 dµ (s) dµ (t). A simple calculation with integrals reveals that ρfgdµ ρfhdµ Ω Ω (6.3) (f, g h) ρ = ρghdµ Ω Ω ρh dµ and ρf dµ ρfhdµ Ω Ω (6.4) f h ρ = ρfhdµ Ω Ω ρh dµ where, for simplicity, instead of ρ (s) f (s) g (s) dµ (s), we have written ρfgdµ. Ω Ω Using the representations (6.), (6.3) and the inequalities for -inner products and -norms established in the previous sections, one may state some interesting determinantal integral inequalities, as follows. Proposition 6.1. Let f, g 1,..., g n, h L ρ (Ω), where ρ : Ω [0, ) is a 1, Page 6 of 8
27 measurable function on Ω. Then we have the inequality ρfg Ω idµ ρfhdµ Ω ρg Ω ihdµ Ω ρh dµ ρf dµ ρfhdµ { Ω Ω ρfhdµ Ω Ω ρh dµ Ω ρg i dµ ρg Ω ihdµ max ρg Ω ihdµ Ω ρh dµ + ρg Ω jg i dµ ρg Ω jhdµ 1 ρg Ω ihdµ Ω ρh dµ. The proof follows by the inequality (5.1) applied for the -inner product and -norm defined in (??) and (6.1), and utilizing the identities (6.) and (6.3). If one uses the inequality (5.6), then the following result may also be stated. Proposition 6.. Let f, g 1,..., g n, h L ρ (Ω), where ρ : Ω [0, ) is a measurable function on Ω. Then we have the inequality ρfg Ω idµ ρfhdµ Ω ρg Ω ihdµ Ω ρh dµ ρf dµ ρfhdµ { Ω Ω ρfhdµ Ω Ω ρh dµ Ω ρg i dµ ρg Ω ihdµ max ρg Ω ihdµ Ω ρh dµ ρg Ω jg i dµ ρg } Ω jhdµ + (n 1) max ρg. Ω ihdµ Ω ρh dµ Page 7 of 8
28 References [1] R. BELLMAN, Almost orthogonal series, Bull. Amer. Math. Soc., 50 (1944), [] R.P. BOAS, A general moment problem, Amer. J. Math., 63 (1941), [3] Y.J. CHO, P.C.S. LIN, S.S. KIM AND A. MISIAK, Theory of -Inner Product, Nova Science Publishers, Inc., New York, 001. [4] Y.J. CHO, M. MATIĆ AND J.E. PEČARIĆ, On Gram s determinant in - inner product spaces, J. Korean Math. Soc., 38(6) (001), [5] S.S. DRAGOMIR AND J. SÁNDOR, On Bessel s and Gram s inequality in prehilbertian spaces, Periodica Math. Hung., 9(3) (1994), [6] S.S. DRAGOMIR AND B. MOND, On the Boas-Bellman generalisation of Bessel s inequality in inner product spaces, Italian J. of Pure & Appl. Math., 3 (1998), [7] S.S. DRAGOMIR, B. MOND AND J.E. PEČARIĆ, Some remarks on Bessel s inequality in inner product spaces, Studia Univ. Babeş-Bolyai, Mathematica, 37(4) (199), [8] R.W. FREESE AND Y.J. CHO, Geometry of Linear -Normed, Nova Science Publishers, Inc., New York, 001. [9] D.S. MITRINOVIĆ, J.E. PEČARIĆ AND A.M. FINK, Classical and New Inequalities in Analysis, Kluwer Academic Publishers, Dordrecht, Page 8 of 8
A Review on 2-normed Structures
Int. Journal of Math. Analysis, Vol. 1, 2007, no. 4, 187-191 A Review on 2-normed Structures Mehmet Açıkgöz University of Gaziantep, Science and Arts Faculty Department of Mathematics, Gaziantep, Turkey
More informationMath 5593 Linear Programming Lecture Notes
Math 5593 Linear Programming Lecture Notes Unit II: Theory & Foundations (Convex Analysis) University of Colorado Denver, Fall 2013 Topics 1 Convex Sets 1 1.1 Basic Properties (Luenberger-Ye Appendix B.1).........................
More informationSome New Generalized Nonlinear Integral Inequalities for Functions of Two Independent Variables
Int. Journal of Math. Analysis, Vol. 7, 213, no. 4, 1961-1976 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/1.12988/ijma.213.3485 Some New Generalized Nonlinear Integral Inequalities for Functions of
More informationON SOME GRÜSS TYPE INEQUALITY IN 2-INNER PRODUCT SPACES AND APPLICATIONS. S.S. Kim, S.S. Dragomir, A. White and Y.J. Cho. 1.
ON SOME GRÜSS TYPE INEQUALITY IN 2-INNER PRODUCT SPACES AND APPLICATIONS S.S. Kim, S.S. Drgomir, A. White nd Y.J. Cho Abstrct. In this pper, we shll give generliztion of the Grüss type inequlity nd obtin
More informationOn Some Properties of Vague Lattices
Int. J. Contemp. Math. Sciences, Vol. 4, 2009, no. 31, 1511-1524 On Some Properties of Vague Lattices Zeynep Eken Akdeniz University, Faculty of Sciences and Arts Department of Mathematics, 07058-Antalya,
More informationF A S C I C U L I M A T H E M A T I C I
F A S C I C U L I M A T H E M A T I C I Nr 35 2005 B.G. Pachpatte EXPLICIT BOUNDS ON SOME RETARDED INTEGRAL INEQUALITIES Abstract: In this paper we establish some new retarded integral inequalities which
More informationFUZZY METRIC SPACES ZUN-QUAN XIA AND FANG-FANG GUO
J. Appl. Math. & Computing Vol. 16(2004), No. 1-2, pp. 371-381 FUZZY METRIC SPACES ZUN-QUAN XIA AND FANG-FANG GUO Abstract. In this paper, fuzzy metric spaces are redefined, different from the previous
More informationA C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions
A C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions Nira Dyn School of Mathematical Sciences Tel Aviv University Michael S. Floater Department of Informatics University of
More informationDeficient Quartic Spline Interpolation
International Journal of Computational Science and Mathematics. ISSN 0974-3189 Volume 3, Number 2 (2011), pp. 227-236 International Research Publication House http://www.irphouse.com Deficient Quartic
More informationProduct constructions for transitive decompositions of graphs
116 Product constructions for transitive decompositions of graphs Geoffrey Pearce Abstract A decomposition of a graph is a partition of the edge set, giving a set of subgraphs. A transitive decomposition
More informationROUGH MEMBERSHIP FUNCTIONS: A TOOL FOR REASONING WITH UNCERTAINTY
ALGEBRAIC METHODS IN LOGIC AND IN COMPUTER SCIENCE BANACH CENTER PUBLICATIONS, VOLUME 28 INSTITUTE OF MATHEMATICS POLISH ACADEMY OF SCIENCES WARSZAWA 1993 ROUGH MEMBERSHIP FUNCTIONS: A TOOL FOR REASONING
More informationCategorical equivalence of some algebras
ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 16, Number 2, 2012 Available online at www.math.ut.ee/acta/ Categorical equivalence of some algebras Oleg Košik Abstract. We show that
More informationGEODETIC DOMINATION IN GRAPHS
GEODETIC DOMINATION IN GRAPHS H. Escuadro 1, R. Gera 2, A. Hansberg, N. Jafari Rad 4, and L. Volkmann 1 Department of Mathematics, Juniata College Huntingdon, PA 16652; escuadro@juniata.edu 2 Department
More informationFixed points of Kannan mappings in metric spaces endowed with a graph
An. Şt. Univ. Ovidius Constanţa Vol. 20(1), 2012, 31 40 Fixed points of Kannan mappings in metric spaces endowed with a graph Florin Bojor Abstract Let (X, d) be a metric space endowed with a graph G such
More information11 1. Introductory part In order to follow the contents of this book with full understanding, certain prerequisites from high school mathematics will
11 1. Introductory part In order to follow the contents of this book with full understanding, certain prerequisites from high school mathematics will be necessary. This firstly pertains to the basic concepts
More informationOn Jeśmanowicz Conjecture Concerning Pythagorean Triples
Journal of Mathematical Research with Applications Mar., 2015, Vol. 35, No. 2, pp. 143 148 DOI:10.3770/j.issn:2095-2651.2015.02.004 Http://jmre.dlut.edu.cn On Jeśmanowicz Conjecture Concerning Pythagorean
More informationON SWELL COLORED COMPLETE GRAPHS
Acta Math. Univ. Comenianae Vol. LXIII, (1994), pp. 303 308 303 ON SWELL COLORED COMPLETE GRAPHS C. WARD and S. SZABÓ Abstract. An edge-colored graph is said to be swell-colored if each triangle contains
More informationAdvanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material
More informationExistence and uniqueness of the solution for a general system of operator equations in b metric spaces endowed with a graph
Int. J. Nonlinear Anal. Appl. 8 (217 No. 2, 263-276 ISSN: 28-6822 (electronic http://dx.doi.org/1.2275/ijnaa.217.11562.157 Existence and uniqueness of the solution for a general system of operator equations
More informationSome fixed fuzzy point results using Hausdorff metric in fuzzy metric spaces
Annals of Fuzzy Mathematics and Informatics Volume 13, No 5, (May 017), pp 641 650 ISSN: 093 9310 (print version) ISSN: 87 635 (electronic version) http://wwwafmiorkr @FMI c Kyung Moon Sa Co http://wwwkyungmooncom
More informationNotes on Interval Valued Fuzzy RW-Closed, Interval Valued Fuzzy RW-Open Sets in Interval Valued Fuzzy Topological Spaces
International Journal of Fuzzy Mathematics and Systems. ISSN 2248-9940 Volume 3, Number 1 (2013), pp. 23-38 Research India Publications http://www.ripublication.com Notes on Interval Valued Fuzzy RW-Closed,
More informationA NOTE ON THE NUMBER OF DOMINATING SETS OF A GRAPH
A NOTE ON THE NUMBER OF DOMINATING SETS OF A GRAPH STEPHAN WAGNER Abstract. In a recent article by Bród and Skupień, sharp upper and lower bounds for the number of dominating sets in a tree were determined.
More informationSOME REMARKS CONCERNING D METRIC SPACES
SOME REMARKS CONCERNING D METRIC SPACES Zead Mustafa and Brailey Sims November 2003 Abstract In this note we make some remarks concerning D metric spaces, and present some examples which show that many
More informationDivision of the Humanities and Social Sciences. Convex Analysis and Economic Theory Winter Separation theorems
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 8: Separation theorems 8.1 Hyperplanes and half spaces Recall that a hyperplane in
More informationFURTHER APPLICATIONS OF CLUTTER DOMINATION PARAMETERS TO PROJECTIVE DIMENSION
FURTHER APPLICATIONS OF CLUTTER DOMINATION PARAMETERS TO PROJECTIVE DIMENSION HAILONG DAO AND JAY SCHWEIG Abstract. We study the relationship between the projective dimension of a squarefree monomial ideal
More informationA C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions
A C 2 Four-Point Subdivision Scheme with Fourth Order Accuracy and its Extensions Nira Dyn Michael S. Floater Kai Hormann Abstract. We present a new four-point subdivision scheme that generates C 2 curves.
More informationA Banach-Dieudonné theorem for the space of bounded continuous functions on a separable metric space with the strict topology
Delft University of Technology A Banach-Dieudonné theorem for the space of bounded continuous functions on a separable metric space with the strict topology Kraaij, Richard DOI 10.1016/j.topol.2016.06.003
More informationA note on isolate domination
Electronic Journal of Graph Theory and Applications 4 (1) (016), 94 100 A note on isolate domination I. Sahul Hamid a, S. Balamurugan b, A. Navaneethakrishnan c a Department of Mathematics, The Madura
More informationc 2004 Society for Industrial and Applied Mathematics
SIAM J. MATRIX ANAL. APPL. Vol. 26, No. 2, pp. 390 399 c 2004 Society for Industrial and Applied Mathematics HERMITIAN MATRICES, EIGENVALUE MULTIPLICITIES, AND EIGENVECTOR COMPONENTS CHARLES R. JOHNSON
More informationThis article was originally published in a journal published by Elsevier, and the attached copy is provided by Elsevier for the author s benefit and for the benefit of the author s institution, for non-commercial
More informationCOMPLETE METRIC ABSOLUTE NEIGHBORHOOD RETRACTS
COMPLETE METRIC ABSOLUTE NEIGHBORHOOD RETRACTS WIES LAW KUBIŚ Abstract. We characterize complete metric absolute (neighborhood) retracts in terms of existence of certain maps of CW-polytopes. Using our
More informationOn the Relationships between Zero Forcing Numbers and Certain Graph Coverings
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings Fatemeh Alinaghipour Taklimi, Shaun Fallat 1,, Karen Meagher 2 Department of Mathematics and Statistics, University of Regina,
More informationConvex Geometry arising in Optimization
Convex Geometry arising in Optimization Jesús A. De Loera University of California, Davis Berlin Mathematical School Summer 2015 WHAT IS THIS COURSE ABOUT? Combinatorial Convexity and Optimization PLAN
More informationAn Appropriate Method for Real Life Fuzzy Transportation Problems
International Journal of Information Sciences and Application. ISSN 097-55 Volume 3, Number (0), pp. 7-3 International Research Publication House http://www.irphouse.com An Appropriate Method for Real
More informationA NOTE ON MORPHISMS DETERMINED BY OBJECTS
A NOTE ON MORPHISMS DETERMINED BY OBJECTS XIAO-WU CHEN, JUE LE Abstract. We prove that a Hom-finite additive category having determined morphisms on both sides is a dualizing variety. This complements
More informationWeighted Geodetic Convex Sets in A Graph
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. PP 12-17 www.iosrjournals.org Weighted Geodetic Convex Sets in A Graph Jill K. Mathew 1 Department of Mathematics Mar Ivanios
More informationarxiv: v1 [math.co] 15 Dec 2009
ANOTHER PROOF OF THE FACT THAT POLYHEDRAL CONES ARE FINITELY GENERATED arxiv:092.2927v [math.co] 5 Dec 2009 VOLKER KAIBEL Abstract. In this note, we work out a simple inductive proof showing that every
More informationARTIN S THEOREM: FOR THE STUDENT SEMINAR
ARTIN S THEOREM: FOR THE STUDENT SEMINAR VIPUL NAIK Abstract. This is a write-up of Artin s theorem for the student seminar in the course on Representation Theory of Finite Groups. Much of the material
More informationOn Fuzzy Regular Generalized Weakly Closed Sets In Fuzzy Topological Space
Advances in Fuzzy Mathematics. ISSN 0973-533X Volume 12, Number 4 (2017), pp. 965-975 Research India Publications http://www.ripublication.com On Fuzzy Regular Generalized Weakly Closed Sets In Fuzzy Topological
More informationCoincidence Point Theorems for Geraghty- Type Contraction Mappings in Generalized Metric Spaces
Thai Journal of Mathematics : 145 158 Special Issue: Annual Meeting in Mathematics 2017 http://thaijmath.in.cmu.ac.th ISSN 1686-0209 Coincidence Point Theorems for Geraghty- Type Contraction Mappings in
More information4. Simplicial Complexes and Simplicial Homology
MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n
More informationSome Properties of Regular Semigroups. Possess a Medial Idempotent
International Journal of Algebra, Vol. 4, 2010, no. 9, 433-438 Some Properties of Regular Semigroups Possess a Medial Idempotent S. Hussain 1, T. Anwer 1, H. Chien 2 1 Higher Education Department, Pakistan
More informationSTANLEY S SIMPLICIAL POSET CONJECTURE, AFTER M. MASUDA
Communications in Algebra, 34: 1049 1053, 2006 Copyright Taylor & Francis Group, LLC ISSN: 0092-7872 print/1532-4125 online DOI: 10.1080/00927870500442005 STANLEY S SIMPLICIAL POSET CONJECTURE, AFTER M.
More informationResults on the min-sum vertex cover problem
Results on the min-sum vertex cover problem Ralucca Gera, 1 Craig Rasmussen, Pantelimon Stănică 1 Naval Postgraduate School Monterey, CA 9393, USA {rgera, ras, pstanica}@npsedu and Steve Horton United
More informationConvexity: an introduction
Convexity: an introduction Geir Dahl CMA, Dept. of Mathematics and Dept. of Informatics University of Oslo 1 / 74 1. Introduction 1. Introduction what is convexity where does it arise main concepts and
More informationA digital pretopology and one of its quotients
Volume 39, 2012 Pages 13 25 http://topology.auburn.edu/tp/ A digital pretopology and one of its quotients by Josef Šlapal Electronically published on March 18, 2011 Topology Proceedings Web: http://topology.auburn.edu/tp/
More informationGeneralized alternative and Malcev algebras
Mathematics Publications Mathematics 1982 Generalized alternative and Malcev algebras Irvin R. Hentzel Iowa State University, hentzel@iastate.edu H.F. Smith Iowa State University Follow this and additional
More informationA NEW PROOF OF THE SMOOTHNESS OF 4-POINT DESLAURIERS-DUBUC SCHEME
J. Appl. Math. & Computing Vol. 18(2005), No. 1-2, pp. 553-562 A NEW PROOF OF THE SMOOTHNESS OF 4-POINT DESLAURIERS-DUBUC SCHEME YOUCHUN TANG, KWAN PYO KO* AND BYUNG-GOOK LEE Abstract. It is well-known
More informationBlock-based Thiele-like blending rational interpolation
Journal of Computational and Applied Mathematics 195 (2006) 312 325 www.elsevier.com/locate/cam Block-based Thiele-like blending rational interpolation Qian-Jin Zhao a, Jieqing Tan b, a School of Computer
More informationAn Improved Upper Bound for the Sum-free Subset Constant
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 (2010), Article 10.8.3 An Improved Upper Bound for the Sum-free Subset Constant Mark Lewko Department of Mathematics University of Texas at Austin
More informationOn graphs of minimum skew rank 4
On graphs of minimum skew rank 4 Sudipta Mallik a and Bryan L. Shader b a Department of Mathematics & Statistics, Northern Arizona University, 85 S. Osborne Dr. PO Box: 5717, Flagstaff, AZ 8611, USA b
More informationFuzzy Generalized γ-closed set in Fuzzy Topological Space
Annals of Pure and Applied Mathematics Vol. 7, No. 1, 2014, 104-109 ISSN: 2279-087X (P), 2279-0888(online) Published on 9 September 2014 www.researchmathsci.org Annals of Fuzzy Generalized γ-closed set
More informationGeneralized Convex Set-Valued Maps
Generalized Convex Set-Valued Maps September 20, 2008 Joël Benoist Department of Mathematics LACO URA-CNRS 1586 University of Limoges 87060 Limoges, France E-mail: benoist@unilim.fr Nicolae Popovici Faculty
More informationApplied Mathematical Sciences, Vol. 5, 2011, no. 49, Július Czap
Applied Mathematical Sciences, Vol. 5, 011, no. 49, 437-44 M i -Edge Colorings of Graphs Július Czap Department of Applied Mathematics and Business Informatics Faculty of Economics, Technical University
More informationLecture notes for Topology MMA100
Lecture notes for Topology MMA100 J A S, S-11 1 Simplicial Complexes 1.1 Affine independence A collection of points v 0, v 1,..., v n in some Euclidean space R N are affinely independent if the (affine
More informationAutomorphism Groups of Cyclic Polytopes
8 Automorphism Groups of Cyclic Polytopes (Volker Kaibel and Arnold Waßmer ) It is probably well-known to most polytope theorists that the combinatorial automorphism group of a cyclic d-polytope with n
More informationSeparating Homeomorphisms
Advances in Dynamical Systems and Applications ISSN 0973-5321, Volume 12, Number 1, pp. 17 24 (2017) http://campus.mst.edu/adsa Separating Homeomorphisms Alfonso Artigue Universidad de la República Departmento
More informationarxiv: v1 [math.at] 8 Jan 2015
HOMOLOGY GROUPS OF SIMPLICIAL COMPLEMENTS: A NEW PROOF OF HOCHSTER THEOREM arxiv:1501.01787v1 [math.at] 8 Jan 2015 JUN MA, FEIFEI FAN AND XIANGJUN WANG Abstract. In this paper, we consider homology groups
More informationREGULAR GRAPHS OF GIVEN GIRTH. Contents
REGULAR GRAPHS OF GIVEN GIRTH BROOKE ULLERY Contents 1. Introduction This paper gives an introduction to the area of graph theory dealing with properties of regular graphs of given girth. A large portion
More informationGENERALIZED METRIC SPACES AND TOPOLOGICAL STRUCTURE I
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I.CUZA IAŞI Tomul XLVI, s.i a, Matematică, 2000, f.1. GENERALIZED METRIC SPACES AND TOPOLOGICAL STRUCTURE I BY B.C. DHAGE Abstract. In this paper some results in
More informationNumerical Optimization
Convex Sets Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on Let x 1, x 2 R n, x 1 x 2. Line and line segment Line passing through x 1 and x 2 : {y
More informationA FEW INEQUALITIES IN QUADRILATERALS
INTERNATIONAL JOURNAL OF GEOMETRY Vol. 4 (2015), No. 1, 11-15 A FEW INEQUALITIES IN QUADRILATERALS MARTIN JOSEFSSON Abstract. We prove a few inequalities regarding the diagonals, the angle between them,
More informationMirrors of reflections of regular maps
ISSN 1855-3966 (printed edn), ISSN 1855-3974 (electronic edn) ARS MATHEMATICA CONTEMPORANEA 15 (018) 347 354 https://doiorg/106493/1855-3974145911d (Also available at http://amc-journaleu) Mirrors of reflections
More informationExact discrete Morse functions on surfaces. To the memory of Professor Mircea-Eugen Craioveanu ( )
Stud. Univ. Babeş-Bolyai Math. 58(2013), No. 4, 469 476 Exact discrete Morse functions on surfaces Vasile Revnic To the memory of Professor Mircea-Eugen Craioveanu (1942-2012) Abstract. In this paper,
More informationON FUZZY WEAKLY BAIRE SPACES
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(2017), 479-489 DOI: 10.7251/BIMVI1703479T Former BULLETIN
More informationSaturated Sets in Fuzzy Topological Spaces
Computational and Applied Mathematics Journal 2015; 1(4): 180-185 Published online July 10, 2015 (http://www.aascit.org/journal/camj) Saturated Sets in Fuzzy Topological Spaces K. A. Dib, G. A. Kamel Department
More informationVERTEX-DEGREE-BASED TOPOLOGICAL INDICES OVER TREES WITH TWO BRANCHING VERTICES
Kragujevac Journal of Mathematics Volume 43(3) (019), Pages 399 411. VERTEX-DEGREE-BASED TOPOLOGICAL INDICES OVER TREES WITH TWO BRANCHING VERTICES R. CRUZ 1, C. A. MARÍN 1, AND J. RADA 1 Abstract. Given
More informationOn Generalization of Fuzzy Concept Lattices Based on Change of Underlying Fuzzy Order
On Generalization of Fuzzy Concept Lattices Based on Change of Underlying Fuzzy Order Pavel Martinek Department of Computer Science, Palacky University, Olomouc Tomkova 40, CZ-779 00 Olomouc, Czech Republic
More informationA NOTE ON THE ASSOCIATED PRIMES OF THE THIRD POWER OF THE COVER IDEAL
A NOTE ON THE ASSOCIATED PRIMES OF THE THIRD POWER OF THE COVER IDEAL KIM KESTING, JAMES POZZI, AND JANET STRIULI Abstract. An algebraic approach to graph theory involves the study of the edge ideal and
More informationA GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY
A GRAPH FROM THE VIEWPOINT OF ALGEBRAIC TOPOLOGY KARL L. STRATOS Abstract. The conventional method of describing a graph as a pair (V, E), where V and E repectively denote the sets of vertices and edges,
More informationChromatic Transversal Domatic Number of Graphs
International Mathematical Forum, 5, 010, no. 13, 639-648 Chromatic Transversal Domatic Number of Graphs L. Benedict Michael Raj 1, S. K. Ayyaswamy and I. Sahul Hamid 3 1 Department of Mathematics, St.
More informationRevisiting Kalmar completeness metaproof
Revisiting Kalmar completeness metaproof Angélica Olvera Badillo 1 Universidad de las Américas, Sta. Catarina Mártir, Cholula, Puebla, 72820 México angelica.olverabo@udlap.mx Abstract In this paper, I
More informationFast algorithm for generating ascending compositions
manuscript No. (will be inserted by the editor) Fast algorithm for generating ascending compositions Mircea Merca Received: date / Accepted: date Abstract In this paper we give a fast algorithm to generate
More informationMATLAB. Advanced Mathematics and Mechanics Applications Using. Third Edition. David Halpern University of Alabama CHAPMAN & HALL/CRC
Advanced Mathematics and Mechanics Applications Using MATLAB Third Edition Howard B. Wilson University of Alabama Louis H. Turcotte Rose-Hulman Institute of Technology David Halpern University of Alabama
More informationA Few Remarks on Bounded Operators on Topological Vector Spaces
Filomat 30:3 (2016), 763 772 DOI 10.2298/FIL1603763Z Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat A Few Remarks on Bounded Operators
More informationFuzzy multi objective linear programming problem with imprecise aspiration level and parameters
An International Journal of Optimization and Control: Theories & Applications Vol.5, No.2, pp.81-86 (2015) c IJOCTA ISSN:2146-0957 eissn:2146-5703 DOI:10.11121/ijocta.01.2015.00210 http://www.ijocta.com
More informationThree applications of Euler s formula. Chapter 10
Three applications of Euler s formula Chapter 10 A graph is planar if it can be drawn in the plane R without crossing edges (or, equivalently, on the -dimensional sphere S ). We talk of a plane graph if
More informationSome Properties of Intuitionistic. (T, S)-Fuzzy Filters on. Lattice Implication Algebras
Theoretical Mathematics & Applications, vol.3, no.2, 2013, 79-89 ISSN: 1792-9687 (print), 1792-9709 (online) Scienpress Ltd, 2013 Some Properties of Intuitionistic (T, S)-Fuzzy Filters on Lattice Implication
More information7. The Gauss-Bonnet theorem
7. The Gauss-Bonnet theorem 7.1 Hyperbolic polygons In Euclidean geometry, an n-sided polygon is a subset of the Euclidean plane bounded by n straight lines. Thus the edges of a Euclidean polygon are formed
More informationComputable Euclidean Domains
Computable Euclidean Domains Asher M. Kach (Joint Work with Rod Downey and with Paul Ellis and Reed Solomon) Southern Wisconsin Logic Colloquium 9 October 2012 Asher M. Kach Computable Euclidean Domains
More informationISSN X (print) COMPACTNESS OF S(n)-CLOSED SPACES
Matematiqki Bilten ISSN 0351-336X (print) 41(LXVII) No. 2 ISSN 1857-9914 (online) 2017(30-38) UDC: 515.122.2 Skopje, Makedonija COMPACTNESS OF S(n)-CLOSED SPACES IVAN LONČAR Abstract. The aim of this paper
More informationON THE EMPTY CONVEX PARTITION OF A FINITE SET IN THE PLANE**
Chin. Ann. of Math. 23B:(2002),87-9. ON THE EMPTY CONVEX PARTITION OF A FINITE SET IN THE PLANE** XU Changqing* DING Ren* Abstract The authors discuss the partition of a finite set of points in the plane
More informationMATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix.
MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix. Row echelon form A matrix is said to be in the row echelon form if the leading entries shift to the
More informationC&O 355 Lecture 16. N. Harvey
C&O 355 Lecture 16 N. Harvey Topics Review of Fourier-Motzkin Elimination Linear Transformations of Polyhedra Convex Combinations Convex Hulls Polytopes & Convex Hulls Fourier-Motzkin Elimination Joseph
More informationI-CONTINUITY IN TOPOLOGICAL SPACES. Martin Sleziak
I-CONTINUITY IN TOPOLOGICAL SPACES Martin Sleziak Abstract. In this paper we generalize the notion of I-continuity, which was defined in [1] for real functions, to maps on topological spaces. We study
More informationOn the construction of nested orthogonal arrays
isid/ms/2010/06 September 10, 2010 http://wwwisidacin/ statmath/eprints On the construction of nested orthogonal arrays Aloke Dey Indian Statistical Institute, Delhi Centre 7, SJSS Marg, New Delhi 110
More informationTHE RAINBOW DOMINATION SUBDIVISION NUMBERS OF GRAPHS. N. Dehgardi, S. M. Sheikholeslami and L. Volkmann. 1. Introduction
MATEMATIQKI VESNIK 67, 2 (2015), 102 114 June 2015 originalni nauqni rad research paper THE RAINBOW DOMINATION SUBDIVISION NUMBERS OF GRAPHS N. Dehgardi, S. M. Sheikholeslami and L. Volkmann Abstract.
More informationCREPANT RESOLUTIONS OF GORENSTEIN TORIC SINGULARITIES AND UPPER BOUND THEOREM. Dimitrios I. Dais
Séminaires & Congrès 6, 2002, p. 187 192 CREPANT RESOLUTIONS OF GORENSTEIN TORIC SINGULARITIES AND UPPER BOUND THEOREM by Dimitrios I. Dais Abstract. A necessary condition for the existence of torus-equivariant
More informationStar Forests, Dominating Sets and Ramsey-type Problems
Star Forests, Dominating Sets and Ramsey-type Problems Sheila Ferneyhough a, Ruth Haas b,denis Hanson c,1 and Gary MacGillivray a,1 a Department of Mathematics and Statistics, University of Victoria, P.O.
More informationLecture 1. 1 Notation
Lecture 1 (The material on mathematical logic is covered in the textbook starting with Chapter 5; however, for the first few lectures, I will be providing some required background topics and will not be
More informationMath 734 Aug 22, Differential Geometry Fall 2002, USC
Math 734 Aug 22, 2002 1 Differential Geometry Fall 2002, USC Lecture Notes 1 1 Topological Manifolds The basic objects of study in this class are manifolds. Roughly speaking, these are objects which locally
More informationarxiv: v1 [math.co] 25 Sep 2015
A BASIS FOR SLICING BIRKHOFF POLYTOPES TREVOR GLYNN arxiv:1509.07597v1 [math.co] 25 Sep 2015 Abstract. We present a change of basis that may allow more efficient calculation of the volumes of Birkhoff
More informationThe Matrix-Tree Theorem and Its Applications to Complete and Complete Bipartite Graphs
The Matrix-Tree Theorem and Its Applications to Complete and Complete Bipartite Graphs Frankie Smith Nebraska Wesleyan University fsmith@nebrwesleyan.edu May 11, 2015 Abstract We will look at how to represent
More informationRainbow game domination subdivision number of a graph
Rainbow game domination subdivision number of a graph J. Amjadi Department of Mathematics Azarbaijan Shahid Madani University Tabriz, I.R. Iran j-amjadi@azaruniv.edu Abstract The rainbow game domination
More informationA Particular Type of Non-associative Algebras and Graph Theory
A Particular Type of Non-associative Algebras and Graph Theory JUAN NÚÑEZ, MARITHANIA SILVERO & M. TRINIDAD VILLAR University of Seville Department of Geometry and Topology Aptdo. 1160. 41080-Seville SPAIN
More informationAXIOMS FOR THE INTEGERS
AXIOMS FOR THE INTEGERS BRIAN OSSERMAN We describe the set of axioms for the integers which we will use in the class. The axioms are almost the same as what is presented in Appendix A of the textbook,
More informationOn the Computational Complexity of Nash Equilibria for (0, 1) Bimatrix Games
On the Computational Complexity of Nash Equilibria for (0, 1) Bimatrix Games Bruno Codenotti Daniel Štefankovič Abstract The computational complexity of finding a Nash equilibrium in a nonzero sum bimatrix
More informationCombinatorics of X -variables in finite type cluster algebras
Combinatorics of X -variables in finite type cluster algebras arxiv:1803.02492 Slides available at www.math.berkeley.edu/~msb Melissa Sherman-Bennett, UC Berkeley AMS Fall Central Sectional Meeting 2018
More informationThe Lower and Upper Forcing Edge-to-vertex Geodetic Numbers of a Graph
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 4, Issue 6, June 2016, PP 23-27 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) DOI: http://dx.doi.org/10.20431/2347-3142.0406005
More informationA SIMPLE APPROXIMATION ALGORITHM FOR NONOVERLAPPING LOCAL ALIGNMENTS (WEIGHTED INDEPENDENT SETS OF AXIS PARALLEL RECTANGLES)
Chapter 1 A SIMPLE APPROXIMATION ALGORITHM FOR NONOVERLAPPING LOCAL ALIGNMENTS (WEIGHTED INDEPENDENT SETS OF AXIS PARALLEL RECTANGLES) Piotr Berman Department of Computer Science & Engineering Pennsylvania
More information