PRIMITIVE σ-spaces. by Rick E. Ruth
|
|
- Lesley Mosley
- 5 years ago
- Views:
Transcription
1 Volume 8, 1983 Pages PRIMITIVE σ-spaces by Rick E. Ruth Topology Proceedigs Web: Mail: Topology Proceedigs Departmet of Mathematics & Statistics Aubur Uiversity, Alabama 36849, USA ISSN: COPYRIGHT c by Topology Proceedigs. All rights reserved.
2 TOPOLOGY PROCEEDINGS Volume PRIMITIVE ti -SPACES RickE. Ruth A iterestig result due to Fletcher ad Lidgre [FL ] is that spaces havig primitive bases are 8-spaces. 2 Wicke explored this relatioship further by discussig the use of 8-space cocepts i base of coutable order theory [Will ad by givig a fuctioal characterizatio of primitive base [Wi ]. His work led him to ask for a otrivial 2 property to add to 8-space i order to obtai primitive base. I sectio 1 we provide a aswer to Wicke's questio by defiig a property P ad showig that a space has a primitive base if ad oly if it is a 8-space havig property P. The author wishes to thak J. Chaber for poitig out that this property is ot ew ad that it was defied ad studied i [Ch ] as it relates to a-spaces. Further 2 ramificatios (as it relates to spaces havig a primitive base) icludig additioal diagoal theorems are discussed here. We tur i sectio 2 to a exploratio of the class of a-scattered spaces as a special subclass of spaces havig this property. Uless otherwise stated, all spaces are regular TO except i defiitios, where oly those separatio properties stated are assumed. 1. Primitive (T -Spaces We begi with some defiitios.
3 ~ rt =r 6-refiablet1 1 e-refiable BCD-spaces.. 11 ~ Sc-spaces + SIC-diagoal 1 11 Closed sets Closed sets SIC SIC Primitive 11 base spaces ~ ~ Primitive 1 q-spaces + Primitive diagoal Primitive Primitive a-spaces Developable spaces -c lr w~-spaces + G8-diagrr e-spaces C Do-sp~es First coutable :4c spaces.. we-spaces L ~ q-spaces + It e-diagoal a~spaces w.-s 0"\ Diagram 1
4 TOPOLOGY PROCEEDINGS volume Defiitio (Hodel, [Ho]). A space (X,]) is a e-space if there is a fuctio g: Nx X ~ ] havig the followig properties. a) x c EN g (, x) for each x E X. b) If {p,x } ~ g(,y ) ad Y E g(,p) for each E N, the p is a cluster poit of ( x : EN). If i b) we just require that (x : EN) has a cluster poit, we call X a we-space. b Fletcher ad Lidgre [FL 2 ] characterize e-spaces by replacig b) with the followig. l ) If for each E N, Y E g(,p) ad p E g(,y ), the {g(,y ): E N} is a base at p. If i b l ) we just require that ENg(,y ) a-diagoal [Wi ]. l {p}, X is said to have a The cocept of primitive base was itroduced by Worrell ad Wicke i We state below characterizatios of this cocept ad of the associated cocepts of primitive q-space ad primitive diagoal foud i [Wi 2.3]. These may serve l, as defiitios. 1.2 Theorem [Wi 2.3]. For each E N~ let W.be a l, well-ordered collectio of ope sets i X such that W covers X. For each x E X, let F(X,W ) deote the first elemet of W that aotais x. a) If for each x E X, {F(X,W ): E N} is a base at x, the X has a primitive base. b) If Y E F(x,W) for all E N implies (y : E N> clusters, the X is a primitive g-space. c) If for each x E X, ENF(x,W) = {x}, the X has a primitive diagoal.
5 318 Ruth From this characterizatio it is ot hard to see that the class of all e-spaces cotais the class of spaces havig a primitive base. (For a more comprehesive view of some of the relatioships existig amog the spaces metioed here, the reader is referred to Diagram 1 i the Itroductio.) It is the a atural questio to ask what otrivial property a e-space must possess i order to have a primitive base. We aswer this questio after the followig defiitio ad observatios. 1.3 Defiitio. Suppose a space X has a sequece (y : EN> of well-ordered ope covers. a) If F(X,,q) = F(X,,q) for each E N implies (x : E N> clusters to x, the X is called a primitive a-space [Ch 2 ]. b) If F(x,~) = F(x,~ ) for each E N implies I I (x : E N> clusters, the X is called a primitive wa-space. c) If for each x E X, EN{Y: F(X'~) = F(Y'~)} = {x}, the X is called a primitive ai-space [see Ch 2 ]. 1.4 Questios. a) Is every ai-space a primitive ai-space? b) Is every wa-space a primitive wa-space? Chaber poses a) i [Ch 2 ]i we pose b) i view of the cocept of wa-space foud i [FL ] ad for the sake of coml pleteess. ai-space. Clearly, a) Every T l primitive a-space is a primitive a-space. b) Every space havig a primitive base is a primitive
6 TOPOLOGY PROCEEDINGS Volume ai-space. c) Every primitive q-space is a primitive wa-space. d) Every space with a primitive diagoal is a primitive 1.5 Theorem. A space X has a primitive base if ad ozy if it is a e-space ad a primitive a-space. Proof. We eed oly show sufficiecy. Assume X is well-ordered. Let ( Y : EN> be a sequece witessig the fact that X is a primitive a-space, ad let g be a fuctio witessig that X is a e-space. For each E N ad for each x E X, let H(x,) = F(X,y ) g(,x'), where x' is the first y i X such that F(y,y ) = F(X'~) ad x E g(,y). Thus, {H(x,): x E X} is a well-ordered cover of X such that for each x E X, the first elemet cotaiig x is H(x,). Suppose H(x,) = F(x,y ) g(,x ) for each E N. The F(X,y ) F(X,y ) for each E N. Thus (x : E N> clusters to x. {H(x,): ~ N} is a base at x. Sice X is a e-space, it follows that 1.6 Theorem. A primitive a-space which is azso a we-space is a primitive q-space. 1.7 Theorem. A primitive a-space with a e-diagoaz has a primitive diagoaz. The proofs of the above two theorems are obtaied by makig the appropriate chages i the proof of 1.5. The followig examples show that we caot improve upo Theorem 1.5 by usig DO-space or we-space i place of e-space. (See Diagram 1 i the Itroductio.)
7 320 Ruth 1.8 Examples. a) Heath [He, 4.1] has a example of a bow-tie-type space which is a DO-space (i.e., compact sets have coutable character) but which is ot a we-space. This space is a primitive a-space. b) Let X [0,1] U [2,3]. Defie a topology o X as follows. If x E [0,1], the a eighborhood U' of x is a usual eighborhood Utogether with {y + 2: y E U\{x}}. If x E [2,3], the {x} is ope. This space is a primitive a-space ad a we-space, but ot a a-space. 1.9 Questios. a) Is every primitive wa-space which is also a a-space a primitive a-space? b) Does every primitive q-space with a a-diagoal have a primitive base? If we try improvig 1.5 by replacig primitive a-space with primitive wa-space, the a) is a atural questio. This is related to 6) sice every primitive q-space is a primitive wa-space ad a wa-space, ad every wa-space with a a-diagoal is a a-space. Thus, should our questio a) be aswered i the affirmative, so will b); should b) be aswered i the egative, so will a). Questio b) was posed by Wicke i [Will. A stregtheig of the cocept of a-space alog with the associated cocept of wa-space was itroduced by Fletcher ad Lidgre i [FLll. These cocepts are called ~-space ad w~-space respectively. We add a defiitio to theirs ad obtai results aalogous to 1.5, 1.6 ad 1.7 for primitive wa-spaces. Hece, primitive a-space ca be
8 TOPOLOGY PROCEEDINGS Volume weakeed if a-space is stregtheed ad still obtai primitive base Defiitio [FL ]. A space (X,]) is a ~-space l provided there is a fuctio g: N x X + ] such that if for each E N, {p,x } c g(,y ) ad {y : EN> has a cluster - poit, the p is a cluster poit of {x : E N> (or equiva letly, if p E g(,y ) for E Nad {y : E N> has a cluster poit, the {g(,y ): E N} is a base at p). If we just require that {x : E N> has a cluster poit, we call X a w~-space Defiitio. A space (X,]) is said to have a ~-diagoal if ad oly if there is a fuctio g: N x X + ] such that for each x E X, if for some p E X ad each E N, Clearly, ~-spaces have ~-diagoals ad spaces with ~-diagoals have a-diagoals Theorem. A primitive wcr-space whiah is also a ~-space has a primitive base Theorem. A primitive wcr-space which is also a w~-space is a primitive q-space Theorem. A primitive wa-space with a ~-diagoal has a primitive diagoaz. The proofs of the above are all aalogous to the proof of 1.5.
9 322 Ruth 1.15 ExampLes. a) 001' the ~et of all ordials less tha the first ucoutable ordial, with the order topology has a base of coutable order (hece, a primitive base) but is ot a ~-space. Thus, the coverse of ~heorem 1.12 is false (cf. 1.5). b) The Michael lie (i.e., the set of real umbers R with the topo~ogy geerated by the usual topology for the reals together with the sigletos of the irratioal poits) shows that a primitive a-space which is also a ~-space eed ot have a base of coutable order. Clearly, if we demad of primitive wa (resp. w~)-spaces that (x : E N> clusters to y E ENF(X'~) (ENg('Y))' the we obtai results such as the followig Theorem [FL Corollary to 2.2]. A we-space with 2, a e-diagoaz is a e-space. This raises the followig questios Questio. Does every regular we (primitive wa, w~)-space have a we (primitive wa, w~)-fuctio which satisfies the stroger coditio above? This type of questio (cf below) arises agai cocerig the cocept of mootoic S-space i view of Theorem 1.19 ad the remark which follows it. This theorem illustrates the "completeess" required of e-spaces i order to obtai spaces havig a base of coutable order.
10 TOPOLOGY PROCEEDINGS Volume Defiitio (Chaber [ChI' 1.6]). A space X is called a mootoic a-space if ad oly if for all x E X there is a decreasig sequece < B (x): E N> of bases at x such that if, for all E N, B E B (x ), B +1 c B, - ad EN B ~~, the <x : EN> has a cluster poit Theorem [Wi l, 5.1]. Let X be a regular T mool toic a-space. The the folzowig are equivalet: a) X has a base of coutable order. b) X is a e-space. If i the defiitio of mootoic a-space oe required the stroger coditio that <x : E N> has a cluster poit y E ENB' the it is easier to argue tha the above that a e-space which is this stroger mootoic a-space has a base of coutable order. Thus, we ask the followig Questio. Does every regular mootoic a-space satisfy the stroger coditio above? 2. q -Scattere4 Spaces Spaces which are a-scattered (icludig a~(closed ad scattered) ad scattered spaces) are special cases of primitive a-spaces. This might be expected i light of the followig which are foud all together i [WW]. a) Every T first coutable scattered space has a l mootoically complete base of coutable order. b) Every a-(closed ad scattered) T l first coutable space has a base of coutable order. c) Every a-scattered first coutable space has a primitive base.
11 324 Ruth It is clear the that the property of beig a-scattered has a rather strog aspect of primitivity. This must, i fact, be stroger tha primitive a-space sice we have c) above i cotrast to Theorem 1.5 where e-space appears i place of first coutable. Oe of our iterests here is to provide fuctioal characterizatios of these various scattered cocepts i view of our characterizatio of,primitive a-space ad later i view of the fuctioal characterizatio of primitive base of [Wi ]. Usig well-orderig we may i fact formulate 2 these cocepts by meas of the followig. 2.1 Defiitio. Let ( : EN) be a sequece of wellordered ope covers of a space X. For each x E X ad E N, let F(x,) be the first elemet of that cotais x. a) F is called s-primitive a if ad oly if for each x E X, there is x for all m > x E N such that {y: F(y,m) = F(x,m)} = {x} b) F is called rak 1 s-primitive a if ad oly if there is E Nsuch that for each x E X, {y: F(y,m) = F(x,m)} {x} for all m >. c) F is called azosed s-primitive a if ad oly if F is s-primitive a ad for each E N, {x: {y: F(y,) = F(x,)} = {x}} is closed. 2.2 Defiitio. A space X is scattered if ad oly if every subset A c X has a isolated poit (i.e., there is a ae A such that {a} is ope i A). It is a-scattered if it is the uio of a coutable collectio of scattered
12 TOPOLOGY PROCEEDINGS Volume subspaces; if each of these scattered subsets is closed, the space is called o-{closed ad scattered). 2.3 Theorem. A space X is scattered if ad oly if it has a sequece ( : E N> of well-ordered ope covers such that F is rak 1 s-primitive o. Proof. Suppose X is scattered ad is well-ordered. Let X be the first isolated poit of X. There is a ope o set U such that U X = {x O }. Havig chose x ad U a o a a for all a < a, let x be the first isolated poit of a X\{x : a < S} provided this is oempty. a The there is a ope set U such that U X\{x : a < a} {x }. Evetually a a a S X\{x : a < S} = ~; thus we have covered X. a Now we have a well-ordered ope cover Uof X such that for each x EX, {y: F(y,U) =F(x,U)} ={x}. Defiig =U for all E Ngives us a rak 1 s-primitive a fuctio with respect to ( : EN>. Suppose X has a rak 1 s-primitive a fuctio with respect to some sequece ( : E N> of well-ordered ope covers ad that E Nwitesses that it is rak 1. Let A c X be oempty, G E be the first elemet of which meets A, ad x E G A. The F(x,) = G. If Y E G A, the also F(y,) G. Thus x = y. Hece, x is a isolated poit of A. The proofs of the followig two theorems are similar to the proof of 2.3 ad are left to the reader.
13 326 Ruth 2.4 Theorem. A space X is a-{closed ad scattered) if ad oly if it has a sequece < : E N> of well-ordered ope covers such that F is closed s-primitive a. 2.5 Theorem. A space X is a-scattered if ad oly if it has a sequece < : E N> of well-ordered ope covers such that F is s-primitive a. From the above characterizatios, we ca ow see the precise relatioship of primitive a-spaces to those which are a-scattered. These characterizatios, however, are extrisic i that the fuctio F is defied by a sequece of well-orderigs. I order to elimiate the explicit wellorderigs we provide purely fuctioal characterizatios by applyig Wicke's cocept of a iitial fuctio foud i 2.6 Defiitio (Wicke, [Wi 2 ]).. A fuctio h: N x X ~ J is called iitial if ad oly if for j E Nad A ~ X, if A ~ ~, there exists a E A such that for all b E A, either h (j, a) = h (j,b) or b ~ h (j, a). This gives rise to the followig characterizatio of primitive base. 2.7 Theorem [Wi 2.2]. A space has a pripitive base 2, if ad oly if it has a iitial fuctio which is first coutable {i.e., for all p E X, {h(j,p): j E N} is a base at p).
14 TOPOLOGY PROCEEDINGS Volume I the same maer, we obtai characterizatios of scattered, a-(closed ad scattered), a-scattered ad primitive a. We state here oly the characterizatio of primitive a as the others will be apparet i light of Defiitio Theorem. A space X is a primitive a-space if ad oly if it has a iitial fuctio h such that h(,x) h(,x ) for all E N implies (x : EN> clusters to x. Proof. Suppose X is a primitive a-space, ad let ( U : EN> witess this. It is ot hard to show that the fuctio h defied by h(,x) = F(X,U ) is a iitial fuc tio satisfyig the coditio above. To show sufficiecy, suppose X has a iitial fuctio satisfyig the coditio above. Followig the proof of [Wi 2, Theorem 2.2], we obtai a sequece (W j : j E N> of well-ordered ope covers such that F(x,W.) = h(j,x). J Refereces [Ch ] J. Chaber, O poit-coutable collectios ad mool toic properties, Fud. Math. 94 (1977), [Ch ] 2, Primitive geerazizatios of a-spaces, Colloquia Mathematica Societatis Jaos Bolyai 23 (1978), P. Fletcher ad W. F. Lidgre, O w~-spaces, wa-spaces ad ~#-spaces, Pacific J. Math. 71 (1977), [FL ], 8-spaces, Ge. Top. Appl. 9 (1978), [He] R. W. Heath, O certai first coutabze spaces, Topology Semiar, Wiscosi 1965, Aals of Math. Studies 60 (1966),
15 328 Ruth [Ho] [Will [Wi ] 2 [WW) R. E. Hodel, Spaces defied by sequeces of ope covers which guaratee that certai sequeces have cluster poits, Duke Math. J. 39 (1972), H. H. Wicke, Usig 8-space cocepts i base of coutable order theory, Topology Proc. 3 (1978), , A fuctioal characterizatio of primitive base, Proc. Amer. Math. Soc. 72 (1978), ad J. M. Worrell, Jr., Spaces which are scattered with respect to collectios of sets, Topology Proc. 2 (1977), Shippesburg Uiversity Shippesburg, Pesylvaia 17257
Compactness of Fuzzy Sets
Compactess of uzzy Sets Amai E. Kadhm Departmet of Egieerig Programs, Uiversity College of Madeat Al-Elem, Baghdad, Iraq. Abstract The objective of this paper is to study the compactess of fuzzy sets i
More informationNew Results on Energy of Graphs of Small Order
Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order
More informationStrong Complementary Acyclic Domination of a Graph
Aals of Pure ad Applied Mathematics Vol 8, No, 04, 83-89 ISSN: 79-087X (P), 79-0888(olie) Published o 7 December 04 wwwresearchmathsciorg Aals of Strog Complemetary Acyclic Domiatio of a Graph NSaradha
More informationOn Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract
O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order
More informationA Note on Chromatic Transversal Weak Domination in Graphs
Iteratioal Joural of Mathematics Treds ad Techology Volume 17 Number 2 Ja 2015 A Note o Chromatic Trasversal Weak Domiatio i Graphs S Balamuruga 1, P Selvalakshmi 2 ad A Arivalaga 1 Assistat Professor,
More informationConvergence results for conditional expectations
Beroulli 11(4), 2005, 737 745 Covergece results for coditioal expectatios IRENE CRIMALDI 1 ad LUCA PRATELLI 2 1 Departmet of Mathematics, Uiversity of Bologa, Piazza di Porta Sa Doato 5, 40126 Bologa,
More informationInternational Journal of Pure and Applied Sciences and Technology
It J Pure App Sci Techo 6( (0 pp7-79 Iteratioa Joura of Pure ad Appied Scieces ad Techoogy ISS 9-607 Avaiabe oie at wwwijopaasati Research Paper Reatioship Amog the Compact Subspaces of Rea Lie ad their
More informationRecursive Estimation
Recursive Estimatio Raffaello D Adrea Sprig 2 Problem Set: Probability Review Last updated: February 28, 2 Notes: Notatio: Uless otherwise oted, x, y, ad z deote radom variables, f x (x) (or the short
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationINTERSECTION CORDIAL LABELING OF GRAPHS
INTERSECTION CORDIAL LABELING OF GRAPHS G Meea, K Nagaraja Departmet of Mathematics, PSR Egieerig College, Sivakasi- 66 4, Virudhuagar(Dist) Tamil Nadu, INDIA meeag9@yahoocoi Departmet of Mathematics,
More informationON A PROBLEM OF C. E. SHANNON IN GRAPH THEORY
ON A PROBLEM OF C. E. SHANNON IN GRAPH THEORY m. rosefeld1 1. Itroductio. We cosider i this paper oly fiite odirected graphs without multiple edges ad we assume that o each vertex of the graph there is
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationCounting the Number of Minimum Roman Dominating Functions of a Graph
Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationCombination Labelings Of Graphs
Applied Mathematics E-Notes, (0), - c ISSN 0-0 Available free at mirror sites of http://wwwmaththuedutw/ame/ Combiatio Labeligs Of Graphs Pak Chig Li y Received February 0 Abstract Suppose G = (V; E) is
More informationSOME ALGEBRAIC IDENTITIES IN RINGS AND RINGS WITH INVOLUTION
Palestie Joural of Mathematics Vol. 607, 38 46 Palestie Polytechic Uiversity-PPU 07 SOME ALGEBRAIC IDENTITIES IN RINGS AND RINGS WITH INVOLUTION Chirag Garg ad R. K. Sharma Commuicated by Ayma Badawi MSC
More informationCounting Regions in the Plane and More 1
Coutig Regios i the Plae ad More 1 by Zvezdelia Stakova Berkeley Math Circle Itermediate I Group September 016 1. Overarchig Problem Problem 1 Regios i a Circle. The vertices of a polygos are arraged o
More informationA RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH
J. Appl. Math. & Computig Vol. 21(2006), No. 1-2, pp. 233-238 Website: http://jamc.et A RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH YEON SOO YOON AND JU KYUNG KIM Abstract.
More informationOn (K t e)-saturated Graphs
Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationImproving Information Retrieval System Security via an Optimal Maximal Coding Scheme
Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk
More informationTHE COMPETITION NUMBERS OF JOHNSON GRAPHS
Discussioes Mathematicae Graph Theory 30 (2010 ) 449 459 THE COMPETITION NUMBERS OF JOHNSON GRAPHS Suh-Ryug Kim, Boram Park Departmet of Mathematics Educatio Seoul Natioal Uiversity, Seoul 151 742, Korea
More informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationTheory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators
Theory of Fuzzy Soft Matrix ad its Multi Criteria i Decisio Makig Based o Three Basic t-norm Operators Md. Jalilul Islam Modal 1, Dr. Tapa Kumar Roy 2 Research Scholar, Dept. of Mathematics, BESUS, Howrah-711103,
More informationThe number n of subintervals times the length h of subintervals gives length of interval (b-a).
Simulator with MadMath Kit: Riema Sums (Teacher s pages) I your kit: 1. GeoGebra file: Ready-to-use projector sized simulator: RiemaSumMM.ggb 2. RiemaSumMM.pdf (this file) ad RiemaSumMMEd.pdf (educator's
More informationON MATHIEU-BERG S INEQUALITY
ON MATHIEU-BERG S INEQUALITY BICHENG YANG DEPARTMENT OF MATHEMATICS, GUANGDONG EDUCATION COLLEGE, GUANGZHOU, GUANGDONG 533, PEOPLE S REPUBLIC OF CHINA. bcyag@pub.guagzhou.gd.c ABSTRACT. I this paper, by
More informationSome non-existence results on Leech trees
Some o-existece results o Leech trees László A.Székely Hua Wag Yog Zhag Uiversity of South Carolia This paper is dedicated to the memory of Domiique de Cae, who itroduced LAS to Leech trees.. Abstract
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More information1 Graph Sparsfication
CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider
More informationSpanning Maximal Planar Subgraphs of Random Graphs
Spaig Maximal Plaar Subgraphs of Radom Graphs 6. Bollobiis* Departmet of Mathematics, Louisiaa State Uiversity, Bato Rouge, LA 70803 A. M. Frieze? Departmet of Mathematics, Caregie-Mello Uiversity, Pittsburgh,
More informationProject 2.5 Improved Euler Implementation
Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,
More informationAlpha Individual Solutions MAΘ National Convention 2013
Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5
More informationMean cordiality of some snake graphs
Palestie Joural of Mathematics Vol. 4() (015), 49 445 Palestie Polytechic Uiversity-PPU 015 Mea cordiality of some sake graphs R. Poraj ad S. Sathish Narayaa Commuicated by Ayma Badawi MSC 010 Classificatios:
More informationPerhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where
ON MAXIMUM CHORDAL SUBGRAPH * Paul Erdos Mathematical Istitute of the Hugaria Academy of Scieces ad Reu Laskar Clemso Uiversity 1. Let G() deote a udirected graph, with vertices ad V(G) deote the vertex
More informationLecture 18. Optimization in n dimensions
Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of
More informationProtected points in ordered trees
Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationChapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationCIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)
CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationThe golden search method: Question 1
1. Golde Sectio Search for the Mode of a Fuctio The golde search method: Questio 1 Suppose the last pair of poits at which we have a fuctio evaluatio is x(), y(). The accordig to the method, If f(x())
More informationLecture 2: Spectra of Graphs
Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad
More information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More informationn n B. How many subsets of C are there of cardinality n. We are selecting elements for such a
4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset
More informationComputer Science Foundation Exam. August 12, Computer Science. Section 1A. No Calculators! KEY. Solutions and Grading Criteria.
Computer Sciece Foudatio Exam August, 005 Computer Sciece Sectio A No Calculators! Name: SSN: KEY Solutios ad Gradig Criteria Score: 50 I this sectio of the exam, there are four (4) problems. You must
More information1 Enterprise Modeler
1 Eterprise Modeler Itroductio I BaaERP, a Busiess Cotrol Model ad a Eterprise Structure Model for multi-site cofiguratios are itroduced. Eterprise Structure Model Busiess Cotrol Models Busiess Fuctio
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationRandom Graphs and Complex Networks T
Radom Graphs ad Complex Networks T-79.7003 Charalampos E. Tsourakakis Aalto Uiversity Lecture 3 7 September 013 Aoucemet Homework 1 is out, due i two weeks from ow. Exercises: Probabilistic iequalities
More informationOctahedral Graph Scaling
Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of
More informationVisualization of Gauss-Bonnet Theorem
Visualizatio of Gauss-Boet Theorem Yoichi Maeda maeda@keyaki.cc.u-tokai.ac.jp Departmet of Mathematics Tokai Uiversity Japa Abstract: The sum of exteral agles of a polygo is always costat, π. There are
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationHomework 1 Solutions MA 522 Fall 2017
Homework 1 Solutios MA 5 Fall 017 1. Cosider the searchig problem: Iput A sequece of umbers A = [a 1,..., a ] ad a value v. Output A idex i such that v = A[i] or the special value NIL if v does ot appear
More informationTakashi Tsuboi Graduate School of Mathematical Sciences, the University of Tokyo, Japan
TOPOLOGY Takashi Tsuboi Graduate School of Mathematical Scieces, the Uiversity of Tokyo, Japa Keywords: eighborhood, ope sets, metric space, covergece, cotiuity, homeomorphism, homotopy type, compactess,
More informationSome New Results on Prime Graphs
Ope Joural of Discrete Mathematics, 202, 2, 99-04 http://dxdoiorg/0426/ojdm202209 Published Olie July 202 (http://wwwscirporg/joural/ojdm) Some New Results o Prime Graphs Samir Vaidya, Udaya M Prajapati
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationGuide to Applying Online
Guide to Applyig Olie Itroductio Respodig to requests for additioal iformatio Reportig: submittig your moitorig or ed of grat Pledges: submittig your Itroductio This guide is to help charities submit their
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationModule 8-7: Pascal s Triangle and the Binomial Theorem
Module 8-7: Pascal s Triagle ad the Biomial Theorem Gregory V. Bard April 5, 017 A Note about Notatio Just to recall, all of the followig mea the same thig: ( 7 7C 4 C4 7 7C4 5 4 ad they are (all proouced
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationOn Spectral Theory Of K-n- Arithmetic Mean Idempotent Matrices On Posets
Iteratioal Joural of Sciece, Egieerig ad echology Research (IJSER), Volume 5, Issue, February 016 O Spectral heory Of -- Arithmetic Mea Idempotet Matrices O Posets 1 Dr N Elumalai, ProfRMaikada, 3 Sythiya
More informationRelationship between augmented eccentric connectivity index and some other graph invariants
Iteratioal Joural of Advaced Mathematical Scieces, () (03) 6-3 Sciece Publishig Corporatio wwwsciecepubcocom/idexphp/ijams Relatioship betwee augmeted eccetric coectivity idex ad some other graph ivariats
More informationRecursive Procedures. How can you model the relationship between consecutive terms of a sequence?
6. Recursive Procedures I Sectio 6.1, you used fuctio otatio to write a explicit formula to determie the value of ay term i a Sometimes it is easier to calculate oe term i a sequece usig the previous terms.
More informationAverage Connectivity and Average Edge-connectivity in Graphs
Average Coectivity ad Average Edge-coectivity i Graphs Jaehoo Kim, Suil O July 1, 01 Abstract Coectivity ad edge-coectivity of a graph measure the difficulty of breakig the graph apart, but they are very
More information5.3 Recursive definitions and structural induction
/8/05 5.3 Recursive defiitios ad structural iductio CSE03 Discrete Computatioal Structures Lecture 6 A recursively defied picture Recursive defiitios e sequece of powers of is give by a = for =0,,, Ca
More informationThompson s Group F (p + 1) is not Minimally Almost Convex
Thompso s Group F (p + ) is ot Miimally Almost Covex Claire Wladis Thompso s Group F (p + ). A Descriptio of F (p + ) Thompso s group F (p + ) ca be defied as the group of piecewiseliear orietatio-preservig
More information2) Give an example of a polynomial function of degree 4 with leading coefficient of -6
Math 165 Read ahead some cocepts from sectios 4.1 Read the book or the power poit presetatios for this sectio to complete pages 1 ad 2 Please, do ot complete the other pages of the hadout If you wat to
More informationMatrix Partitions of Split Graphs
Matrix Partitios of Split Graphs Tomás Feder, Pavol Hell, Ore Shklarsky Abstract arxiv:1306.1967v2 [cs.dm] 20 Ju 2013 Matrix partitio problems geeralize a umber of atural graph partitio problems, ad have
More informationThe Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationMath Section 2.2 Polynomial Functions
Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably
More informationMAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS
Fura Uiversity Electroic Joural of Udergraduate Matheatics Volue 00, 1996 6-16 MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS DAVID SITTON Abstract. How ay edges ca there be i a axiu atchig i a coplete
More informationANN WHICH COVERS MLP AND RBF
ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi
More informationENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics
ENGI 44 Probability ad Statistics Faculty of Egieerig ad Applied Sciece Problem Set Descriptive Statistics. If, i the set of values {,, 3, 4, 5, 6, 7 } a error causes the value 5 to be replaced by 50,
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to
More informationPETRI NETS GENERATING KOLAM PATTERNS
. Lalitha et al / Idia Joural of omputer Sciece ad Egieerig (IJSE) PETRI NETS GENERATING KOLAM PATTERNS. Lalitha epartmet of Mathematics Sathyabama Uiversity, heai-119, Idia lalkrish_24@yahoo.co.i K. Ragaraja
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationMathematical Stat I: solutions of homework 1
Mathematical Stat I: solutios of homework Name: Studet Id N:. Suppose we tur over cards simultaeously from two well shuffled decks of ordiary playig cards. We say we obtai a exact match o a particular
More informationWeston Anniversary Fund
Westo Olie Applicatio Guide 2018 1 This guide is desiged to help charities applyig to the Westo to use our olie applicatio form. The Westo is ope to applicatios from 5th Jauary 2018 ad closes o 30th Jue
More informationThe Platonic solids The five regular polyhedra
The Platoic solids The five regular polyhedra Ole Witt-Hase jauary 7 www.olewitthase.dk Cotets. Polygos.... Topologically cosideratios.... Euler s polyhedro theorem.... Regular ets o a sphere.... The dihedral
More informationSymmetric Class 0 subgraphs of complete graphs
DIMACS Techical Report 0-0 November 0 Symmetric Class 0 subgraphs of complete graphs Vi de Silva Departmet of Mathematics Pomoa College Claremot, CA, USA Chaig Verbec, Jr. Becer Friedma Istitute Booth
More informationOne advantage that SONAR has over any other music-sequencing product I ve worked
*gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig
More informationFuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations
Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu
More informationare two specific neighboring points, F( x, y)
$33/,&$7,212)7+(6(/)$92,',1* 5$1'20:$/.12,6(5('8&7,21$/*25,7+0,17+(&2/285,0$*(6(*0(17$7,21 %RJGDQ602/.$+HQU\N3$/86'DPLDQ%(5(6.$ 6LOHVLDQ7HFKQLFDO8QLYHUVLW\'HSDUWPHQWRI&RPSXWHU6FLHQFH $NDGHPLFND*OLZLFH32/$1'
More informationJournal of Mathematical Nanoscience. Sanskruti Index of Bridge Graph and Some Nanocones
Joural of Mathematical Naoscieese 7 2) 2017) 85 95 Joural of Mathematical Naosciece Available Olie at: http://jmathaosrttuedu Saskruti Idex of Bridge Graph ad Some Naocoes K Pattabirama * Departmet of
More informationΣ P(i) ( depth T (K i ) + 1),
EECS 3101 York Uiversity Istructor: Ady Mirzaia DYNAMIC PROGRAMMING: OPIMAL SAIC BINARY SEARCH REES his lecture ote describes a applicatio of the dyamic programmig paradigm o computig the optimal static
More informationThe Adjacency Matrix and The nth Eigenvalue
Spectral Graph Theory Lecture 3 The Adjacecy Matrix ad The th Eigevalue Daiel A. Spielma September 5, 2012 3.1 About these otes These otes are ot ecessarily a accurate represetatio of what happeed i class.
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationAlgorithms Chapter 3 Growth of Functions
Algorithms Chapter 3 Growth of Fuctios Istructor: Chig Chi Li 林清池助理教授 chigchi.li@gmail.com Departmet of Computer Sciece ad Egieerig Natioal Taiwa Ocea Uiversity Outlie Asymptotic otatio Stadard otatios
More informationA Comparative Study of Positive and Negative Factorials
A Comparative Study of Positive ad Negative Factorials A. M. Ibrahim, A. E. Ezugwu, M. Isa Departmet of Mathematics, Ahmadu Bello Uiversity, Zaria Abstract. This paper preset a comparative study of the
More informationRTG Mini-Course Perspectives in Geometry Series
RTG Mii-Course Perspectives i Geometry Series Jacob Lurie Lecture III: The Cobordism Hypothesis (1/27/2009) A quick review of ideas from previous lectures: The origial defiitio of a -dimesioal tqft provided
More informationA study on Interior Domination in Graphs
IOSR Joural of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 219-765X. Volume 12, Issue 2 Ver. VI (Mar. - Apr. 2016), PP 55-59 www.iosrjourals.org A study o Iterior Domiatio i Graphs A. Ato Kisley 1,
More informationSum-connectivity indices of trees and unicyclic graphs of fixed maximum degree
1 Sum-coectivity idices of trees ad uicyclic graphs of fixed maximum degree Zhibi Du a, Bo Zhou a *, Nead Triajstić b a Departmet of Mathematics, South Chia Normal Uiversity, uagzhou 510631, Chia email:
More informationThe Magma Database file formats
The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13
CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis
More information