FUZZY INNER PRODUCT SPACE*
|
|
- Catherine Cross
- 5 years ago
- Views:
Transcription
1 CHAPTER 5 FUZZY INNER PRODUCT SPACE* 5.1 Introduction: The concept of fuzzy inner product spaces has been introduced in different ways by several authors like Abdel wahad M. El-Abyad; Hassan M. E-Hamonly [A;H], Kohli J.K.; Kumar Rajesh [K; K], Wu Con Xin; Zhou Yu Jiang [W; Z] etc. However, these are in context, different from that of hzzy vector spaces that we consider. So, our definition is different from the existing ones. In this chapter, we introduce the new version of fuzzy inner product space on a fuzzy vector space over the set of' fuzzy real numbers. We prove that a fuzzy inner product generates a hzzy norm, but every fuzzy normed space can be made into a fuzzy semi inner product space. Also introduce the concept of fuzzy orthogonality. Some immediate results are also proved. *Some results contained in this chapter were accepted for publication in the Joural of Fuzzy Mathematics [B; SI3.
2 5.2 Fuzzy inner product Definition Let 3 be a fuzzy vector space over the set of fuzzy numbers. A fuzzy semi inner product on X is a function which assigns a fuzzy number ([u], [v]), V [u], [I?] EX such that the following hold for all [u], [v], [w] E X and [a] E R. 1. ([ul+ [vl, [wl) = ([ul, [wi) +- ([vl, [wi). 2. ([al[ul, [vl) = [a]( [ul, [vl), [a1 E '. 3. ([ul, [ul> > 0, if[u] ;t l([ul, [ul)12 5 ([ul, [ul) ([vl, [vl). Further more if (i) ([ul, [vl) = ([v], [u]), for every [u], [v] E 2. 6) ([ul, [ul) = ii, ifandonlyif [u]= 0, then (,) is called a fuzzy inner product. A fuzzy inner product space is fuzzy vector space with a fuzzy inner product defined in it. Theorem Let X be a fuzzy inner product space. The function (1 11 : F+ R+ defined by (1 [u] )12 = ([u], [u]) is a fuzzy norm on X.
3 ([ul, [ul) 2 6. So, ~l[u]ll' r o and )~[u]j)* = 6, if and only if [u] = 6. ll[al[u1112 = ([al[ul, [al[ul) = [a2] ll[u11l2 i.e.; ll[al[u11l2 = [a2111[ull12 = l[a211 II[UIII~, since [a1 6 R+ Il[ul+ [vll12 = (tult- [vl, [ul +[vl) = ([ul 7 [ul) + (1~19[vl) + ([vl, tul) + (1~1, [vi) = ([ul 9 [ul) + 2([ul, [vl) + ([vl, [vl) = Il[ulll! + 21([uI, [vl)l + ll[vll12 5 Illl + Il[vlll'. Theorem A fuzzy norm on a fuzzy inner product space satisfies the parallelogram equality. Il[ul + [vll12 + Il[ul - [vll12 = 211[u [v11l2. Il[ul + [v ll[ul - [v1112 = ([ul+ [vl, [ul+ [vl) + ([ul- [vl, t ul [vl) = ([~l, [ui) + ([~l, [vl) + ([vl, [ui) + ([vl, [vi) +
4 Theorem on F, xx,. The fuzzy inner product ([u,], [ur]) is a continuous function Let F be a fuzzy inner product space and let {[u,]}and ([vn]} be sequences in F such that lim [u, ]= [u] and lim [vn ] = [v], then I([unI> [vnl)- ([UI~[vI)I = I([unI, [vnl)- ([unl, [vi) + Since {[u,]} and {[v,]) converges, lim ([unl, [vnl) = ([ui, [vi). This completes the proof. 5 I([unl> [vnl) - ([unl, [vi)l + ([~nl, [vi)- (1~1, [~1)1 l([un19 [vi)- ([~l, [vi)i = I([unl, [vnl - [vl)l + I([unl - [ui, [vi)i 5 II[unl ll li[~nl - [viii + ll[~nl - [~lll II[vIII
5 Theorem Every fuzzy normed space can be made into a fuzzy semi inner product space. Let X be a fuzzy normed space. By fuzzy Hahn-Banach theorem corresponding to every [uo] EX, there exists a bounded fuzzy linear map f on.f such that /,o f,," ([uol) = ll[uoll12 and I 1 f,,,)i1 5 ll~~~~lll. Define f\([ul) = ([ul, [vl), then (1) fdu11 + [u21) = ([u,l+ [uzl, [vl) = fv([u,l) + fv(lu21) = ([~ll, [vl) + ([uzl, [vl). (i i) f"([crl[ul) = ([ai[ul, [vl) = [a1 ~"([ui) = [al([ul, [vl) (iii) fv([vl) = 11 [v] 112 > 0. i.e.; ([v], [V]) > o, when [v] +6 (iv) Consider I f l I I I I I 5 I / [vl II II [ul I I
6 i.e.; Il fv([ul>l12 5 Il [vl 112 II [ul 112 = fv([vl> fu([ul) Finite Fuzzy Orthogonal Set Definition A subset E of a fuzzy inner product space X is said to be fuzzy orthogonal inx, if ([u], [v]) = 0, V [u] # [v] E E. Definition A fuzzy orthogonal set E in a fuzzy inner product space is said to be complete, if there exists no other fuzzy orthogonal set properly containing E. Theorem In a fuzzy inner product space T, a fuzzy orthogonal set E is complete if and only if [LI] l E 3 [u] = o. Let E be complete and [u] + 6 be an element of.f such that [u] I E. Hence ([u], El is a fuzzy orthogonal set which properly contains E. But this is a contradiction to the hypothesis that E is complete. Hence we must have [u]=0
7 Conversely let [u] -1 E [LI] = 0. We will prove that E is complete. Let E be not complete, then by definition there exists a fuzzy orthogonal set F such that F properly contains E. In such cases there exists a [u] E F - E, where [u] I E and [u] #o. This is a contradiction. Hence E is complete. Theorem Every finite fuzzy orthogonal set {[el} with ([ei], [ei]) = [I] (where 1 (a) = 1: if a=:] and l(a) =. 0, if a # 1) in a fuzzy inner product space X is linearly independent; and hence we can find an expression for a fuzzy vector [u], which is expressible as a linear combination of the elements of the fuzzy orthogonal sets of non-zero fuzzy vectors. Step 1 Let S = {[el],[e*],...,[ en]) be a fuzzy orthogonal set of X so that ([eil, [ejl) = 0, ifi+j = [I], if i =j. Now consider a linear combination of these fuzzy vectors say
8 If the above relations imply that [ail = 6, 'Vi, then S is linearly independent. Now consider the fuzzy inner product I[ eil, [ejl) = (ii, [ejl) = 0, 'V j, by (14) or ([ail [ell, [ejl) ([aji[eji,[ejl) ([a,l[e,l,[ ejl) = 6 [a11([ell, [ejl) l- [cqil ([ejl, [ejl) [a,] ([en], = 6 o [aj] [1] O = 0 Since ([eji,[ejl) = [I]; [a;l=o, 'V J That is; all the [ai] in C [(xi] [ei] =O are fuzzy zero and hence the set S is linearly independent. Step 2 Let [u] be any fuzzy vector in.f which is expressible as a linear combination of the elements of a fuzzy orthogonal set, if [u] = C [ai][ ei], then ([u], [eji) = (E[ail[ eil, ej) = aj (e; e;) = aj 1.e.; [ajl = ([ul? [ejl)
9 Theorem Let {[el], [e2],..., [en]) be a finite fuzzy orthogonal set with ([ei], [ei]) = [l] in a fuzzy inner product space 2. If u is any fuzzy vector in X, then T([t~],[e~])~ I JJ[u])/~. i=l Step 1 Further [u] - t([u],llei])[ej] I [ej], for each j. i=l Since the set {[el], [e2].,..., [e,]) is a finite fuzzy orthogonal set. We have (lei], [ej])=o, for i + j and also given that ([ei], [ej]) = 1, for i = j. Choose [ v] = [u] - T([u],[e,~)[~,].,=I We know that II[VIII~ 2 0 For the sake of simplicity let us call ([u], [ei]) = [ai].
10 In the last term performing sum with respect to j first, all the terms will vanish except one term when j = i. NOW [a,] = ([u], Lei]) and [ajl = ([ul, [ejl). Step 2 Consider the fuzzy inner product ([ul - ~tul,[eil)l:eil.. [ejl), for each j iil
11 = ([ui, [eji) - ([ui, [ejl) ([eji, [eji) = ([u], [ej]) - ([u], [ej]) = 6, for each j Now ([u], [v]) = 6 a [u] is orthogonal to [v]. ie. [u] -g([u],[e;l) [ej] 1 [ej], for each j. i=l Theorem Let x be a fuzzy inner product space and let {[ei]} be a fuzzy orthogonal set with ([ei], [e,]) = 1 in Z. Then the following conditions are all equivalent to one another. (i) (ii) (iii) {[ei]} is complete. [u]l{[ei]) 3 [u]=o. If [u] is an arbitrary vector in Z then [u] = C([U], [eil) [eil. (iv) If [u] is an arbitrary vector in X then 1([u]ll2 = C([u], [ei~)~. (i) (ii). Let {[ei]] be complete and [u] be an element of X such that [u]l{[ei]). Hence ([u], {[ei])} is a fuzzy orthogonal set, which
12 properly contains ([ei]). Hut this is a contradiction to the hypothesis that {[ei]) is complete. Hence [u] = 0. (ii) (iii). Given [u] I {[ei]} = [u] =6, we have to show that [ ~ = l ~([ui, lei]) lei]. Consider [u] - C([u],[ei]) [ei] and we shall show that it is I{[ei]}. Choose any [e;] E f[ei]}, then Sum with respect to i, all terms vanish except one = ([ul, [ejl) - ([ul, [ejl) ([ejl, [ejl) = (1~1, [ejl)- ([ul, [ejl) = 0 [u] - C([u].[e,]) [ei] l [ej], for each j,=i 3 [u] -x([u],le,])[ei] =O, by the given condition,=i
13 (iii) a (iv). Given [ul= ([ul, [ei]) Lei], to prove ll[~]lf = C ([u], [ei112 Summing with respect to j first, (iv) 3 (i). Given ~l[u]ll' = C ([u], [ei])'. To prove that {[e,]) is complete, let ([ei]) be not complete. Then there exists {[v], {[ei])), where [v] # 6 is complete. [v] I{[ei]} =a ([v], [q]) = 6, Vi. (15) Now [l[ulllz = C ([ul, [eih2, by (iv). ll[v111~ =o =3 [v] =o, which is a contradiction. Hence {[e;]} is complete
FUZZY TOPOLOGICAL VECTOR SPACE
CHAPTER 6 FUZZY TOPOLOGICAL VECTOR SPACE AND TOPOLOGICAL GROUP 6.1 Introduction: Fuzzy topological vector spaces are introduced by A. K. Katsaras and D. B. Liu [K; L]. In 1981, Katsaras [kat], changed
More information1. Chapter 1, # 1: Prove that for all sets A, B, C, the formula
Homework 1 MTH 4590 Spring 2018 1. Chapter 1, # 1: Prove that for all sets,, C, the formula ( C) = ( ) ( C) is true. Proof : It suffices to show that ( C) ( ) ( C) and ( ) ( C) ( C). ssume that x ( C),
More informationLecture-12: Closed Sets
and Its Examples Properties of Lecture-12: Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline Introduction and Its Examples Properties of 1 Introduction
More informationAN ALGORITHM FOR A MINIMUM COVER OF A GRAPH
AN ALGORITHM FOR A MINIMUM COVER OF A GRAPH ROBERT Z. NORMAN1 AND MICHAEL O. RABIN2 Introduction. This paper contains two similar theorems giving conditions for a minimum cover and a maximum matching of
More informationON WEAKLY COMPACT SUBSETS OF BANACH SPACES
ON WEAKLY COMPACT SUBSETS OF BANACH SPACES H. H. CORSON1 AND J. LINDENSTRAUSS2 Introduction. The two sections of this note are independent, but they are related by the fact that both use the results of
More informationDiscrete Cubic Interpolatory Splines
Publ RIMS, Kyoto Univ. 28 (1992), 825-832 Discrete Cubic Interpolatory Splines By Manjulata SHRIVASTAVA* Abstract In the present paper, existence, uniqueness and convergence properties of a discrete cubic
More informationCD _. _. 'p ~~M CD, CD~~~~V. C ~'* Co ~~~~~~~~~~~~- CD / X. pd.0 & CD. On 0 CDC _ C _- CD C P O ttic 2 _. OCt CD CD (IQ. q"3. 3 > n)1t.
n 5 L n q"3 +, / X g ( E 4 11 " ') $ n 4 ) w Z$ > _ X ~'* ) i 1 _ /3 L 2 _ L 4 : 5 n W 9 U~~~~~~ 5 T f V ~~~~~~~~~~~~ (Q ' ~~M 3 > n)1 % ~~~~V v,~~ _ + d V)m X LA) z~~11 4 _ N cc ', f 'd 4 5 L L " V +,
More informationLecture : Topological Space
Example of Lecture : Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline Example of 1 2 3 Example of 4 5 6 Example of I Topological spaces and continuous
More informationCompact Sets. James K. Peterson. September 15, Department of Biological Sciences and Department of Mathematical Sciences Clemson University
Compact Sets James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University September 15, 2017 Outline 1 Closed Sets 2 Compactness 3 Homework Closed Sets
More informationVERTICES OF LOCALIZED IMBALANCE IN A BIASED GRAPH
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 101, Number 1, September 1987 VERTICES OF LOCALIZED IMBALANCE IN A BIASED GRAPH THOMAS ZASLAVSKY ABSTRACT. A biased graph consists of a graph T and
More informationLecture 15: The subspace topology, Closed sets
Lecture 15: The subspace topology, Closed sets 1 The Subspace Topology Definition 1.1. Let (X, T) be a topological space with topology T. subset of X, the collection If Y is a T Y = {Y U U T} is a topology
More informationTopology and Topological Spaces
Topology and Topological Spaces Mathematical spaces such as vector spaces, normed vector spaces (Banach spaces), and metric spaces are generalizations of ideas that are familiar in R or in R n. For example,
More informationifn >-- 2 is even, ifn is odd, ifn =0,
SIAM J. ALG. DISC. METH. Voi. 7, No. 1, January 1986 1986 Society for Industrial and Applied Mathematics 015 THE NUMBER OF MAXIMAL INDEPENDENT SETS IN A TREE* HERBERT S. WILFf Abstract. can have. We find
More information(Received Judy 13, 1971) (devised Nov. 12, 1971)
J. Math. Vol. 25, Soc. Japan No. 1, 1973 Minimal 2-regular digraphs with given girth By Mehdi BEHZAD (Received Judy 13, 1971) (devised Nov. 12, 1971) 1. Abstract. A digraph D is r-regular if degree v =
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 informationOn Generalized PreSemi Closed Sets in Intuitionistic Fuzzy Topological Spaces
International Journal of Science and Technology Volume 2 No. 11, November, 2013 On Generalized PreSemi Closed Sets in Intuitionistic Fuzzy Topological Spaces 1 T. Sampoornam, 1 Gnanambal Ilango, 2 K. Ramesh
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 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 information1. Suppose you are given a magic black box that somehow answers the following decision problem in polynomial time:
1. Suppose you are given a magic black box that somehow answers the following decision problem in polynomial time: Input: A CNF formula ϕ with n variables x 1, x 2,..., x n. Output: True if there is an
More informationIndependence and Cycles in Super Line Graphs
Independence and Cycles in Super Line Graphs Jay S. Bagga Department of Computer Science Ball State University, Muncie, IN 47306 USA Lowell W. Beineke Department of Mathematical Sciences Indiana University
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 informationCardinality of Sets MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Cardinality of Sets Fall / 15
Cardinality of Sets MAT Transition to Higher Mathematics Fall 0 MAT (Transition to Higher Math) Cardinality of Sets Fall 0 / Outline Sets with Equal Cardinality Countable and Uncountable Sets MAT (Transition
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 information9.5 Equivalence Relations
9.5 Equivalence Relations You know from your early study of fractions that each fraction has many equivalent forms. For example, 2, 2 4, 3 6, 2, 3 6, 5 30,... are all different ways to represent the same
More informationTHE ISOMORPHISM PROBLEM FOR SOME CLASSES OF MULTIPLICATIVE SYSTEMS
THE ISOMORPHISM PROBLEM FOR SOME CLASSES OF MULTIPLICATIVE SYSTEMS BY TREVOR EVANS 1. Introduction. We give here a solution of the isomorphism problem for finitely presented algebras in various classes
More informationWu, Y.-Q., The reducibility of surgered 3-manifolds, Topology and its Applications 43 (1992)
Topology and its Applications 43 (1992) 213-218 North-Holland 213 The reducibility Smanifolds of surgered Ying-Qing Wu Department of Mathematics, University of Texas at Austin, Austin, TX 78712, USA; and
More informationCompactness in Countable Fuzzy Topological Space
Compactness in Countable Fuzzy Topological Space Apu Kumar Saha Assistant Professor, National Institute of Technology, Agartala, Email: apusaha_nita@yahoo.co.in Debasish Bhattacharya Associate Professor,
More informationA WILD CANTOR SET IN THE HILBERT CUBE
PACIFIC JOURNAL OF MATHEMATICS Vol. 24, No. 1, 1968 A WILD CANTOR SET IN THE HILBERT CUBE RAYMOND Y. T. WONG Let E n be the Euclidean w-space. A Cantor set C is a set homeomorphic with the Cantor middle-third
More informationOn the Recursion-Theoretic Complexity of Relative Succinctness of Representations of Languages
INFORMATION AND CONTROL 52, 2--7 (1982) On the Recursion-Theoretic Complexity of Relative Succinctness of Representations of Languages Louise HAY Department of Mathematics, Statistics, and Computer Science,
More informationPower Set of a set and Relations
Power Set of a set and Relations 1 Power Set (1) Definition: The power set of a set S, denoted P(S), is the set of all subsets of S. Examples Let A={a,b,c}, P(A)={,{a},{b},{c},{a,b},{b,c},{a,c},{a,b,c}}
More informationTrees with many leaves
Trees with many leaves N. V. Gravin Abstract In this note we consider the problem of nding a spanning tree with large number of leaves. We overview some known facts about this question. In details We consider
More informationSTAR ARBORICITY. NOGA ALON, COLIN McDIARMID and BRUCE REED. Received September 11, 1989
COMBINATORICA Akad~miai Kiadd - Springer-Verlag COMBINATORICA 12 (4) (1992) 375-380 STAR ARBORICITY NOGA ALON, COLIN McDIARMID and BRUCE REED Received September 11, 1989 A star forest is a forest all of
More information[Ramalingam, 4(12): December 2017] ISSN DOI /zenodo Impact Factor
GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES FORCING VERTEX TRIANGLE FREE DETOUR NUMBER OF A GRAPH S. Sethu Ramalingam * 1, I. Keerthi Asir 2 and S. Athisayanathan 3 *1,2 & 3 Department of Mathematics,
More information(i, j)-almost Continuity and (i, j)-weakly Continuity in Fuzzy Bitopological Spaces
International Journal of Scientific and Innovative Mathematical Research (IJSIMR) Volume 4, Issue 2, February 2016, PP 89-98 ISSN 2347-307X (Print) & ISSN 2347-3142 (Online) www.arcjournals.org (i, j)-almost
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 information60 2 Convex sets. {x a T x b} {x ã T x b}
60 2 Convex sets Exercises Definition of convexity 21 Let C R n be a convex set, with x 1,, x k C, and let θ 1,, θ k R satisfy θ i 0, θ 1 + + θ k = 1 Show that θ 1x 1 + + θ k x k C (The definition of convexity
More informationDefinition: A graph G = (V, E) is called a tree if G is connected and acyclic. The following theorem captures many important facts about trees.
Tree 1. Trees and their Properties. Spanning trees 3. Minimum Spanning Trees 4. Applications of Minimum Spanning Trees 5. Minimum Spanning Tree Algorithms 1.1 Properties of Trees: Definition: A graph G
More informationSome Properties of Soft -Open Sets in Soft Topological Space
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn:2319-765x. Volume 9, Issue 6 (Jan. 2014), PP 20-24 Some Properties of Soft -Open Sets in Soft Topological Space a Gnanambal Ilango, b B.
More informationAssignment 4 Solutions of graph problems
Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of
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 informationRobust time-varying shortest path with arbitrary waiting time at vertices
Croatian Operational Research Review 525 CRORR 8(2017), 525 56 Robust time-varying shortest path with arbitrary waiting time at vertices Gholamhassan Shirdel 1, and Hassan Rezapour 1 1 Department of Mathematics,
More informationOn Locating Domination Number of. Boolean Graph BG 2 (G)
International Mathematical Forum, Vol. 12, 2017, no. 20, 973-982 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/imf.2017.7977 On Locating Domination Number of Boolean Graph BG 2 (G) M. Bhanumathi
More informationSUMS OF SETS OF CONTINUED FRACTIONS
proceedings of the american mathematical society Volume 30, Number 2. October 1971 SUMS OF SETS OF NTINUED FRACTIONS T. W. CUSICK AND R. A. LEE Abstract. For each integer k jjj 2, let S(k) denote the set
More information2 A topological interlude
2 A topological interlude 2.1 Topological spaces Recall that a topological space is a set X with a topology: a collection T of subsets of X, known as open sets, such that and X are open, and finite intersections
More informationOn the Finiteness of the Recursive Chromatic Number
On the Finiteness of the Recursive Chromatic Number William I Gasarch Andrew C.Y. Lee Abstract A recursive graph is a graph whose vertex and edges sets are recursive. A highly recursive graph is a recursive
More informationRESULTS ON HESITANT FUZZY SOFT TOPOLOGICAL SPACES
ISSN 2320-9143 1 International Journal of Advance Research, IJOAR.org Volume 4, Issue 3, March 2016, Online: ISSN 2320-9143 RESULTS ON HESITANT FUZZY SOFT TOPOLOGICAL SPACES A. Sreedevi, Dr.N.Ravi Shankar
More information11. APPROXIMATION ALGORITHMS
11. APPROXIMATION ALGORITHMS load balancing center selection pricing method: vertex cover LP rounding: vertex cover generalized load balancing knapsack problem Lecture slides by Kevin Wayne Copyright 2005
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 information1 to 32. Car Park. Drawing 1. Farley Park. Playing Field. Games Area ELIZABETH ROAD m DUNKIRK AVENUE. El Sub Sta m. Def.
iv z u. u..... v, // i.. i... Z v... p u. i.... i Ji/ :.. (i u p p p Ji/ u p i u u. i Xvi u ' v u. u i p. ui i Vi (i i i i.. V Z. v. i u. u u u ui V.. Q Vi u. i u.... i. i..... i. i i..... ui u. u u....
More informationGraphs. Pseudograph: multiple edges and loops allowed
Graphs G = (V, E) V - set of vertices, E - set of edges Undirected graphs Simple graph: V - nonempty set of vertices, E - set of unordered pairs of distinct vertices (no multiple edges or loops) Multigraph:
More informationIterative Algorithms I: Elementary Iterative Methods and the Conjugate Gradient Algorithms
Iterative Algorithms I: Elementary Iterative Methods and the Conjugate Gradient Algorithms By:- Nitin Kamra Indian Institute of Technology, Delhi Advisor:- Prof. Ulrich Reude 1. Introduction to Linear
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 informationChapter 3: Paths and Cycles
Chapter 3: Paths and Cycles 5 Connectivity 1. Definitions: Walk: finite sequence of edges in which any two consecutive edges are adjacent or identical. (Initial vertex, Final vertex, length) Trail: walk
More informationCL i-1 2rii ki. Encoding of Analog Signals for Binarv Symmetric Channels A. J. BERNSTEIN, MEMBER, IEEE, K. STEIGLITZ, MEMBER,
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-12, NO. 4, OCTOBER 1966 425 Encoding of Analog Signals for Binarv Symmetric Channels A. J. BERNSTEIN, MEMBER, IEEE, K. STEIGLITZ, MEMBER, IEEE, AND J. E.
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 informationGeneralised Mean Averaging Interpolation by Discrete Cubic Splines
Publ. RIMS, Kyoto Univ. 30 (1994), 89-95 Generalised Mean Averaging Interpolation by Discrete Cubic Splines By Manjulata SHRIVASTAVA* Abstract The aim of this work is to introduce for a discrete function,
More informationIndexable and Strongly Indexable Graphs
Proceedings of the Pakistan Academy of Sciences 49 (2): 139-144 (2012) Copyright Pakistan Academy of Sciences ISSN: 0377-2969 Pakistan Academy of Sciences Original Article Indexable and Strongly Indexable
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 informationGeneralized Semipre Regular Closed Sets in Intuitionistic Fuzzy Topological Spaces
Generalized Semipre Regular Closed Sets in Intuitionistic Fuzzy Topological Spaces K. Ramesh MPhil Scholar., Department of Mathematics, NGM College, Pollachi-642001, Tamil Nadu, India. M. Thirumalaiswamy
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 informationOptimal Assignments in an Ordered Set: An Application of Matroid Theory
JOURNAL OF COMBINATORIAL THEORY 4, 176-180 (1968) Optimal Assignments in an Ordered Set: An Application of Matroid Theory DAVID GALE Operations Research Center, University of California, Berkeley, CaliJbrnia
More informationAnalysis in Integer and Fractional Dimensions
Analysis in Integer and Fractional Dimensions Ron Blei University of Connecticut ^ i UNIVERSITY PRE^S Contents Preface Acknowledgements I A Prologue: Mostly Historical 1 1. From the Linear to the Bilinear
More information4 Generating functions in two variables
4 Generating functions in two variables (Wilf, sections.5.6 and 3.4 3.7) Definition. Let a(n, m) (n, m 0) be a function of two integer variables. The 2-variable generating function of a(n, m) is F (x,
More informationIn this chapter, we define limits of functions and describe some of their properties.
Chapter 2 Limits of Functions In this chapter, we define its of functions and describe some of their properties. 2.. Limits We begin with the ϵ-δ definition of the it of a function. Definition 2.. Let
More informationEach copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.
Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming Author(s): A. L. Soyster Source: Operations Research, Vol. 21, No. 5 (Sep. - Oct., 1973), pp. 1154-1157
More informationInduction and Recursion. CMPS/MATH 2170: Discrete Mathematics
Induction and Recursion CMPS/MATH 2170: Discrete Mathematics Outline Mathematical induction (5.1) Sequences and Summations (2.4) Strong induction (5.2) Recursive definitions (5.3) Recurrence Relations
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 6.854J / 18.415J Advanced Algorithms Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advanced
More informationA Catalog of While Loop Specification Patterns
A Catalog of While Loop Specification Patterns Aditi Barua and Yoonsik Cheon TR #14-65 September 2014 Keywords: functional program verification, intended functions, program specification, specification
More informationMath 170- Graph Theory Notes
1 Math 170- Graph Theory Notes Michael Levet December 3, 2018 Notation: Let n be a positive integer. Denote [n] to be the set {1, 2,..., n}. So for example, [3] = {1, 2, 3}. To quote Bud Brown, Graph theory
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 informationTHE TRANSITIVE REDUCTION OF A DIRECTED GRAPH*
SIAM J. COMPUT. Vol. 1, No. 2, June 1972 THE TRANSITIVE REDUCTION OF A DIRECTED GRAPH* A. V. AHO, M. R. GAREY" AND J. D. ULLMAN Abstract. We consider economical representations for the path information
More informationD T()x- lira h-( T( + h)x- T()x)
No. 10-] 1149 249. Note on the Representation of Semi.Groups of Non.Linear Operators By Shinnosuke OAu Waseda University (Comm. by Kinjir Kuu,..., Dee. 12, 1966) 1o Let X be a Banach space and let {T()}_0
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 informationLecture 19 Subgradient Methods. November 5, 2008
Subgradient Methods November 5, 2008 Outline Lecture 19 Subgradients and Level Sets Subgradient Method Convergence and Convergence Rate Convex Optimization 1 Subgradients and Level Sets A vector s is a
More informationMATH 54 - LECTURE 10
MATH 54 - LECTURE 10 DAN CRYTSER The Universal Mapping Property First we note that each of the projection mappings π i : j X j X i is continuous when i X i is given the product topology (also if the product
More informationON HOLONOMY COVERING SPACES
ON HOLONOMY COVERING SPACES LOUIS AUSLANDER1 Introduction. In [l] L. Markus and the author introduced the concept of holonomy covering spaces for flat affinely connected manifolds or what are also called
More informationFundamental Properties of Graphs
Chapter three In many real-life situations we need to know how robust a graph that represents a certain network is, how edges or vertices can be removed without completely destroying the overall connectivity,
More informationarxiv: v2 [math.co] 13 Aug 2013
Orthogonality and minimality in the homology of locally finite graphs Reinhard Diestel Julian Pott arxiv:1307.0728v2 [math.co] 13 Aug 2013 August 14, 2013 Abstract Given a finite set E, a subset D E (viewed
More informationGeneralized Interlinked Cycle Cover for Index Coding
Generalized Interlinked Cycle Cover for Index Coding Chandra Thapa, Lawrence Ong, and Sarah J. Johnson School of Electrical Engineering and Computer Science, The University of Newcastle, Newcastle, Australia
More informationOpen and Closed Sets
Open and Closed Sets Definition: A subset S of a metric space (X, d) is open if it contains an open ball about each of its points i.e., if x S : ɛ > 0 : B(x, ɛ) S. (1) Theorem: (O1) and X are open sets.
More information2. CONNECTIVITY Connectivity
2. CONNECTIVITY 70 2. Connectivity 2.1. Connectivity. Definition 2.1.1. (1) A path in a graph G = (V, E) is a sequence of vertices v 0, v 1, v 2,..., v n such that {v i 1, v i } is an edge of G for i =
More informationChapter 4 Concepts from Geometry
Chapter 4 Concepts from Geometry An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Line Segments The line segment between two points and in R n is the set of points on the straight line joining
More informationOn Fuzzy Topological Spaces Involving Boolean Algebraic Structures
Journal of mathematics and computer Science 15 (2015) 252-260 On Fuzzy Topological Spaces Involving Boolean Algebraic Structures P.K. Sharma Post Graduate Department of Mathematics, D.A.V. College, Jalandhar
More informationLOW-DENSITY PARITY-CHECK (LDPC) codes [1] can
208 IEEE TRANSACTIONS ON MAGNETICS, VOL 42, NO 2, FEBRUARY 2006 Structured LDPC Codes for High-Density Recording: Large Girth and Low Error Floor J Lu and J M F Moura Department of Electrical and Computer
More informationSoft Regular Generalized Closed Sets in Soft Topological Spaces
Int. Journal of Math. Analysis, Vol. 8, 2014, no. 8, 355-367 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.4125 Soft Regular Generalized Closed Sets in Soft Topological Spaces Şaziye
More informationMotion Planning in Certain Lexicographic Product Graphs
International J.Math. Combin. Vol.1(2018), 146-153 Motion Planning in Certain Lexicographic Product Graphs A. D Akwu and O. Oyewumi (Department of Mathematics, Federal University of Agriculture, Makurdi,
More informationInternational Journal of Scientific & Engineering Research, Volume 7, Issue 2, February ISSN
International Journal of Scientific & Engineering Research, Volume 7, Issue 2, February-2016 149 KEY PROPERTIES OF HESITANT FUZZY SOFT TOPOLOGICAL SPACES ASREEDEVI, DRNRAVI SHANKAR Abstract In this paper,
More informationCardinality Lectures
Cardinality Lectures Enrique Treviño March 8, 014 1 Definition of cardinality The cardinality of a set is a measure of the size of a set. When a set A is finite, its cardinality is the number of elements
More informationLecture 9: Sorting Algorithms
Lecture 9: Sorting Algorithms Bo Tang @ SUSTech, Spring 2018 Sorting problem Sorting Problem Input: an array A[1..n] with n integers Output: a sorted array A (in ascending order) Problem is: sort A[1..n]
More informationReflection in the Chomsky Hierarchy
Reflection in the Chomsky Hierarchy Henk Barendregt Venanzio Capretta Dexter Kozen 1 Introduction We investigate which classes of formal languages in the Chomsky hierarchy are reflexive, that is, contain
More informationCOMPUTABLE FRAMES IN COMPUTABLE BANACH SPACES
International Journal of Analysis and Applications ISSN 2291-8639 Volume 11, Number 2 (2016), 93-100 http://www.etamaths.com COMPUTABLE FRAMES IN COMPUTABLE BANACH SPACES S.K. KAUSHIK 1, AND POONAM MANTRY
More informationFUZZY WEAKLY CLOSED SETS
Chapter 3 FUZZY WEAKLY CLOSED SETS In this chapter, we introduce another type of fuzzy closed set, called fuzzy weakly closed set in an FTS. Alongwith the study of fundamental results of such closed sets,
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 information= f (a, b) + (hf x + kf y ) (a,b) +
Chapter 14 Multiple Integrals 1 Double Integrals, Iterated Integrals, Cross-sections 2 Double Integrals over more general regions, Definition, Evaluation of Double Integrals, Properties of Double Integrals
More informationUnderstanding Quadrilaterals
12 Understanding Quadrilaterals introduction In previous classes, you have learnt about curves, open and closed curves, polygons, quadrilaterals etc. In this chapter, we shall review, revise and strengthen
More informationOn Soft Topological Linear Spaces
Republic of Iraq Ministry of Higher Education and Scientific Research University of AL-Qadisiyah College of Computer Science and Formation Technology Department of Mathematics On Soft Topological Linear
More informationof Nebraska - Lincoln. Follow this and additional works at:
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Faculty Publications, Department of Mathematics Mathematics, Department of 6-1975 POLYGONS HAVE EARS G.H. Meisters University
More informationUNCLASSIFIED , DEFENSE DOCUMENTATION CENTER FOR SCIENTIFIC AND TECHNICAL INFC,;MATION STATION. ALEXANDRIA. VIRGINIA UNCLASSIFIED
UNCLASSIFIED,419599 AD DEFENSE DOCUMENTATION CENTER FOR SCIENTIFIC AND TECHNICAL INFC,;MATION CAMERON STATION. ALEXANDRIA. VIRGINIA UNCLASSIFIED smazo: Vem gweainat or other drwidnu, spt. ttions or other
More informationarxiv: v1 [math.co] 3 Apr 2016
A note on extremal results on directed acyclic graphs arxiv:1604.0061v1 [math.co] 3 Apr 016 A. Martínez-Pérez, L. Montejano and D. Oliveros April 5, 016 Abstract The family of Directed Acyclic Graphs as
More informationGeometry of manifolds
Geometry of manifolds lecture 1 Misha Verbitsky Université Libre de Bruxelles September 21, 2015 1 The Plan. Preliminaries: I assume knowledge of topological spaces, continuous maps, homeomorphisms, Hausdorff
More information