Takashi Tsuboi Graduate School of Mathematical Sciences, the University of Tokyo, Japan
|
|
- Myles Bates
- 5 years ago
- Views:
Transcription
1 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, coectedess, homotopy, homotopy group, simplicial comple, homology group, cohomology group, Euler-Poicaré characteristic umber, Poicaré duality theorem, Poicaré-Hopf theorem, Morse theory, Poicaré cojecture, itersectio umbers, likig umbers, kot theory Cotets Itroductio 2 Covergece of sequeces, cotiuity of maps, geeral topology 2 Metric Spaces ad the Covergece of Sequeces 22 Abstract Topology o Sets 23 Separatio Aioms ad Coutability Aioms 24 Compactess 3 Coectedess ad homotopy theory 3 Coectedess ad Homotopy 32 Homotopy Groups 33 Homotopy Eact Sequece 4 Simplicial complees ad homology theory 4 Simplicial Complees 42 Chai Complees ad Homology Groups 43 Sigular Simplicial Comple ad Sigular Homology Groups 44 Cochai Complees ad Cohomology Groups 5 Applicatios for maifold theory 5 Poicaré Duality Theorem 52 Poicaré-Hopf Theorem 53 Morse Theory 54 Homotopy Type ad Homeomorphism Type 55 Itersectio Numbers ad Likig Numbers 56 Kot Theory Glossary Bibliography Biographical Sketch Summary Topology is a brach of mathematics which studies the shape of spaces ad the cofiguratios of a space mapped i aother space The curret theory of topology cosists of geeral topology which is the foudatio to talk about covergece i various spaces ad cotiuity of maps betwee spaces, homotopy theory ad homology theory which defie various ivariats to distiguish spaces ad cofiguratios, ad applicatios of these geeral results to the iterestig objects such as maifolds Ecyclopedia of Life Support Systems (EOLSS)
2 Itroductio Topology is a brach of mathematics which studies the shape of spaces ad the cofiguratios of a space mapped i aother space Oe of the origis of topology theory is usually attributed to Euler s argumet to deduce the impossibility to fid a route i Köigsberg passig each of 7 bridges oce ad oly oce The cofiguratio of the bridges of Köigsberg is represeted by a graph with 4 vertices ad 7 edges, the questio is the eistece of a path passig through each edge oce ad oly oce Euler looked at the umber of attached edges at each verte, ad foud that for ay coected graph with at most 2 vertices with odd umber of attached edges, it is possible to fid such a path ad otherwise it is impossible to fid such a path I the graph represetig Köigsberg, the 4 vertices have 5, 3, 3 ad 3 attached edges, respectively, ad hece it is impossible to fid the desired route Euler also foud that for a cove polyhedro, ( the umber of vertices) ( the umber of edges) + ( the umber of faces) = 2 The umber of left-had-side does ot deped o the polyhedral arragemets ad it is called the Euler-Poicaré characteristic umber This is still the most importat ivariat to distiguish the shapes of polyhedra Aother origi of topology is the study of the covergeces of sequeces ad series such as Fourier series It took rather log time to uderstad that the poitwise limit of cotiuous fuctios may ot be a cotiuous fuctio while the uiform coverget limit of cotiuous fuctios is cotiuous After the set theory was established, the topology is thought as a structure o a set ad the theory of topology gives a basis to discuss covergece as well as the cotiuous deformatios of various objects The curret theory of topology cosists of geeral topology which is the foudatio to talk about covergece i various spaces ad cotiuity of maps betwee spaces, homotopy theory ad homology theory which defie various ivariats to distiguish spaces ad cofiguratios, ad applicatios of these geeral results to the iterestig objects such as maifolds 2 Covergece of Sequeces, Cotiuity of Maps, Geeral Topology 2 Metric Spaces ad the Covergece of Sequeces First we look at the spaces where there is a otio of distace I the -dimesioal Euclidea space, the distace betwee two poits = (,, ) ad y = ( y,, y ) is give by d(, y) = y = ( ) k k y = k distace fuctio d : satisfies the followig properties ) For, y, d(, y) = d( y, ) ; 2 This Ecyclopedia of Life Support Systems (EOLSS)
3 2) For, y, d(, y) ad d(, y) = if ad oly if = y ; 3) For, y, z, d(, z) d(, y) + d( y, z) By defiitio, a metric space is a set with a real-valued fuctio d : satisfyig the precedet properties () 3) There are may iterestig eamples of metric spaces, eg, the space B( S ) of real-valued bouded fuctios o a set S is a metric space by defiig d( f, g) = sup d( f( ), g( )) for f, g B( S) S For a metric space, we ca defie the ε eighborhood of a poit ad what is the coverget sequece For a positive real umber ε, the ε (ope) eighborhood Bε ( ) of is defied by Bε ( ) = { y d( y, ) < ε} A sequece (of poits) i a metric space is a mappig from to It is usually writte as { i A sequece { i i a metric space ( i ) is said to coverge to if for ay ε >, { i i Bε ( )} is a fiite set I this case, is called the limit of the sequece ad is writte as lim i i = If a sequece { i i a metric space coverges, it coverges to a uique poit i the metric space A subset A of a metric space is said to be closed if ay sequece { i of poits i A coverges to a poit, the A A sequece { i i a metric space is called a Cauchy sequece if for ay ε >, there is a umber k such that d( i, j) < ε for i, j k A coverget sequece is a Cauchy sequece But a Cauchy sequece may ot coverge i geeral For, oe may thik of the sequece {/ } o the ope half lie { > } If all Cauchy sequeces coverge, the metric space is called complete The -dimesioal Euclidea space is complete ad a closed subset A of a complete metric space is complete with respect to the distace fuctio restricted to A A map f : Y betwee metric spaces is cotiuous if for ay ad a positive real umber ε, there eists a positive real umber δ such that f ( Bδ( )) Bε( f( )) This is equivalet to say that if a sequece { i coverges to, the the sequece { f( i)} i coverges to f ( ) A ope set U of a metric space is defied to be a set U such that if U there is a positive real umber ε satisfyig Bε ( ) U That U is ope is equivalet to that the complemet U is closed By usig the otio of ope sets, a map f : Y betwee metric spaces is cotiuous if for ay ope set U of Y, f ( U) = { f( ) U} is a ope set of 22 Abstract Topology o Sets We ca thik of the cotiuity of the maps betwee spaces which are ot metric spaces First we otice that the set O of ope sets defied i a metric space has the Ecyclopedia of Life Support Systems (EOLSS)
4 followig properties: ) O ad O ; 2) k For a fiite subset { O i } i =, k, O, O i= i O ; 3) For ay subset { O λ } λ Λ O, O λ O λ Λ Now for ay set, we defie a topology of to be the set O of subsets of satisfyig the above three properties () 3) Elemets of O are called ope sets The set with a topology is called a topological space or simply a space Usig the otio of topology, we ca defie the otio of cotiuity of a map betwee topological spaces Give the set O of ope sets of ad the set O Y of ope sets of Y, a map f : Y is cotiuous if U O Y implies f ( U) O Whe the set O of ope sets of is give, the set N of ope eighborhoods of is defied as N = { O O O} Give the sets of ope eighborhoods N of ad N Y y of y Y, f : Y is cotiuous at if for ay ope Y eighborhood V N f ( ) there is a ope eighborhood U N such that f ( U) V This abstractio is useful to uderstad various otios cocerig covergece ad the cotiuity A closed set is the complemet of a ope set Let C be the set of closed sets of For a subset S of, the closure S of S is the smallest closed set cotaiig S, that is, S = C C For a metric space, the closure of a subset S cosists of all the C, S C poits which are the limits of sequeces i S which are coverget i For ay subset A of a topological space, A has the iduced topology defied by the set of ope sets give by { O A O O } With this topology, A is called a (topological) subspace of The iclusio map of ay subspace A to is a cotiuous map For two topological spaces ad Y, the direct product Y which is the set of the ordered pairs (, y) where ad y Y is a topological space The ope sets are the subsets of Y which is writte as a uio Uλ V λ Λ λ of direct products of ope sets U λ O ad V λ O Y ( λ Λ ) A map h: Y betwee topological spaces is called a homeomorphism if h is a bijectio ad h: Y ad its iverse map h : Y are cotiuous If there is a homeomorphism h: Y, ad Y are said to be homeomorphic For eample, the ope ball { d(, ) < } i the -dimesioal Euclidea space is homeomorphic to the -dimesioal Euclidea space Ecyclopedia of Life Support Systems (EOLSS)
5 The pricipal problem i topology theory is to determie whether two topological spaces are homeomorphic or ot To show that they are homeomorphic it is ecessary to show the way to costruct a homeomorphism betwee them To show that they are ot homeomorphic it is ecessary to defie a ivariat which has the same value if they are homeomorphic ad to show that the values of the ivariat are differet for the two spaces Homotopy groups ad homology groups eplaied later are topological ivariats ad used to show that two topological spaces are differet 23 Separatio Aioms ad Coutability Aioms The topological spaces usually treated have several ice properties which the metric spaces satisfy Such properties are also formulated i a abstract way A topological space is called a Hausdorff space, if for ay two poits ad y of, there are ope sets U ad V such that U, y V ad U V = Metric spaces are Hausdorff spaces I a Hausdorff space oe-poit set { } is a closed set as is the case i metric spaces A Hausdorff space is called a ormal space, if for ay two disjoit closed subsets C ad C of, there are ope sets U ad U such that C U, C U ad U U = I a ormal space, for ay two disjoit closed subsets C ad C of, there is a cotiuous fuctio f : [, ] such that C f = () ad C = f () This statemet is called Urysoh s Lemma Thus for a ormal space, there are a lot of real-valued cotiuous fuctios o ad oe ca distiguish closed sets by them A subset B of the set N of ope eighborhoods of is called a base of N if for ay elemet U of N there is V B such that V U If there is a coutable base B of N at every poit, the topological space is said to satisfy the first aiom of coutability If is a metric space, the topology of satisfies the first aiom of coutability A subset B of O is a base of O if ay elemet U of O is writte as U = V V B, V U If there is a coutable base B of O, is said to satisfy the secod aiom of coutability If satisfies the secod aiom of coutability, the it of course satisfies the first aiom of coutability For the direct product Y of topological spaces ad Y, { U V U O, V O Y} is the base of O Y If ad Y satisfy the secod aiom of coutability, the Y satisfies it The -dimesioal Euclidea space is a metric space, hece it satisfies the first aiom of coutability also satisfies the secod aiom of coutability It is easy to see that ay subspace of with the iduced metric satisfies both aioms of coutability Ecyclopedia of Life Support Systems (EOLSS)
6 - - - TO ACCESS ALL THE 2 PAGES OF THIS CHAPTER, Visit: Bibliography Ryszard Egelkig, (989) Geeral topology, Secod editio, Sigma Series i Pure Mathematics, 6 Helderma Verlag, Berli, viii+529 pp ISBN: [This is a reasoably complete epositio of geeral topology] Ryszard Egelkig ad Karol Sieklucki, (992) Topology: a geometric approach, Sigma Series i Pure Mathematics, 4 Helderma Verlag, Berli, +429 pp ISBN: [This is a itroductio to geeral topology as well as to geometric topology] James R Mukres, (984) Elemets of algebraic topology Addiso-Wesley Publishig Compay, Melo Park, CA, i+454 pp ISBN: [This is a tet book o the homology ad cohomology theory] William Fulto, (995) Algebraic Topology: A First Course (Graduate Tets i Mathematics, Vol 53) Spriger, ISBN [This book begis with elemetary itroductio of homotopy theory ad homology ad cohomology theory ad treats several importat applicatios] William S Massey, (99) A basic course i algebraic topology (Graduate Tets i Mathematics, Vol 27) Spriger-Verlag, New York, vi+428 pp ISBN: [This is a tet book o the homology ad cohomology theory] Joh Milor, (965) Lectures o the h-cobordism theorem (with L Siebema ad J Sodow), Priceto U Press [This book eplais how oe ca use the Morse theory to ivestigate the topology of maifolds] S Smale, (96) Geeralized Poicaré s cojecture i dimesios greater tha four, Aals of Mathematics vol [This paper gives the proof of the Poicaré cojecture for the spheres of dimesio greater tha 4] M H Freedma, (982) The topology of four-dimesioal maifolds, Joural of Differetial Geometry vol 7, [This paper gives the proof of the Poicaré cojecture for the sphere of dimesio 4] Joh W Morga, (25) Recet progress o the Poicaré cojecture ad the classificatio of 3- maifolds, Bulleti (New Series) of the America Mathematical Society Volume 42, Number, Pages [This is a epository paper o the proof by Perelma of the Poicaré cojecture for the sphere of dimesio 3] W B Raymod Lickorish, (997) Itroductio to kot theory, (Graduate Tets i Mathematics, Vol 75) Spriger-Verlag, New York, +2 pp ISBN [This book eplais a umber of ivariats for kots ad liks kow before the begiig of 99 s] William Measco ad Morwe Thistlethwaite (Editors), (25) Hadbook of kot theory, Elsevier BV, Amsterdam, +492 pp ISBN [This book cotais the progress i kot theory made at the begiig of 2st cetury] Biographical Sketch Takashi Tsuboi, bor 953 i Hiroshima, Japa Educatio: Ecyclopedia of Life Support Systems (EOLSS)
7 BS i Mathematics, the Uiversity of Tokyo, Japa (March, 976) MS i Mathematics, the Uiversity of Tokyo, Japa (March, 978) PhD i Mathematics, the Uiversity of Tokyo, Japa (February, 983) Positios held: Assistat, Departmet of Mathematics, the Uiversity of Tokyo, Japa (April, 978--March, 985) Assistat Professor, Departmet of Mathematics, the Uiversity of Tokyo, Japa (April, September, 993) Professor, Graduate School of Mathematical Scieces, the Uiversity of Tokyo, Japa (October, 993 to date) Ecyclopedia of Life Support Systems (EOLSS)
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 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 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 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 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 informationTHE STABLE PARAMETRIZED h-cobordism THEOREM. John Rognes. October 18th October 26th 1999
THE STABLE PARAMETRIZED h-cobordism THEOREM Joh Roges October 18th October 26th 1999 These are the author s otes for lectures o the paper: Spaces of PL maifolds ad categories of simple maps (the maifold
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 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 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 informationNTH, GEOMETRIC, AND TELESCOPING TEST
NTH, GEOMETRIC, AND TELESCOPING TEST Sectio 9. Calculus BC AP/Dual, Revised 08 viet.dag@humbleisd.et /4/08 0:0 PM 9.: th, Geometric, ad Telescopig Test SUMMARY OF TESTS FOR SERIES Lookig at the first few
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 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 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 informationCUTTING AND PASTING LIBERT E, EGALIT E, HOMOLOGIE! 1
CUTTING AND PASTING LIBERTÉ, EGALITÉ, HOMOLOGIE! 1 1. Heegaard splittigs Makig 3-maifolds from solid hadlebodies 2. Surface homeomorphisms Gluig maifolds together alog their boudaries 3. Surgery Cuttig
More informationImproved Random Graph Isomorphism
Improved Radom Graph Isomorphism Tomek Czajka Gopal Paduraga Abstract Caoical labelig of a graph cosists of assigig a uique label to each vertex such that the labels are ivariat uder isomorphism. Such
More informationc-dominating Sets for Families of Graphs
c-domiatig Sets for Families of Graphs Kelsie Syder Mathematics Uiversity of Mary Washigto April 6, 011 1 Abstract The topic of domiatio i graphs has a rich history, begiig with chess ethusiasts i 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 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 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 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 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 informationAssignment 5; Due Friday, February 10
Assigmet 5; Due Friday, February 10 17.9b The set X is just two circles joied at a poit, ad the set X is a grid i the plae, without the iteriors of the small squares. The picture below shows that the iteriors
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 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 informationarxiv: v2 [cs.ds] 24 Mar 2018
Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves
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 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 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 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 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 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 informationarxiv: v1 [math.co] 22 Dec 2015
The flag upper boud theorem for 3- ad 5-maifolds arxiv:1512.06958v1 [math.co] 22 Dec 2015 Hailu Zheg Departmet of Mathematics Uiversity of Washigto Seattle, WA 98195-4350, USA hailuz@math.washigto.edu
More informationOn Characteristic Polynomial of Directed Divisor Graphs
Iter. J. Fuzzy Mathematical Archive Vol. 4, No., 04, 47-5 ISSN: 30 34 (P), 30 350 (olie) Published o April 04 www.researchmathsci.org Iteratioal Joural of V. Maimozhi a ad V. Kaladevi b a Departmet of
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 informationComputational Geometry
Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed
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 informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
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 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 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 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 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 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 informationUSING TOPOLOGICAL METHODS TO FORCE MAXIMAL COMPLETE BIPARTITE SUBGRAPHS OF KNESER GRAPHS
USING TOPOLOGICAL METHODS TO FORCE MAXIMAL COMPLETE BIPARTITE SUBGRAPHS OF KNESER GRAPHS GWEN SPENCER AND FRANCIS EDWARD SU 1. Itroductio Sata likes to ru a lea ad efficiet toy-makig operatio. He also
More informationCOSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1
COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,
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 informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
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 informationAsymptotics of Pattern Avoidance in the Klazar Set Partition and Permutation-Tuple Settings Permutation Patterns 2017 Abstract
Asymptotics of Patter Avoiace i the Klazar Set Partitio a Permutatio-Tuple Settigs Permutatio Patters 2017 Abstract Bejami Guby Departmet of Mathematics Harvar Uiversity Cambrige, Massachusetts, U.S.A.
More informationRelational Interpretations of Neighborhood Operators and Rough Set Approximation Operators
Relatioal Iterpretatios of Neighborhood Operators ad Rough Set Approximatio Operators Y.Y. Yao Departmet of Computer Sciece, Lakehead Uiversity, Thuder Bay, Otario, Caada P7B 5E1, E-mail: yyao@flash.lakeheadu.ca
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 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 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 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 informationApplication of Plantri Graph:All Combinatorial Structure of Orderable And Deformable Compact Coxeter Hyperbolic Polyhedra
IOSR Joural of Mathematics (IOSR-JM) e-issn: 78-578,p-ISSN: 319-765X, Volume 7, Issue 6 (Sep. - Oct. 013), PP 01-10 Applicatio of Platri Graph:All Combiatorial Structure of Orderable Ad Deformable Compact
More informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationPLEASURE TEST SERIES (XI) - 04 By O.P. Gupta (For stuffs on Math, click at theopgupta.com)
wwwtheopguptacom wwwimathematiciacom For all the Math-Gya Buy books by OP Gupta A Compilatio By : OP Gupta (WhatsApp @ +9-9650 350 0) For more stuffs o Maths, please visit : wwwtheopguptacom Time Allowed
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 informationParabolic Path to a Best Best-Fit Line:
Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be
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 informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationCh 9.3 Geometric Sequences and Series Lessons
Ch 9.3 Geometric Sequeces ad Series Lessos SKILLS OBJECTIVES Recogize a geometric sequece. Fid the geeral, th term of a geometric sequece. Evaluate a fiite geometric series. Evaluate a ifiite geometric
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 informationSD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.
SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that
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 informationSome cycle and path related strongly -graphs
Some cycle ad path related strogly -graphs I. I. Jadav, G. V. Ghodasara Research Scholar, R. K. Uiversity, Rajkot, Idia. H. & H. B. Kotak Istitute of Sciece,Rajkot, Idia. jadaviram@gmail.com gaurag ejoy@yahoo.co.i
More informationEVALUATION OF TRIGONOMETRIC FUNCTIONS
EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special
More informationChapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig
More informationConvex hull ( 凸殻 ) property
Covex hull ( 凸殻 ) property The covex hull of a set of poits S i dimesios is the itersectio of all covex sets cotaiig S. For N poits P,..., P N, the covex hull C is the give by the expressio The covex hull
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 informationSolving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
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 informationBaan Tools User Management
Baa Tools User Maagemet Module Procedure UP008A US Documetiformatio Documet Documet code : UP008A US Documet group : User Documetatio Documet title : User Maagemet Applicatio/Package : Baa Tools Editio
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 informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
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 informationCOMP 558 lecture 6 Sept. 27, 2010
Radiometry We have discussed how light travels i straight lies through space. We would like to be able to talk about how bright differet light rays are. Imagie a thi cylidrical tube ad cosider the amout
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 informationReversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits
Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig
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 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 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 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 informationMathematics and Art Activity - Basic Plane Tessellation with GeoGebra
1 Mathematics ad Art Activity - Basic Plae Tessellatio with GeoGebra Worksheet: Explorig Regular Edge-Edge Tessellatios of the Cartesia Plae ad the Mathematics behid it. Goal: To eable Maths educators
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationOrientation. Orientation 10/28/15
Orietatio Orietatio We will defie orietatio to mea a object s istataeous rotatioal cofiguratio Thik of it as the rotatioal equivalet of positio 1 Represetig Positios Cartesia coordiates (x,y,z) are a easy
More informationA New Bit Wise Technique for 3-Partitioning Algorithm
Special Issue of Iteratioal Joural of Computer Applicatios (0975 8887) o Optimizatio ad O-chip Commuicatio, No.1. Feb.2012, ww.ijcaolie.org A New Bit Wise Techique for 3-Partitioig Algorithm Rajumar Jai
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 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 informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
More information9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4
1 3.6 I. Combiig Fuctios A. From Equatios Example: Let f(x) = 9 x ad g(x) = 4 f x. Fid (x) g ad its domai. 4 Example: Let f(x) = ad g(x) = x x 4. Fid (f-g)(x) B. From Graphs: Graphical Additio. Example:
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 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 informationAccuracy Improvement in Camera Calibration
Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z
More informationFundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le
Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical
More informationMATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)
MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give
More informationMINIMUM CROSSINGS IN JOIN OF GRAPHS WITH PATHS AND CYCLES
3 Acta Electrotechica et Iformatica, Vol. 1, No. 3, 01, 3 37, DOI: 10.478/v10198-01-008-0 MINIMUM CROSSINGS IN JOIN OF GRAPHS WITH PATHS AND CYCLES Mariá KLEŠČ, Matúš VALO Departmet of Mathematics ad Theoretical
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 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 information