EMILY RIEHL. X. This data is subject to the following axiom: to any pair X f Y g Z there must be some specified composite map = Z
|
|
- Lee Cameron
- 5 years ago
- Views:
Transcription
1 THE ALGEBRA AND GEOMETRY OF -CATEGORIES EMILY RIEHL Abstract. -cateories are a sopisticated tool or te study o matematical structures wit ier omotopical inormation. Tis note, directed at te Friends o Harvard Matematics, introduces tis notion rom irst principles.. Te pilosopy o cateory teory Te undamental pilosopy o cateory teory is tat anytin one would want to know about a matematical object is determined by te maps (a.k.a. unctions or transormations, sometimes simply arrows ) to or rom it. For instance, unctions rom a sinleton set to a set classiy its elements; unctions rom to te set {, } identiy subsets. Linear maps rom R to a real vector space V correspond bijectively to its vectors. More reined analysis can be used to decode te entire vector space structure. Continuous unctions rom te sinleton space to a topoloical space T identiy its points. Maps rom T to te Sierpinski space classiy open sets. And so ort. Matematical objects o a ixed type assemble into a cateory. A cateory consists o objects, Y, Z,... and maps Y, Y Z,... includin speciied identities. Tis data is subject to te ollowin axiom: to any pair Y Z tere must be some speciied composite map 6666 Y Z and urtermore tis composition law must be bot associative and unital. Te irst o tese conditions says tat a sinle arrow is te speciied composite () and () wenever tese compositions are deined. Te latter says tat composition wit an identity as no eect. ()() 6666 Y Y Y 5555 Y For instance, tere is a cateory o sets and unctions; o vector spaces and linear transormations; and o topoloical spaces and continuous maps, to name just a ew. One mit say tat te objects o a cateory are te nouns and te maps te verbs in te lanuae appropriate to te matematical teory o Date: May 8, 22.
2 2 EMILY RIEHL interest [Maz7]. Te title o tis beautiul essay asks Wen is one tin equal to some oter tin? a question wic we now address. Deinition. A map Y is an isomorpism i tere exists a map Y suc tat te displayed composites are identities Y 6666 Y Y Y Te term derives rom te Greek: iso same morpic sape. Tis notion was called an equivalence in te oundational paper [EM45] in wic cateories are introduced as a ormalism wit wic to describe natural comparisons between parallel matematical constructions. An easy arument sows tat te map is also an isomorpism and urtermore uniquely determined. We say two objects are isomorpic i tere exists an isomorpism between tem. Te ollowin lemma says tat i two objects are isomorpic, ten tey are identical rom te vantae point o our pilosopy. Lemma. I and Y are isomorpic ten tere is a bijection between te collections o maps {Z } {Z Y } Proo. Composition wit te map Y deines a unction rom te collection o maps {Z } to te collection {Z Y }; composition wit Y deines a unction in te oter direction. To sow tat tese unctions deine a bijection, we prove tat tey are inverses. For tis, suppose we are iven a map Z. Its imae under te composite unction is () () by te associativity and unitality axioms. Te irst major teorem in cateory teory is tat te converse olds as well. It is not possible to overstate te importance o tis result wic says tat a matematical object is determined up to isomorpism by its universal property or, equivalently, by te (set-valued) unctor tat it represents. Lemma (Yoneda lemma). I tere exists a natural bijection {Z } {Z Y } or all objects Z in te cateory, ten and Y are canonically isomorpic. 2. A motivatin example rom omotopy teory Let us now brin tis discussion into te realm o omotopy teory. Fix a topoloical space T or instance a surace, peraps a torus, on wic, we mit imaine, lives a very small bu.
3 THE ALGEBRA AND GEOMETRY OF -CATEGORIES 3 Returnin to te pilosopy introduced above, we mit try to investiate te space T by considerin continuous maps rom simple eometric objects into T. In particular, we mit coose maps tat describe possible trajectories or te bu, wose positions are represented by points in T and wose meanderins are described by means o pats, i.e., continuous unctions rom te interval [, ] to T. Tese considerations naturally suest a cateory wose objects are points and wose morpisms are pats. Pats tat start and end at a common point can be composed by travelin twice as ast. Te composition o a pat rom position x to position y wit a pat rom position y to position z is te pat were te bu traverses over te course o te interval [, 2 ] and traverses over te course o te interval [ 2, ]. But tis composition law ails to be associative: a bu travelin alon te pat () spends al its time on and a quarter eac alon and wile a bu travelin alon () spends al its time alon and only a quarter eac on and. Wile tese pats aren t identical, tey are omotopic. Te omotopy takes te orm o a continuous unction rom te product [, ] [, ] to T as depicted by te ollowin scematic picture. [ [ [ ] Te construction suested above does yield a cateory Π T provided we instead deine maps to be omotopy classes o pats. Incidentally, te reason we suested tat T mit be a surace, suc as a torus, wit non-zero enus is so tat tis cateory will ave more tan one map between any two iven points. Assumin te space T is pat connected, te cateory Π T is equivalent (as a cateory) to te undamental roup o T, one o te most celebrated invariants in alebraic topoloy [Lur8]. Noneteless, tis construction is somewat unsatisyin, because te omotopy classes lose te inormation provided by te explicit omotopies. Te orettin involved wit tis truncation was necessary because cateories, as classically deined, are only -dimensional. Te ier omotopical inormation o te space T instead oranizes into an -cateory. 3. Simplicial sets An -cateory is a particular sort o simplicial set. A simplicial set consists o sets,, 2,... o simplices in varyin dimension wic we mit visualize
4 4 EMILY RIEHL in te ollowin manner x x x x x 2 x x 3333 x x 2 x Te data o a simplicial set also consists o unctions 2 3 tat speciy wic lower-dimensional simplices are aces o ier-dimensional simplices and wic ier-dimensional simplices represent deenerate copies o lowerdimensional simplices. Tese unctions satisy certain relations tat are evident rom teir eometric description. Example. To any cateory C tere is an associated simplicial set N C wit -simplices te objects o C, -simplices te maps, 2-simplices composable pairs o maps, 3- simplices composable triples, and so on. In tis simplicial set, a simplex is uniquely determined by its spine, te sequence o edes connectin te t vertex to te st to te 2nd to te 3rd and so on. Tis simplicial set is used to deine te classiyin space o a roup. Example. To any topoloical space T tere is an associated simplicial set ST wit -simplices te points o T, -simplices te pats, 2-simplices continuous unctions rom te topoloical 2-simplex into T, 3-simplices continuous unctions rom te topoloical 3-simplex to T, and so on. Tis simplicial set is used to deine te omoloy o a topoloical space. Simplicial sets temselves orm a cateory. Indeed, returnin to te pilosopy expressed above, a simplicial set is entirely described by maps to it. In particular, te n-simplices o correspond bijectively to maps n wose domain is te standard n-simplex. Here n is te simplicial set wit a sinle non-deenerate n- simplex, toeter wit its aces and teir deeneracies. Tere is a sub simplicial set Λ n k n or eac k n called te (n, k)-orn wic is te simplicial set ormed by te trowin away te non-deenerate n-simplex and its k-t (n )-dimensional ace. For example, te (2, )-orn is te simplicial set depicted below 2 2 A map Λ 2 speciies a pair o -simplices in so tat te taret vertex o one is te source vertex o te oter. 4. -cateories We are now prepared to deine an -cateory.
5 8888 THE ALGEBRA AND GEOMETRY OF -CATEGORIES 5 Deinition. An -cateory is a simplicial set so tat or eac n 2, k n any (n, k)-orn in extends to an n-simplex. Λ n k n We ave already seen two classes o examples. Example. For any cateory C, N C is an -cateory. Eac (2, )-orn admits an extension to a 2-simplex because composable maps ave a speciied composite. Eac (3, )- and (3, 2)-orn admits an extension because tis composition law is associative. Indeed, eac (n, k)-orn admits a unique extension to an n-simplex because te simplices in N C are uniquely caracterized by teir spine, wic is visible in te orn. Example. For any topoloical space T, ST is an -cateory. A map Λ n k ST corresponds to a continuous unction rom a topoloical realization o te (n, k)- orn into te space T. Tis topoloical orn includes into te topoloical n-simplex and tis inclusion is a deormation retract, meanin tere is a continuous retraction o te n-simplex onto te (n, k)-orn. Tis retraction may be used to deine te desired extension. Indeed, note tat tis arument works equally well or (n, )- and (n, n)-orns in ST. In eneral, we tink o an -cateory as a weak cateory wit maps in eac dimension. Te -simplices are te objects and te -simplices are te maps. For any composable pair o maps x y, y z, te extension condition in te case n 2 uarantees tat tere exists a 2-simplex x y z wic we tink o as a omotopy witnessin tat is a composite o and. Te 3-dimensional extension condition implies, amon oter tins, tat any two composites are temselves omotopic. Te 4-dimensional extension condition implies, amon oter tins, tat any two parallel omotopies ave a ier omotopy comparin tem, and so on. Tere is a sense in wic tese (ier) omotopies may temselves be composed; wit respect to tis composition law, all (ier) omotopies are invertible. One way to express tis property is to say tat between any two vertices in an -cateory tere is a topoloical space o maps, tou tis space is only well-deined up to omotopy type. 5. Equivalences in -cateories Finally, we return to a question considered at te beinnin: Wat sould it mean or two objects o an -cateory to be equivalent? A quick deinition is tat objects o an -cateory are equivalent just wen tey are isomorpic in te associated omotopy cateory. Tis leads to te ollowin concrete deinition.
6 6 EMILY RIEHL Deinition. A -simplex x y in a -cateory is an equivalence i tere exists a -simplex y x and 2-simplices y x x x y y x y Part o te maic o -cateories is visible in te ollowin result, wic says tat equivalences in an -cateory are automatically ininite-dimensional. Let J be te simplicial set wit two -simplices, ; two non-deenerate -simplices, ; and indeed two non-deenerate simplices in eac dimension continuin in te pattern depicted Teorem. Equivalences in an -cateory correspond to maps J. More precisely, a -simplex in is an equivalence i and only i it can be extended to a map wose domain is J. Te proo is reasonably elementary tou it requires some clever combinatorics. Te reader mit enjoy provin a special case: tat te data described above can be extended to dimension tree. Reerences [Lur8] J. Lurie, Wat is an -cateory?, Notices o te AMS, 55 (8), September, 28. [Maz7] B. Mazur, Wen is one tin equal to some oter tin?, In memory o Saunders MacLane, ttp:// mazur/expos.tml, June 2, 27. [EM45] S. Eilenber and S. MacLane, General teory o natural equivalences, Trans. Amer. Mat. Soc., 58, 945, Dept. o Matematics, Harvard University, Oxord Street, Cambride, MA 238 address: eriel@mat.arvard.edu
COMPLICIAL SETS, AN OVERTURE
COMPLICIAL SETS, AN OVERTURE EMILY RIEHL Abstract. Te aim o tese notes is to introduce te intuition motivatin te notion o a complicial set, a simplicial set wit certain marked tin simplices tat witness
More informationTowards an Override in Topoi
Artur Hues University o Dublin, Trinity Collee, Dublin, Ireland e-mail : Artur.Hues@cs.tcd.ie November 5, 1998 Abstract Models o sotware systems are built in Z and VDM usin partial unctions between sets
More informationSection 2.3: Calculating Limits using the Limit Laws
Section 2.3: Calculating Limits using te Limit Laws In previous sections, we used graps and numerics to approimate te value of a it if it eists. Te problem wit tis owever is tat it does not always give
More information13.5 DIRECTIONAL DERIVATIVES and the GRADIENT VECTOR
13.5 Directional Derivatives and te Gradient Vector Contemporary Calculus 1 13.5 DIRECTIONAL DERIVATIVES and te GRADIENT VECTOR Directional Derivatives In Section 13.3 te partial derivatives f x and f
More information4.1 Tangent Lines. y 2 y 1 = y 2 y 1
41 Tangent Lines Introduction Recall tat te slope of a line tells us ow fast te line rises or falls Given distinct points (x 1, y 1 ) and (x 2, y 2 ), te slope of te line troug tese two points is cange
More informationMore on Functions and Their Graphs
More on Functions and Teir Graps Difference Quotient ( + ) ( ) f a f a is known as te difference quotient and is used exclusively wit functions. Te objective to keep in mind is to factor te appearing in
More informationPROJECTIVE REPRESENTATIONS OF QUIVERS
IJMMS 31:2 22 97 11 II. S1611712218192 ttp://ijmms.indawi.com Hindawi ublisin Corp. ROJECTIVE RERESENTATIONS OF QUIVERS SANGWON ARK Received 3 Auust 21 We prove tat 2 is a projective representation o a
More informationBounding Tree Cover Number and Positive Semidefinite Zero Forcing Number
Bounding Tree Cover Number and Positive Semidefinite Zero Forcing Number Sofia Burille Mentor: Micael Natanson September 15, 2014 Abstract Given a grap, G, wit a set of vertices, v, and edges, various
More informationCHAPTER 7: TRANSCENDENTAL FUNCTIONS
7.0 Introduction and One to one Functions Contemporary Calculus 1 CHAPTER 7: TRANSCENDENTAL FUNCTIONS Introduction In te previous capters we saw ow to calculate and use te derivatives and integrals of
More informationLinear Interpolating Splines
Jim Lambers MAT 772 Fall Semester 2010-11 Lecture 17 Notes Tese notes correspond to Sections 112, 11, and 114 in te text Linear Interpolating Splines We ave seen tat ig-degree polynomial interpolation
More informationThe complicial sets model of higher -categories
Emily Riehl Johns Hopkins University The complicial sets model o hiher -cateories Structures supérieures Centre International de Rencontres Mathématiques The idea o a hiher -cateory An -cateory, a nickname
More informationMATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2
MATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2 Note: Tere will be a very sort online reading quiz (WebWork) on eac reading assignment due one our before class on its due date. Due dates can be found
More information4.2 The Derivative. f(x + h) f(x) lim
4.2 Te Derivative Introduction In te previous section, it was sown tat if a function f as a nonvertical tangent line at a point (x, f(x)), ten its slope is given by te it f(x + ) f(x). (*) Tis is potentially
More information3.6 Directional Derivatives and the Gradient Vector
288 CHAPTER 3. FUNCTIONS OF SEVERAL VARIABLES 3.6 Directional Derivatives and te Gradient Vector 3.6.1 Functions of two Variables Directional Derivatives Let us first quickly review, one more time, te
More information2 The Derivative. 2.0 Introduction to Derivatives. Slopes of Tangent Lines: Graphically
2 Te Derivative Te two previous capters ave laid te foundation for te study of calculus. Tey provided a review of some material you will need and started to empasize te various ways we will view and use
More information2.3 Additional Relations
3 2.3 Additional Relations Figure 2.3 identiies additional relations, indicating te locations o te object and image, and te ratio o teir eigts (magniication) and orientations. Ray enters te lens parallel
More informationSection 3. Imaging With A Thin Lens
Section 3 Imaging Wit A Tin Lens 3- at Ininity An object at ininity produces a set o collimated set o rays entering te optical system. Consider te rays rom a inite object located on te axis. Wen te object
More information7. Graph Algorithms. 7.1 Depth-First Search
7. Grap Algoritms Te previous capters ave examined a numer o grap prolems and teir algoritms in te context o design tecniques. In tis capter, we examine additional undamental grap prolems. In te irst two
More informationGenerell Topologi. Richard Williamson. May 6, 2013
Generell Topologi Richard Williamson May 6, Thursday 7th January. Basis o a topological space generating a topology with a speciied basis standard topology on R examples Deinition.. Let (, O) be a topological
More informationGABRIEL C. DRUMMOND-COLE
MILY RIHL: -CTGORIS FROM SCRTCH (TH SIC TWO-CTGORY THORY) GRIL C. DRUMMOND-COL I m trying to be really gentle on the category theory, within reason. So in particular, I m expecting a lot o people won t
More information12.2 TECHNIQUES FOR EVALUATING LIMITS
Section Tecniques for Evaluating Limits 86 TECHNIQUES FOR EVALUATING LIMITS Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing tecnique to evaluate its of
More information19.2 Surface Area of Prisms and Cylinders
Name Class Date 19 Surface Area of Prisms and Cylinders Essential Question: How can you find te surface area of a prism or cylinder? Resource Locker Explore Developing a Surface Area Formula Surface area
More informationLayered Reeb Graphs for three-dimensional Manifolds in Boundary Representation
Layered Reeb Graps or tree-dimensional Maniolds in oundary Representation. Strodto,. Jüttler Joannes Kepler University, Linz, ustria bstract Reeb raps are topoloical raps oriinatin in Morse teory, wic
More informationAll truths are easy to understand once they are discovered; the point is to discover them. Galileo
Section 7. olume All truts are easy to understand once tey are discovered; te point is to discover tem. Galileo Te main topic of tis section is volume. You will specifically look at ow to find te volume
More informationMulti-Stack Boundary Labeling Problems
Multi-Stack Boundary Labeling Problems Micael A. Bekos 1, Micael Kaufmann 2, Katerina Potika 1 Antonios Symvonis 1 1 National Tecnical University of Atens, Scool of Applied Matematical & Pysical Sciences,
More informationIsosurface Construction In Any Dimension. Using Convex Hulls
Isosurace Construction In Any Dimension Using Convex Hulls Praveen Baniramka 1, Repael Wenger 2, Roger Crawis 3 Abstract We present an algoritm or constructing isosuraces in any dimension. Te input to
More information1.4 RATIONAL EXPRESSIONS
6 CHAPTER Fundamentals.4 RATIONAL EXPRESSIONS Te Domain of an Algebraic Epression Simplifying Rational Epressions Multiplying and Dividing Rational Epressions Adding and Subtracting Rational Epressions
More informationFault Localization Using Tarantula
Class 20 Fault localization (cont d) Test-data generation Exam review: Nov 3, after class to :30 Responsible for all material up troug Nov 3 (troug test-data generation) Send questions beforeand so all
More information, 1 1, A complex fraction is a quotient of rational expressions (including their sums) that result
RT. Complex Fractions Wen working wit algebraic expressions, sometimes we come across needing to simplify expressions like tese: xx 9 xx +, xx + xx + xx, yy xx + xx + +, aa Simplifying Complex Fractions
More informationPiecewise Polynomial Interpolation, cont d
Jim Lambers MAT 460/560 Fall Semester 2009-0 Lecture 2 Notes Tese notes correspond to Section 4 in te text Piecewise Polynomial Interpolation, cont d Constructing Cubic Splines, cont d Having determined
More information( ) ( ) Mat 241 Homework Set 5 Due Professor David Schultz. x y. 9 4 The domain is the interior of the hyperbola.
Mat 4 Homework Set 5 Due Professor David Scultz Directions: Sow all algebraic steps neatly and concisely using proper matematical symbolism. Wen graps and tecnology are to be implemented, do so appropriately.
More informationThe (, D) and (, N) problems in double-step digraphs with unilateral distance
Electronic Journal of Grap Teory and Applications () (), Te (, D) and (, N) problems in double-step digraps wit unilateral distance C Dalfó, MA Fiol Departament de Matemàtica Aplicada IV Universitat Politècnica
More informationProofs of Derivative Rules
Proos o Derivative Rules Ma 16010 June 2018 Altoug proos are not generally a part o tis course, it s never a ba iea to ave some sort o explanation o wy tings are te way tey are. Tis is especially relevant
More informations e
1 Learning Hierarcical Partially Observable Markov Decision Process Models or Robot Navigation Georgios Teocarous Kasayar Roanimanes Sridar Maadevan teocar@cse.msu.edu kas@cse.msu.edu maadeva@cse.msu.edu
More information12.2 Techniques for Evaluating Limits
335_qd /4/5 :5 PM Page 863 Section Tecniques for Evaluating Limits 863 Tecniques for Evaluating Limits Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing
More informationChapter K. Geometric Optics. Blinn College - Physics Terry Honan
Capter K Geometric Optics Blinn College - Pysics 2426 - Terry Honan K. - Properties of Ligt Te Speed of Ligt Te speed of ligt in a vacuum is approximately c > 3.0µ0 8 mês. Because of its most fundamental
More information2.8 The derivative as a function
CHAPTER 2. LIMITS 56 2.8 Te derivative as a function Definition. Te derivative of f(x) istefunction f (x) defined as follows f f(x + ) f(x) (x). 0 Note: tis differs from te definition in section 2.7 in
More informationPseudo-Developing Maps for Ideal Triangulations I: Essential Edges and Generalised Hyperbolic Gluing Equations
Pseudo-Developing Maps for Ideal Triangulations I: Essential Edges and Generalised Hyperbolic Gluing Equations Henry Segerman and Stepan Tillmann To Bus Jaco on te occasion of is seventiet birtday arxiv:1107.1030v1
More informationCubic smoothing spline
Cubic smooting spline Menu: QCExpert Regression Cubic spline e module Cubic Spline is used to fit any functional regression curve troug data wit one independent variable x and one dependent random variable
More informationTilings of rectangles with T-tetrominoes
Tilings of rectangles wit T-tetrominoes Micael Korn and Igor Pak Department of Matematics Massacusetts Institute of Tecnology Cambridge, MA, 2139 mikekorn@mit.edu, pak@mat.mit.edu August 26, 23 Abstract
More informationYou Try: A. Dilate the following figure using a scale factor of 2 with center of dilation at the origin.
1 G.SRT.1-Some Tings To Know Dilations affect te size of te pre-image. Te pre-image will enlarge or reduce by te ratio given by te scale factor. A dilation wit a scale factor of 1> x >1enlarges it. A dilation
More informationClassify solids. Find volumes of prisms and cylinders.
11.4 Volumes of Prisms and Cylinders Essential Question How can you find te volume of a prism or cylinder tat is not a rigt prism or rigt cylinder? Recall tat te volume V of a rigt prism or a rigt cylinder
More informationANTENNA SPHERICAL COORDINATE SYSTEMS AND THEIR APPLICATION IN COMBINING RESULTS FROM DIFFERENT ANTENNA ORIENTATIONS
NTNN SPHRICL COORDINT SSTMS ND THIR PPLICTION IN COMBINING RSULTS FROM DIFFRNT NTNN ORINTTIONS llen C. Newell, Greg Hindman Nearfield Systems Incorporated 133. 223 rd St. Bldg. 524 Carson, C 9745 US BSTRCT
More informationMaterials: Whiteboard, TI-Nspire classroom set, quadratic tangents program, and a computer projector.
Adam Clinc Lesson: Deriving te Derivative Grade Level: 12 t grade, Calculus I class Materials: Witeboard, TI-Nspire classroom set, quadratic tangents program, and a computer projector. Goals/Objectives:
More informationTHANK YOU FOR YOUR PURCHASE!
THANK YOU FOR YOUR PURCHASE! Te resources included in tis purcase were designed and created by me. I ope tat you find tis resource elpful in your classroom. Please feel free to contact me wit any questions
More informationNOTES: A quick overview of 2-D geometry
NOTES: A quick overview of 2-D geometry Wat is 2-D geometry? Also called plane geometry, it s te geometry tat deals wit two dimensional sapes flat tings tat ave lengt and widt, suc as a piece of paper.
More informationAreas of Parallelograms and Triangles. To find the area of parallelograms and triangles
10-1 reas of Parallelograms and Triangles ommon ore State Standards G-MG..1 Use geometric sapes, teir measures, and teir properties to descrie ojects. G-GPE..7 Use coordinates to compute perimeters of
More informationAn Efficient Fault-Tolerant Multicast Routing Protocol with Core-Based Tree Techniques
An Eicient Fault-Tolerant Multicast outing Protocol wit Core-Based Tree Tecniques Weijia Jia + Wei Zao * + Department o Computer Science City University o Hong Kong Kowloon, Hong Kong Email: {wjia, gxu}@cs.cityu.edu.k
More informationCESILA: Communication Circle External Square Intersection-Based WSN Localization Algorithm
Sensors & Transducers 2013 by IFSA ttp://www.sensorsportal.com CESILA: Communication Circle External Square Intersection-Based WSN Localization Algoritm Sun Hongyu, Fang Ziyi, Qu Guannan College of Computer
More informationSubject 1.- Introduction to Scheme language. First part: Scheme. Second part: Prolog
CÓRDOBA UNIVERSITY SUPERIOR POLYTECHNIC SCHOOL DEPARTMENT OF COMPUTER SCIENCE AND NUMERICAL ANALYSIS DECLARATIVE PROGRAMMING COMPUTER ENGINEERING COMPUTATION ESPECIALITY FOURTH YEAR FIRST FOUR-MONTH PERIOD
More informationMAC-CPTM Situations Project
raft o not use witout permission -P ituations Project ituation 20: rea of Plane Figures Prompt teacer in a geometry class introduces formulas for te areas of parallelograms, trapezoids, and romi. e removes
More informationA geometric analysis of heuristic search
A geometric analysis of euristic searc by GORDON J. VANDERBRUG University of Maryland College Park, Maryland ABSTRACT Searc spaces for various types of problem representations can be represented in one
More informationTHE POSSIBILITY OF ESTIMATING THE VOLUME OF A SQUARE FRUSTRUM USING THE KNOWN VOLUME OF A CONICAL FRUSTRUM
THE POSSIBILITY OF ESTIMATING THE VOLUME OF A SQUARE FRUSTRUM USING THE KNOWN VOLUME OF A CONICAL FRUSTRUM SAMUEL OLU OLAGUNJU Adeyemi College of Education NIGERIA Email: lagsam04@aceondo.edu.ng ABSTRACT
More information12.2 Investigate Surface Area
Investigating g Geometry ACTIVITY Use before Lesson 12.2 12.2 Investigate Surface Area MATERIALS grap paper scissors tape Q U E S T I O N How can you find te surface area of a polyedron? A net is a pattern
More informationEfficient and Not-So-Efficient Algorithms. NP-Complete Problems. Search Problems. Propositional Logic. DPV Chapter 8: NP-Complete Problems, Part 1
Efficient and Not-So-Efficient Algoritms NP-Complete Problems DPV Capter 8: NP-Complete Problems, Part 1 Jim Royer EECS November 24, 2009 Problem spaces tend to be big: A grap on n vertices can ave up
More informationThe Euler and trapezoidal stencils to solve d d x y x = f x, y x
restart; Te Euler and trapezoidal stencils to solve d d x y x = y x Te purpose of tis workseet is to derive te tree simplest numerical stencils to solve te first order d equation y x d x = y x, and study
More informationAn Explicit Formula for Generalized Arithmetic-Geometric Sum
Applied Matematical Sciences, Vol. 9, 2015, no. 114, 5687-5696 HIKARI Ltd, www.m-ikari.com ttp://dx.doi.org/10.12988/ams.2015.57481 An Explicit Formula for Generalized Aritmetic-Geometric Sum Roberto B.
More informationCE 221 Data Structures and Algorithms
CE Data Structures and Algoritms Capter 4: Trees (AVL Trees) Text: Read Weiss, 4.4 Izmir University of Economics AVL Trees An AVL (Adelson-Velskii and Landis) tree is a binary searc tree wit a balance
More information1 Finding Trigonometric Derivatives
MTH 121 Fall 2008 Essex County College Division of Matematics Hanout Version 8 1 October 2, 2008 1 Fining Trigonometric Derivatives 1.1 Te Derivative as a Function Te efinition of te erivative as a function
More information15-122: Principles of Imperative Computation, Summer 2011 Assignment 6: Trees and Secret Codes
15-122: Principles of Imperative Computation, Summer 2011 Assignment 6: Trees and Secret Codes William Lovas (wlovas@cs) Karl Naden Out: Tuesday, Friday, June 10, 2011 Due: Monday, June 13, 2011 (Written
More informationChapter 34. Images. Two Types of Images. A Common Mirage. Plane Mirrors, Extended Object. Plane Mirrors, Point Object
Capter Images One o te most important uses o te basic laws governing ligt is te production o images. Images are critical to a variety o ields and industries ranging rom entertainment, security, and medicine
More informationCSE 332: Data Structures & Parallelism Lecture 8: AVL Trees. Ruth Anderson Winter 2019
CSE 2: Data Structures & Parallelism Lecture 8: AVL Trees Rut Anderson Winter 29 Today Dictionaries AVL Trees /25/29 2 Te AVL Balance Condition: Left and rigt subtrees of every node ave eigts differing
More informationA Cost Model for Distributed Shared Memory. Using Competitive Update. Jai-Hoon Kim Nitin H. Vaidya. Department of Computer Science
A Cost Model for Distributed Sared Memory Using Competitive Update Jai-Hoon Kim Nitin H. Vaidya Department of Computer Science Texas A&M University College Station, Texas, 77843-3112, USA E-mail: fjkim,vaidyag@cs.tamu.edu
More informationInvestigating an automated method for the sensitivity analysis of functions
Investigating an automated metod for te sensitivity analysis of functions Sibel EKER s.eker@student.tudelft.nl Jill SLINGER j..slinger@tudelft.nl Delft University of Tecnology 2628 BX, Delft, te Neterlands
More informationMAPI Computer Vision
MAPI Computer Vision Multiple View Geometry In tis module we intend to present several tecniques in te domain of te 3D vision Manuel Joao University of Mino Dep Industrial Electronics - Applications -
More informationeach node in the tree, the difference in height of its two subtrees is at the most p. AVL tree is a BST that is height-balanced-1-tree.
Data Structures CSC212 1 AVL Trees A binary tree is a eigt-balanced-p-tree if for eac node in te tree, te difference in eigt of its two subtrees is at te most p. AVL tree is a BST tat is eigt-balanced-tree.
More informationOur Calibrated Model has No Predictive Value: An Example from the Petroleum Industry
Our Calibrated Model as No Predictive Value: An Example from te Petroleum Industry J.N. Carter a, P.J. Ballester a, Z. Tavassoli a and P.R. King a a Department of Eart Sciences and Engineering, Imperial
More informationWhen a BST becomes badly unbalanced, the search behavior can degenerate to that of a sorted linked list, O(N).
Balanced Binary Trees Binary searc trees provide O(log N) searc times provided tat te nodes are distributed in a reasonably balanced manner. Unfortunately, tat is not always te case and performing a sequence
More informationWhen the dimensions of a solid increase by a factor of k, how does the surface area change? How does the volume change?
8.4 Surface Areas and Volumes of Similar Solids Wen te dimensions of a solid increase by a factor of k, ow does te surface area cange? How does te volume cange? 1 ACTIVITY: Comparing Surface Areas and
More information11. Transceiver Link Debugging Using the System Console
November 2011 QII53029-11.1.0 11. Transceiver Link Debugging Using te System Console QII53029-11.1.0 Tis capter describes ow to use te Transceiver Toolkit in te Quartus II sotware. Te Transceiver Toolkit
More informationFast Calculation of Thermodynamic Properties of Water and Steam in Process Modelling using Spline Interpolation
P R E P R N T CPWS XV Berlin, September 8, 008 Fast Calculation of Termodynamic Properties of Water and Steam in Process Modelling using Spline nterpolation Mattias Kunick a, Hans-Joacim Kretzscmar a,
More informationLesson 6 MA Nick Egbert
Overview From kindergarten we all know ow to find te slope of a line: rise over run, or cange in over cange in. We want to be able to determine slopes of functions wic are not lines. To do tis we use te
More informationWhat s the Difference?
1 Wat s te Difference? A Functional Pearl on Subtracting Bijections BRENT A. YORGEY, Hendrix College, USA KENNETH FONER, University of Pennsylvania, USA It is a straigtforward exercise to write a program
More information2.5 Evaluating Limits Algebraically
SECTION.5 Evaluating Limits Algebraically 3.5 Evaluating Limits Algebraically Preinary Questions. Wic of te following is indeterminate at x? x C x ; x x C ; x x C 3 ; x C x C 3 At x, x isofteform 0 xc3
More informationAVL Trees Outline and Required Reading: AVL Trees ( 11.2) CSE 2011, Winter 2017 Instructor: N. Vlajic
1 AVL Trees Outline and Required Reading: AVL Trees ( 11.2) CSE 2011, Winter 2017 Instructor: N. Vlajic AVL Trees 2 Binary Searc Trees better tan linear dictionaries; owever, te worst case performance
More informationAnnouncements SORTING. Prelim 1. Announcements. A3 Comments 9/26/17. This semester s event is on Saturday, November 4 Apply to be a teacher!
Announcements 2 "Organizing is wat you do efore you do someting, so tat wen you do it, it is not all mixed up." ~ A. A. Milne SORTING Lecture 11 CS2110 Fall 2017 is a program wit a teac anyting, learn
More informationProceedings of the 8th WSEAS International Conference on Neural Networks, Vancouver, British Columbia, Canada, June 19-21,
Proceedings of te 8t WSEAS International Conference on Neural Networks, Vancouver, Britis Columbia, Canada, June 9-2, 2007 3 Neural Network Structures wit Constant Weigts to Implement Dis-Jointly Removed
More informationCS211 Spring 2004 Lecture 06 Loops and their invariants. Software engineering reason for using loop invariants
CS211 Spring 2004 Lecture 06 Loops and teir invariants Reading material: Tese notes. Weiss: Noting on invariants. ProgramLive: Capter 7 and 8 O! Tou ast damnale iteration and art, indeed, ale to corrupt
More informationInference Based on SVARs Identified with Sign and Zero Restrictions: Theory and Applications
Inference Based on SVARs Identified wit Sign and Zero Restrictions: Teory and Applications Jonas E. Arias Federal Reserve Board Juan F. Rubio-Ramírez Emory University, BBVA Researc, and Federal Reserve
More informationBenefits of Dual Tree Complex Wavelet Transform over Discrete Wavelet Transform for Image Fusion
IJIRST International Journal for Innovative Researc in Science & Tecnoloy Volume Issue April 05 ISSN (online): 349-600 Benefits of Dual Tree Complex Wavelet Transform over Discrete Wavelet Transform for
More informationNumerical Derivatives
Lab 15 Numerical Derivatives Lab Objective: Understand and implement finite difference approximations of te derivative in single and multiple dimensions. Evaluate te accuracy of tese approximations. Ten
More informationPYRAMID FILTERS BASED ON BILINEAR INTERPOLATION
PYRAMID FILTERS BASED ON BILINEAR INTERPOLATION Martin Kraus Computer Grapics and Visualization Group, Tecnisce Universität Müncen, Germany krausma@in.tum.de Magnus Strengert Visualization and Interactive
More informationRedundancy Awareness in SQL Queries
Redundancy Awareness in QL Queries Bin ao and Antonio Badia omputer Engineering and omputer cience Department University of Louisville bin.cao,abadia @louisville.edu Abstract In tis paper, we study QL
More informationCryptanalysis of LOKI. Lars Ramkilde Knudsen. Aarhus Universitet Datalogisk Afdeling. Ny Munkegade. DK-8000 Aarhus C. Abstract
1 Cryptanalysis of LOKI Lars Ramkilde Knudsen Aarus Universitet Datalogisk Afdeling Ny Munkegade DK-8000 Aarus C. Abstract In [BPS90] Brown, Pieprzyk and Seberry proposed a new encryption primitive, wic
More informationRECONSTRUCTING OF A GIVEN PIXEL S THREE- DIMENSIONAL COORDINATES GIVEN BY A PERSPECTIVE DIGITAL AERIAL PHOTOS BY APPLYING DIGITAL TERRAIN MODEL
IV. Évfolyam 3. szám - 2009. szeptember Horvát Zoltán orvat.zoltan@zmne.u REONSTRUTING OF GIVEN PIXEL S THREE- DIMENSIONL OORDINTES GIVEN Y PERSPETIVE DIGITL ERIL PHOTOS Y PPLYING DIGITL TERRIN MODEL bsztrakt/bstract
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
Volume 2, Issue 9, September 2012 ISSN: 2277 128X International Journal of Advanced Researc in Computer Science and Software Engineering Researc Paper Available online at: www.ijarcsse.com Performance
More information6 Computing Derivatives the Quick and Easy Way
Jay Daigle Occiental College Mat 4: Calculus Experience 6 Computing Derivatives te Quick an Easy Way In te previous section we talke about wat te erivative is, an we compute several examples, an ten we
More informationHaar Transform CS 430 Denbigh Starkey
Haar Transform CS Denbig Starkey. Background. Computing te transform. Restoring te original image from te transform 7. Producing te transform matrix 8 5. Using Haar for lossless compression 6. Using Haar
More informationDesign Patterns for Data Structures. Chapter 10. Balanced Trees
Capter 10 Balanced Trees Capter 10 Four eigt-balanced trees: Red-Black binary tree Faster tan AVL for insertion and removal Adelsen-Velskii Landis (AVL) binary tree Faster tan red-black for lookup B-tree
More informationPacket Switching Networks. Jonathan S. Turner. Computer and Communications Research Center. the result of user connections that pass through the
Fluid Flow Loading Analysis of Packet Switcing Networks Jonatan S. Turner Computer and Communications Researc Center Wasington University, St. Louis, MO 63130 Abstract Recent researc in switcing as concentrated
More informationLimits and Continuity
CHAPTER Limits and Continuit. Rates of Cange and Limits. Limits Involving Infinit.3 Continuit.4 Rates of Cange and Tangent Lines An Economic Injur Level (EIL) is a measurement of te fewest number of insect
More informationA Bidirectional Subsethood Based Similarity Measure for Fuzzy Sets
A Bidirectional Subsetood Based Similarity Measure for Fuzzy Sets Saily Kabir Cristian Wagner Timoty C. Havens and Derek T. Anderson Intelligent Modelling and Analysis (IMA) Group and Lab for Uncertainty
More informationSORTING 9/26/18. Prelim 1. Prelim 1. Why Sorting? InsertionSort. Some Sorting Algorithms. Tonight!!!! Two Sessions:
Prelim 1 2 "Organizing is wat you do efore you do someting, so tat wen you do it, it is not all mixed up." ~ A. A. Milne SORTING Tonigt!!!! Two Sessions: You sould now y now wat room to tae te final. Jenna
More informationAnnouncements. Lilian s office hours rescheduled: Fri 2-4pm HW2 out tomorrow, due Thursday, 7/7. CSE373: Data Structures & Algorithms
Announcements Lilian s office ours resceduled: Fri 2-4pm HW2 out tomorrow, due Tursday, 7/7 CSE373: Data Structures & Algoritms Deletion in BST 2 5 5 2 9 20 7 0 7 30 Wy migt deletion be arder tan insertion?
More informationNotes: Dimensional Analysis / Conversions
Wat is a unit system? A unit system is a metod of taking a measurement. Simple as tat. We ave units for distance, time, temperature, pressure, energy, mass, and many more. Wy is it important to ave a standard?
More informationCoarticulation: An Approach for Generating Concurrent Plans in Markov Decision Processes
Coarticulation: An Approac for Generating Concurrent Plans in Markov Decision Processes Kasayar Roanimanes kas@cs.umass.edu Sridar Maadevan maadeva@cs.umass.edu Department of Computer Science, University
More informationDesign Patterns for Data Structures. Chapter 10. Balanced Trees
Capter 10 Balanced Trees Capter 10 Four eigt-balanced trees: Red-Black binary tree Faster tan AVL for insertion and removal Adelsen-Velskii Landis (AVL) binary tree Faster tan red-black for lookup B-tree
More informationOptimal motion planning for a tethered robot: Efficient preprocessing for fast shortest paths queries
2015 IEEE International Conference on Robotics and Automation (ICRA) Wasington State Convention Center Seattle, Wasington, May 26-30, 2015 Optimal motion planning for a tetered robot: Efficient preprocessing
More informationDensity Estimation Over Data Stream
Density Estimation Over Data Stream Aoying Zou Dept. of Computer Science, Fudan University 22 Handan Rd. Sangai, 2433, P.R. Cina ayzou@fudan.edu.cn Ziyuan Cai Dept. of Computer Science, Fudan University
More informationCharacterization of Isospectral Graphs Using Graph Invariants and Derived Orthogonal Parameters
J. Cem. Inf. Comput. Sci. 1998, 38, 367-373 367 Caracterization of Isospectral Graps Using Grap Invariants and Derived Ortogonal Parameters Krisnan Balasubramanian and Subas C. Basak*, Department of Cemistry,
More information