Assignment 5; Due Friday, February 10
|
|
- Whitney Perry
- 5 years ago
- Views:
Transcription
1 Assigmet 5; Due Friday, February b 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 of the circles are evely covered, ad that the juctio where the circles meet is evely covered. This eds the argumet. Let me put this exercise i cotext by tellig you a few thigs we ll prove later. Let X be a coverig space of X. The the map π : X X iduces a map π : π( X) π(x) It is ot difficult to show that this map is oe-to-oe, so we ca thik of π( X) as a subgroup of π(x). We are goig to prove that this sets up a oe-to-oe correspodece betwee subgroups of π(x) ad coverig spaces of X. The full group correspods to the trivial cover π = id : X X ad the trivial group correspods to the uique simply-coected coverig space. We will prove that the deck trasformatio group Γ of a coverig π : ( (X), x 0 ) (X, x 0 ) is trasitive o π 1 (x 0 ) if ad oly if π( X) is a ormal subgroup of π(x). I this case, we will 1
2 prove that Γ is isomorphic to the quotiet group. For example, id : X X correspods to the full group π(x) ad the quotiet group is {1}; ideed the oly deck trasformatio of X is the idetity map. Similarly, the uiversal cover correspods to the idetity subgroup, ad the quotiet is the full group π(x), which is isomorphic to the deck trasformatio group. The fudametal group of a joi of two circles is the free group o two geerators F (a, b). I claim that the fudametal group of the above grid is the group geerated by all commutators g 1 g 2 g1 1 g 1 2, ad the quotiet group is thus the free abelia group geerated by a ad b. This abeliaized group is just Z Z. Sure eough, the group of deck trasformatios is clearly Z Z because a deck trasformatio of the grid is just a traslatio (x, y) (x + m, y + ). 17.9c These problems probably are t fair because they assume some kowledge of complex aalysis. But heck, all of mathematics is itercoected. The map z is much easier to uderstad i polar coordiates. It is ( (r cos θ, r si θ) = r(cos θ + i si θ) = re iθ re iθ) = r e iθ = (r cos θ, r si θ) This map does some stretchig ad shrikig i the radial directio, which is t very importat because r : R + R + is a homeomorphism. I the agular directio it wids aroud times. Thus the map defies a -fold coverig space. I the picture below, the iverse image of U = C {egative x-axis} is covered by ope wedges. The map si(z) : C C is ot a coverig map. The easiest way to see this is to otice that the derivative of the map is cos(z), ad this derivative has a zero at, for istace π 2. So si(z) could ot be a local homeomorphism ear π 2. Oce we otice this, we ca give a easy argumet idepedet of complex aalysis. Notice that si( π 2 ) = 1 ad si( π 2 t) = si( π 2 + t). So there could ot be a ope eighborhood of π 2 carried homeomorphically to a ope eighborhood of C by si(z). The derivative of (1 z) m z is m(1 z) m 1 z + (1 z) m z 1, which equals ( ) ( ) mz + (1 z) (1 z) m 1 z 1 = (m + )z (1 z) m 1 z 1 2
3 This expressio is zero if z = 0 or z = 1 or z = m+. The poits z = 0 ad z = 1 have bee omitted to form U, but m+ belogs to U uless m+ = 0 or m+ = or m+ = 1, that is, = 0 or m = or m = 0. By complex aalysis, a map is ot a local homeomorphism ear a spot where( its derivative ) is zero. So our map caot be a coverig map uless it is (1 z) or z or z 1 z. But z does t map U to C {1} uless = ±1 because it maps all th roots of uity to 1. Similar argumets show that our map is a coverig map if ad oly if it is oe of z, 1 z, 1 z, 1 1 z, z 1 z 1 z, or z. 17.9ef Notice that the map a seds (x, y) to (x, y + 1). The map b seds (x, y) to (x + 1, y + 1). 2 To show that ba = a 1 b it suffices to show that aba = b. But ba(x, y) = b(x, y + 1) = (x+ 1 2, (y+1)+1) = (x+ 1 2, y) ad therefore aba(x, y) = a(x+ 1 2, y) = (x+ 1 2, y+1) = b(x, y). It follows that wheever we fid b followed by a, we ca replace this with a 1 followed by b. So we ca get a equivalece expressio with all a s o the left ad all b s o the right: a k b l. Moreover, l is either eve or odd, as the book says i a peculiar way. I tryig to come to grips with this problem, let us figure out where (x, y)) is mapped by the various group elemets. The map a k maps (x, y) to (x + k, y). The map b maps (x, y) to (x + 1 2, y + 1) ad b2 maps it to (x + 1, ( y + 1) + 1) = (x + 1, y). So if we restrict ourselves to products of a ad b 2, we exactly get trasformatios of the iteger lattice, ad cosequetly every poit is equivalet to a poit i the uit rectagle with corers (0, 0), (0, 1), (1, 1), (1, 0). We still must come to grips with the actio of b. It maps poits o the left half of some rectagle to poits o the right half of some other rectagle. Cosequetly (x, y) is mapped to (x + 1 2, y + 1). Let us restrict to the previous uit rectagle. Here are pictures of some equivaleces iduced by the map b: 3
4 It ow follows that every poit i the plae is equivalet to a poit i the shaded rectagle below, ad poits o the boudary are equivalet as idicated. Clearly the set of equivalece classes is the Klei bottle. 17.9h We will fid a oe-to-oe correspodece betwee p 1 (x) ad p 1 (y) where x ad y are ay two poits i X. Let γ be a path from x to y i X. If q π 1 (x), there is a uique lift of γ to a path γ i X startig at q. This path eds at a elemet of p 1 (y); call this elemet ψ(q). We claim ψ : p 1 (x) p 1 (y) is oe-to-oe ad oto. It is oe-to-oe, for if ψ(q 1 ) = ψ(q 2 ), the there would be lifts γ 1 ad γ 2 of γ startig at q 1 ad q 2 respectively ad edig at the same poit. But the γ γ 1 could be lifted i two differet ways, as γ 1 γ 1 1 ad as γ 1 γ 2 1, cotradictig uiqueess of lifts. It is oto, for if q 1 p 1 (y), lift γ 1 to a path i X startig at q 1. This lift eds at a poit q p 1 (x); clearly ψ(q) = q 1 because we ca lift γ by tracig our lift of γ 1 backward. 4
5 17.9i This was doe i class. See the picture below. 17.9j Recall that RP 2 ca be obtaied from S 2 by glueig opposite poits together. I this solutio, whe p S 2 the p is this opposite poit. Let γ : (I, 0) (RP 2, x 0 ) be a parameterizatio of the simple closed curve i RP 2. Let x 1 ad x 2 = x 1 be the two poits i S 2 which project to x 0. Let γ 1 be the lift of γ to a path i S 2 startig at x 1. Notice that γ 2 = γ 1 is the the lift of γ to a path startig at x 2. The iverse image of γ is clearly the uio of the images of γ 1 ad γ 2. It may happe that γ 1 (1) = γ 1 (0). I that case γ 1 ad γ 2 are both closed curves, ad they are easily proved disjoit simple closed curves. The other possibility is that γ 1 (1) = γ 1 (0) = γ 2 (0). I that case γ 1 γ 2 is a simply closed curve ad so the iverse image is oe curve rather tha two. 17.9l This was essetially doe i class. The space RP is obtaied from S by glueig opposite poits together, so π : S RP is a two-fold cover. Sice S is simply coected, the map π(rp, x 0 ) π 1 (x 0 ) is oe-to-oe ad oto. This image set has two elemets, so π(rp, x 0 ) = Z q By defiitio, X is locally path-coected if wheever x is a poit ad U is a ope eighborhood of x, there is a ope V such that x V U ad V is path coected. Suppose X X is a coverig space ad let x X. Choose a evely covered ope eighborhood V X of π(x). The π 1 (V) = V α. Also x is i oe of these ope sets; say x V β. Now suppose U is a ope eighborhood of x i X. Replace V β by V β U ad replace V by π(v β U). This ew V is evely covered, ad this time π 1 (V) = V α ad x V β U. But X is locally arcwise coected, so we ca fid a arcwise coected ope set W 5
6 such that π(x) W V ad the, sice π : V β V is a homeomorphism, there is a correspodig arcwise coected ope set x W V β U. 17.9r This is almost trivial. If d 1 ad d 2 are coverig trasformatios (called deck trasformatios i class), the d 1, d 2 : X X are homeomorphisms makig a diagram commute. So d 1 d 2 is also a homeomorphism. Clearly the diagram still commutes for this compositio. Similarly d 1 1 is a homeomorphism, ad the diagram commutes for this homeomorphism. 20.7a If such a map existed, the it would iduce a cotiuous map ϕ : S /±1 S 1 /±1, where ±1 symbolizes the equivalece relatio which glues opposite poits together. Notice that S / ± 1 = RP ad S 1 / ± 1 = S 1. Thus we obtai a map ϕ : RP S 1. There would be a iduced map ϕ : Z 2 = π(rp ) π(s 1 ) = Z. All such group homomorphisms are trivial, so the ozero elemet of π(rp ) would have to map to the trivial elemet of π(s 1 ). But S 1 S 1 by z z 2 is a coverig map. which wraps the circle twice aroud itself. Cosider the diagram below. I this diagram, let the map I RP represet the ozero elemet of π(rp ). The correspodig lift I S must the be a path which starts at x 0 ad eds at x 0. So the compositio of this map with ϕ must be a path i S 1 which starts at ỹ 0 ad eds at ỹ 0. Whe this elemet is projected dow by z z 2, it becomes a closed path i S 1 ad this closed path is homotopic to the idetity because π(rp ) π(s 1 ) is the zero map. Our liftig theory the implies that the uique lift of this map back up to where it came from as a map I S 1 must be a closed loop. This cotradictio proves the exercise. 20.7b First a word about the meaig of the exercise. The sphere S 3 ca be thought of as the set of all poits i C 2 = R 4 with absolute value oe, ad thus as the set of all (z 1, z 2 ) with z z 2 2 = 1. The group Z p the acts o this space by actig o each compoet separately, where Z p acts o C as the group of rotatios of a regular p-sided polygo. Similarly Z p acts o S 1 R 2, agai as the group of rotatios of a regular p-sided polygo. 6
7 We ow wat a cotiuous map S 3 S 1. But we do t wat just ay map; we wat our map to commute with the actio of Z p. That meas that if (z 1, z 2 ) maps to a poit p S 1, ad if we the rotate z 1 ad z 2 by k polygoal clicks, the the image p should also rotate by k polygoal clicks. A special case is whe p = 2, so rotatio by oe click takes (z 1, z 2 ) to ( z 1, z 2 ) ad takes p to p. I this case there is o such map by the previous exercise. Now we are goig to prove that i geeral there is o such map. If there were such a map, the it would iduce a map S 3 / S 1 / where deotes the equivalece relatio iduced by Z p i which (z 1, z 2 ) is glued to the poit (w 1, w 2 ) obtaied by rotatig z 1 ad z 2 simultaeously by k clicks. We would get a diagram exactly as before, ad the argumet is goig to proceed exactly as it did earlier. Here is the key step. Cosider a map γ : I S 3 defiig a path which starts at x 0 ad eds at x 1 where both complex coordiates of x 1 are obtaied from the correspodig complex coordiates of x 0 by rotatig by 2π. This path iduces a loop i S3 / ad the correspodig elemet of π(s 3 / ) is ot the idetity elemet because its lift does ot begi ad ed at the same poit. This elemet has order i π(s 3 / ) because whe we lift the elemet repeated times, we get a loop i S 3 ad all loops i S 3 are homotopic to costat maps. The elemet i π(s 3 / ) must map to zero i π(s 1 ) because the latter group is isomorphic to Z ad has o ozero elemets of fiite order. O the other had, the map I S 3 S 1 obtaied by followig the top of the diagram is ot a loop, because by equivariace its ed poit is obtaied from its begiig by a rotatio of 2π. This cotradictio proves the exercise. 7
The 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 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 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 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 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 informationName of the Student: Unit I (Logic and Proofs) 1) Truth Table: Conjunction Disjunction Conditional Biconditional
SUBJECT NAME : Discrete Mathematics SUBJECT CODE : MA 2265 MATERIAL NAME : Formula Material MATERIAL CODE : JM08ADM009 (Sca the above QR code for the direct dowload of this material) Name of the Studet:
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 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 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 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 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 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 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 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 informationForce Network Analysis using Complementary Energy
orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,
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 informationIntermediate Statistics
Gait Learig Guides Itermediate Statistics Data processig & display, Cetral tedecy Author: Raghu M.D. STATISTICS DATA PROCESSING AND DISPLAY Statistics is the study of data or umerical facts of differet
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 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 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 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 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 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 information27 Refraction, Dispersion, Internal Reflection
Chapter 7 Refractio, Dispersio, Iteral Reflectio 7 Refractio, Dispersio, Iteral Reflectio Whe we talked about thi film iterferece, we said that whe light ecouters a smooth iterface betwee two trasparet
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 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 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 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 informationNormals. In OpenGL the normal vector is part of the state Set by glnormal*()
Ray Tracig 1 Normals OpeG the ormal vector is part of the state Set by glnormal*() -glnormal3f(x, y, z); -glnormal3fv(p); Usually we wat to set the ormal to have uit legth so cosie calculatios are correct
More informationTask scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation
6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08
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 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 informationIntroduction to Sigma Notation
Itroductio to Siga Notatio Steph de Silva //207 What is siga otatio? is the capital Greek letter for the soud s I this case, it s just shorthad for su Siga otatio is what we use whe we have a series of
More informationCS Polygon Scan Conversion. Slide 1
CS 112 - Polygo Sca Coversio Slide 1 Polygo Classificatio Covex All iterior agles are less tha 180 degrees Cocave Iterior agles ca be greater tha 180 degrees Degeerate polygos If all vertices are colliear
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 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 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 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 informationApparent Depth. B' l'
REFRACTION by PLANE SURFACES Apparet Depth Suppose we have a object B i a medium of idex which is viewed from a medium of idex '. If '
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 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 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 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 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 informationINSCRIBED CIRCLE OF GENERAL SEMI-REGULAR POLYGON AND SOME OF ITS FEATURES
INTERNATIONAL JOURNAL OF GEOMETRY Vol. 2 (2013), No. 1, 5-22 INSCRIBED CIRCLE OF GENERAL SEMI-REGULAR POLYGON AND SOME OF ITS FEATURES NENAD U. STOJANOVIĆ Abstract. If above each side of a regular polygo
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 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 informationExamples and Applications of Binary Search
Toy Gog ITEE Uiersity of Queeslad I the secod lecture last week we studied the biary search algorithm that soles the problem of determiig if a particular alue appears i a sorted list of iteger or ot. We
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 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 informationLearning to Shoot a Goal Lecture 8: Learning Models and Skills
Learig to Shoot a Goal Lecture 8: Learig Models ad Skills How do we acquire skill at shootig goals? CS 344R/393R: Robotics Bejami Kuipers Learig to Shoot a Goal The robot eeds to shoot the ball i the goal.
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 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 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 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 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 informationLecture 7 7 Refraction and Snell s Law Reading Assignment: Read Kipnis Chapter 4 Refraction of Light, Section III, IV
Lecture 7 7 Refractio ad Sell s Law Readig Assigmet: Read Kipis Chapter 4 Refractio of Light, Sectio III, IV 7. History I Eglish-speakig coutries, the law of refractio is kow as Sell s Law, after the Dutch
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION
I terat. J. Mh. & Math. Sci. Vol. (1978) 125-132 125 ON THE DEFINITION OF A CLOSE-TO-CONVEX FUNCTION A. W. GOODMAN ad E. B. SAFF* Mathematics Dept, Uiversity of South Florida Tampa, Florida 33620 Dedicated
More informationXiaozhou (Steve) Li, Atri Rudra, Ram Swaminathan. HP Laboratories HPL Keyword(s): graph coloring; hardness of approximation
Flexible Colorig Xiaozhou (Steve) Li, Atri Rudra, Ram Swamiatha HP Laboratories HPL-2010-177 Keyword(s): graph colorig; hardess of approximatio Abstract: Motivated b y reliability cosideratios i data deduplicatio
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 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 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 informationParametric curves. Reading. Parametric polynomial curves. Mathematical curve representation. Brian Curless CSE 457 Spring 2015
Readig Required: Agel 0.-0.3, 0.5., 0.6-0.7, 0.9 Parametric curves Bria Curless CSE 457 Sprig 05 Optioal Bartels, Beatty, ad Barsy. A Itroductio to Splies for use i Computer Graphics ad Geometric Modelig,
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 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 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 information15-859E: Advanced Algorithms CMU, Spring 2015 Lecture #2: Randomized MST and MST Verification January 14, 2015
15-859E: Advaced Algorithms CMU, Sprig 2015 Lecture #2: Radomized MST ad MST Verificatio Jauary 14, 2015 Lecturer: Aupam Gupta Scribe: Yu Zhao 1 Prelimiaries I this lecture we are talkig about two cotets:
More informationSorting in Linear Time. Data Structures and Algorithms Andrei Bulatov
Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio
More informationSection 7.2: Direction Fields and Euler s Methods
Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will
More informationPlanar graphs. Definition. A graph is planar if it can be drawn on the plane in such a way that no two edges cross each other.
Plaar graphs Defiitio. A graph is plaar if it ca be draw o the plae i such a way that o two edges cross each other. Example: Face 1 Face 2 Exercise: Which of the followig graphs are plaar? K, P, C, K,m,
More informationCompactness 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 informationReading. Parametric curves. Mathematical curve representation. Curves before computers. Required: Angel , , , 11.9.
Readig Required: Agel.-.3,.5.,.6-.7,.9. Optioal Parametric curves Bartels, Beatty, ad Barsky. A Itroductio to Splies for use i Computer Graphics ad Geometric Modelig, 987. Fari. Curves ad Surfaces for
More informationPolynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0
Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity
More information( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb
Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most
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 informationComputers and Scientific Thinking
Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput
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 informationUNIT 1 RECURRENCE RELATIONS
UNIT RECURRENCE RELATIONS Structure Page No.. Itroductio 7. Objectives 7. Three Recurret Problems 8.3 More Recurreces.4 Defiitios 4.5 Divide ad Coquer 7.6 Summary 9.7 Solutios/Aswers. INTRODUCTION I the
More informationCSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)
CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a
More informationLecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein
068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig
More information3. b. Present a combinatorial argument that for all positive integers n : : 2 n
. b. Preset a combiatorial argumet that for all positive itegers : : Cosider two distict sets A ad B each of size. Sice they are distict, the cardiality of A B is. The umber of ways of choosig a pair of
More informationPacific Journal of Mathematics
Pacific Joural of Mathematics SMLL HYPEROLI POLYHER SHWN RFLSKI Volume 55 No. 1 Jauary 01 PIFI JOURNL OF MTHEMTIS Vol. 55, No. 1, 01 SMLL HYPEROLI POLYHER SHWN RFLSKI We classify the -dimesioal hyperbolic
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 informationLU Decomposition Method
SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio
More informationSolution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions:
CS 604 Data Structures Midterm Sprig, 00 VIRG INIA POLYTECHNIC INSTITUTE AND STATE U T PROSI M UNI VERSI TY Istructios: Prit your ame i the space provided below. This examiatio is closed book ad closed
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 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 informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
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 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 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 informationFast Fourier Transform (FFT) Algorithms
Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform
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 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 informationCSE 417: Algorithms and Computational Complexity
Time CSE 47: Algorithms ad Computatioal Readig assigmet Read Chapter of The ALGORITHM Desig Maual Aalysis & Sortig Autum 00 Paul Beame aalysis Problem size Worst-case complexity: max # steps algorithm
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 informationLecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions
U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets
More informationDesigning a learning system
CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try
More information