2 Review: Modeling Molecules with Spherical Balls

Size: px
Start display at page:

Download "2 Review: Modeling Molecules with Spherical Balls"

Transcription

1 CS273: Algorithms for Structure Handout # 12 and Motion in Biology Stanford University Thursday, 6 May 2003 Lecture #12: 6 May 2004 Topics: Geometric Models of Molecules II Scribe: Itamar Rosenn 1 Introduction The size and shape of molecules such as proteins have a strong influence in determining their function. In this lecture, we elaborate upon methods discussed in the previous lecture for modeling molecules geometrically, and explore how those methods can be used to accurately quantify the size and shape of the molecule itself. 2 Review: Modeling Molecules with Spherical Balls Space-Filling Diagrams In biology, space-filling diagrams are used to model the space occupied by a molecule. Each atom is modeled as a spherical ball; thus, since a molecule is a collection of atoms, it is modeled accordingly as a union of balls. When modeling molecules using spherical balls, we consider modeling the surface in one of three ways: The van der Walls surface is the surface of what is covered by the atoms, using the van der Walls radius of each atom. The solvent-accessible surface is generated by rolling a spherical probe around the van der Waals surface to reflect the accessibility of the molecule to a solvent. The molecular surface consists of the solvent-accessible surface offset inwards to remove areas touched by the probe surface, resulting in a smoother model than the original van der Waals surface, with less extreme crevices. Power Diagrams and Delaunay Triangulations A power diagram divides the space of our molecular model into several regions, each containing a unique atom of the molecule. For a given atom, its region in the power diagram consists of the space that is closer in power distance to that atom than to any other atom. We can use this notion of a power diagram to decompose our model into information about its atoms.

2 2 CS273: Handout # 12 Figure 1: (A) van der Waals surface, (B) solvent-accessible surface, and (C) molecular surface More formally: In three-dimensional space, let x y be the Euclidean distance between two points x and y, and let b i (z i, r i ) be a spherical ball whose center is z i and radius is r i. Thus, we define b i (z i, r i ) as {x R 3 : x z i r i }, the set of points that are at least as close to z i as the radius r i. The union of a set B of balls is B = {x R 3 : x b B}. The complement of this union, R 3 B, consists of an unbounded region that corresponds to the area outside of the molecule, and zero or more bounded regions that are cavities of B, which correspond to bounded empty spaces inside the molecule. The complement of the space occupied by the molecule will be addressed further in our discussion of pockets and voids in section 6. Define the power distance of a point x R 3 from a ball b i = b(z i, r i ) as Π i (x) = z i x 2 r 2 i. Note that the power distance between balls b i = (z i, r i ) and b j = (z j, r j ) is Π(ij) = z i z j 2 r 2 i r 2 j. The power diagram of a molecule is a collection of power cells for each of the spherical balls, where the power cell of a ball b i B is defined as the set of points at least as close to b i as to any other ball in B: V i = {x R 3 : Π i (x) Π j (x), j B} The dual of the power diagram of a molecule is its Delaunay T riangulation, which expresses the connectivity of our union of balls. This structure is formed by connecting the centers of each pair of atom-balls whose cells are adjacent in the power diagram. The convex hull of the atom centers consists of the outer boundary of the Delaunay Triangulation.

3 CS273: Handout # 12 3 Figure 2: (a) a molecular model segmented into a power diagram, (b) the corresponding Delaunay Triangulation, and (c) the alpha shape and corresponding dual complex (see section 4). 3 Simplicial Complexes To understand how we can use the notions of a power diagram and a Delaunay Triangulation to extract useful information about the actual molecule, we first need to understand a handful of basic topological concepts. In topology, a vertex is referred to as a 0-simplex, an edge as a 1-simplex, a triangle as a 2-simplex, and a tetrahedron as a 3-simplex, where the integer in each term signifies the dimension of the element. The boundary of a simplex consists of other, lower-dimension simplices that we call the faces or subsimplices of the simplex. Simplicial complexes are objects that are collections of simplices. Their construction adheres to the following two rules: (i) For every simplex in the construction, its faces are also part of the construction. (ii) The intersection of any two simplices is either a face of both simplices, or empty. 4 Alpha Shapes We have already seen an example of a simplicial complex: the Delaunay Triangulation of our molecular model. This complex consists of many vertices, edges, triangles, and tetrahedra. However, we need an organized way of building up these components. The natural

4 4 CS273: Handout # 12 Figure 3: (A) 0-simplex, 1-simplex, 2-simplex, and 3-simplex; (B) a legal complex of simplices; (C) intersection patterns of simplices that are not allowed in a complex. way to arrange these subsimplices of the Delaunay Triangulation is in a sequence using a ball growth model, in which the atom centers are expanded into balls of increasing radii. When two, three, or four atom balls have grown large enough so they collide, an edge, a triangle, or a tetrahedron spanning their centers is added to the complex, respectively. When an element is introduced into the complex in this manner, it is marked with the time point at which it has been introduced. This process of growing the atom balls and building the Delaunay complex in a chronological manner is known as filtration. We let the time t range from to, and grow the weight (i.e. squared radius) of each ball b i to (ri 2 + t) at time t. Since the power diagram of our model remains the same at all times, the dual complexes that arise through the filtration process must be subcomplexes of our entire Delaunay complex. Also, since as each ball grows, it covers an increasingly larger portion of its region in the power diagram, the dual complexes that result from filtration only increase over time. Instead of explicitly using a time parameter t, we use α = t. The motivation behind this convention is that if we set the initial radius of a ball to zero, the radius of the ball at time t is α. Let B α be our collection of balls and K α the corresponding complex at time t = α 2. K α is referred to as the α-complex, and its dual, the current shape of our molecule, is referred to as the α-shape of B. For small enough α, all radii are imaginary,

5 CS273: Handout # 12 5 so our union of balls and its corresponding dual complex are both empty. When α grows large enough, meaning enough time has passed for the balls to grow sufficiently large, the corresponding α-complex is equivalent to the Delaunay complex of our model. Thus, the process of filtration yields a sequence of complexes that contains the empty complex at one endpoint, the full Delaunay complex D at the other endpoint, and along the way reflects the shape of our model at increasingly higher levels of resolution: K α K β D for every < α 2 β 2 < where our filtration sequence is the ordered set: { = K 0, K 1,..., K m = D}. Note that D contains only finitely many simplices; thus there are only finitely many subcomplexes of D that appear during the filtration. Figure 4: (A) The alpha complex for small alpha consists mostly of low-dimension simplices. (B) The alpha complex for medium alpha features more extensive simplicial complexes. (C) The alpha complex for large alpha is connected, and contains previously built complexes along with new simplices in its complex. 5 Computing Metric Properties of a Molecule The problem of computing metric properties of a molecule such as surface area and volume is difficult because the spherical balls representing the atoms overlap due to chemical bonds, van der Waals contacts, and solvent contacts. As a result of these intersections, the area or volume of the molecule cannot be computed simply as a sum of the area or volume of the individual atoms. To account for intersections in computing metric properties, we can use the principle of inclusion-exclusion: when two atoms overlap, we subtract the metric value of the overlap from the sum of the metric values of the individual atoms. When three atoms overlap, we first subtract the pairwise overlaps, and then add the triple overlaps. This process

6 6 CS273: Handout # 12 continues when there are four, five, or more atoms that intersect. To compute our desired metric property using inclusion-exclusion, it is sufficient to use only the intersections represented as elements of our dual complex, which we can construct using the process of filtration explained above. Restricting our formula to these terms yields a polynomial-size computation. Note that without this restriction afforded by the dual complex, all possible intersections would have to be considered, resulting in an exponential-size computation. Figure 5: By inclusion-exclusion, area of union = A + B + C + D AB AC AD BC BD CD + ABC + ABD + ACD + BCD ABCD. Using only the simplices in the Delaunay Triangulation, this simplifies to A + B + C + D AB AC AD BC CD + ABC + ACD. Note that there is an equivalence among the cancelled terms: BD = BCD + ABD ABCD. 6 Pockets, Voids, and Topological Persistence As mentioned earlier, our motivation in quantifying the size and shape a molecule is that these properties affect how the molecule interacts with other molecules, which in turn helps to specify its function. Sometimes, the site of this interaction is a concavity of the molecule, known as a pocket, which is surrounded on most sides by atoms of the molecule. For example, if the molecule is a protein, a solvent can bind to the molecule at a pocket by gaining access to the molecule through the mouth, which is the area of pocket not enclosed by atoms. A void is a cavity that is bound on all sides by atoms of the molecule, and is therefore inaccessible to other molecules. During filtration, as the atom-balls swell, more and more balls intersect each other. Some of these intersections close the mouths of pockets in the model, first turning these

7 CS273: Handout # 12 7 pockets into voids and then subsuming all the empty space inside the voids, until no pockets or voids are left in the model. Indeed, the Delaunay Triangulation, which is the final complex generated by our filtration, by definition contains only unbound empty space outside the convex hull of the molecule. Thus, we can identify and analyze pockets through the process of filtration by noting which concavities of one alpha shape become voids in some later alpha shape and are eventually subsumed entirely. More precisely, pockets of a certain alpha shape are identified and measured using a discrete flow relation defined on the corresponding alpha complex. Discrete flow is defined on simplices of the Delaunay complex that have not yet appeared on the alpha complex; for example, in the two-dimensional case, we consider triangles of the Delaunay Triangulation that are empty in our current alpha complex, meaning that they have not yet appeared (compare figure 2b with 2c). According to the flow relation, an obtuse empty triangle flows to the triangle that borders it on the edge opposite the obtuse vertex, whereas an acute empty triangle is a sink that collects flow from all its neighboring empty triangles. A series of empty triangles that flows to a sink define a pocket, while a series of empty triangles that flow to infinity define the exterior of the molecule. The actual size of a pocket is computed by summing the size of empty triangles that define the pocket and then subtracting the fraction of atom space that appears in those triangles. Figure 6: (a) A pocket formed by five empty Delaunay triangles. Obtuse triangles flow into the sink. The top of triangle 1 forms the mouth of the pocket. (b) This structure is not identified as a pocket because the empty triangles flow to infinity rather than to a sink; this concavity does not get closed into a void at any point of the filtration. We may regard filtration as an evolutionary growth process in which topological features such as pockets and voids are created and later destroyed (see figure 7). The

8 8 CS273: Handout # 12 lifetime, or persistence, of each feature is an interval whose boundaries are the alpha value corresponding to the complex at which the feature first appears and the alpha value corresponding the complex at which it disappears. Very short-lived topological attributes may be considered data noise and removed, while attributes that persist longer are kept as meaningful topological features. Figure 7: Emergence and disappearance of topological features of the alpha shape through filtration. References [1] H. Edelsbrunner and E.P. Mucke, Three-dimensional alpha shapes, ACM Trans. Graphics, 13:43-72, [2] H. Edelsbrunner, The union of balls and its dual shape, Discrete Comput. Geometry, 13: , [3] H. Edelsbrunner, M.A. Facello and J. Liang, On the definition and the construction of pockets in macromolecules, Discrete Appl. Math, 88:83-102, [4] J. Liang, H. Edelsbrunner, P. Fu, P.V. Sudharkar and S. Subramaniam, Analytic shape computation of macromolecules I: molecular area and volume through alpha shape, Proteins: Structure, Function and Genetics 33:1-17, 1998.

9 CS273: Handout # 12 9 [5] J. Liang, H. Edelsbrunner, and C. Woodward, Anatomy of protein pockets and cavities: measurement of binding site geometry and implications for ligand design, Protein Science 7: , 1998.

Lecture 12: Feb 16, 2017

Lecture 12: Feb 16, 2017 CS 6170 Computational Topology: Topological Data Analysis Spring 2017 Lecture 12: Feb 16, 2017 Lecturer: Prof Bei Wang University of Utah School of Computing Scribe: Waiming Tai This

More information

Topological Data Analysis - II. Afra Zomorodian Department of Computer Science Dartmouth College

Topological Data Analysis - II. Afra Zomorodian Department of Computer Science Dartmouth College Topological Data Analysis - II Afra Zomorodian Department of Computer Science Dartmouth College September 4, 2007 1 Plan Yesterday: Motivation Topology Simplicial Complexes Invariants Homology Algebraic

More information

TOPOLOGY OF POINT CLOUD DATA

TOPOLOGY OF POINT CLOUD DATA TOPOLOGY OF POINT CLOUD DATA CS 468 Lecture 8 11/12/2 Afra Zomorodian CS 468 Lecture 8 - Page 1 PROJECTS Writeups: Introduction to Knot Theory (Giovanni De Santi) Mesh Processing with Morse Theory (Niloy

More information

TOPOLOGY OF POINT CLOUD DATA

TOPOLOGY OF POINT CLOUD DATA TOPOLOGY OF POINT CLOUD DATA CS 468 Lecture 8 3/3/4 Afra Zomorodian CS 468 Lecture 8 - Page 1 OVERVIEW Points Complexes Cěch Rips Alpha Filtrations Persistence Afra Zomorodian CS 468 Lecture 8 - Page 2

More information

COMPUTING HOMOLOGY: 0 b lk. CS 468 Lecture 7 11/6/2. Afra Zomorodian CS 468 Lecture 7 - Page 1

COMPUTING HOMOLOGY: 0 b lk. CS 468 Lecture 7 11/6/2. Afra Zomorodian CS 468 Lecture 7 - Page 1 COMPUTING HOMOLOGY: b 1 0... 0 0 b lk 0 0 CS 468 Lecture 7 11/6/2 Afra Zomorodian CS 468 Lecture 7 - Page 1 TIDBITS Lecture 8 is on Tuesday, November 12 Email me about projects! Projects will be November

More information

Supplementary Figures

Supplementary Figures Death time Supplementary Figures D i, Å Supplementary Figure 1: Correlation of the death time of 2-dimensional homology classes and the diameters of the largest included sphere D i when using methane CH

More information

CSE 140: Components and Design Techniques for Digital Systems

CSE 140: Components and Design Techniques for Digital Systems Lecture 4: Four Input K-Maps CSE 4: Components and Design Techniques for Digital Systems CK Cheng Dept. of Computer Science and Engineering University of California, San Diego Outlines Boolean Algebra

More information

Chapter 3: Homology Groups Topics in Computational Topology: An Algorithmic View

Chapter 3: Homology Groups Topics in Computational Topology: An Algorithmic View Chapter 3: Homology Groups Topics in Computational Topology: An Algorithmic View As discussed in Chapter 2, we have complete topological information about 2-manifolds. How about higher dimensional manifolds?

More information

Math Wrangle Practice Problems

Math Wrangle Practice Problems Math Wrangle Practice Problems American Mathematics Competitions December 22, 2011 ((3!)!)! 1. Given that, = k. n!, where k and n are positive integers and n 3. is as large as possible, find k + n. 2.

More information

Inclusion-Exclusion Formulas from Independent Complexes

Inclusion-Exclusion Formulas from Independent Complexes Inclusion-Exclusion Formulas from Independent Complexes Dominique Attali and Herbert Edelsbrunner Abstract Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls

More information

Representing Thermal Vibrations and Uncertainty in Molecular Surfaces

Representing Thermal Vibrations and Uncertainty in Molecular Surfaces Representing Thermal Vibrations and Uncertainty in Molecular Surfaces Chang Ha Lee and Amitabh Varshney Department of Computer Science and UMIACS, University of Maryland, College Park, Maryland, USA ABSTRACT

More information

Voronoi Diagrams for Oriented Spheres

Voronoi Diagrams for Oriented Spheres Voronoi Diagrams for Oriented Spheres F. Aurenhammer J. Wallner University of Technology Graz, Austria auren@igi.tugraz.at j.wallner@tugraz.at M. Peternell H. Pottmann University of Technology Vienna,

More information

MATH 31BH Homework 1 Solutions

MATH 31BH Homework 1 Solutions MATH 3BH Homework Solutions January 0, 04 Problem.5. (a) (x, y)-plane in R 3 is closed and not open. To see that this plane is not open, notice that any ball around the origin (0, 0, 0) will contain points

More information

Persistent Homology. 128 VI Persistence

Persistent Homology. 128 VI Persistence 8 VI Persistence VI. Persistent Homology A main purpose of persistent homology is the measurement of the scale or resolution of a topological feature. There are two ingredients, one geometric, assigning

More information

Persistent Homology. 24 Notes by Tamal K. Dey, OSU

Persistent Homology. 24 Notes by Tamal K. Dey, OSU 24 Notes by Tamal K. Dey, OSU Persistent Homology Suppose we have a noisy point set (data) sampled from a space, say a curve inr 2 as in Figure 12. Can we get the information that the sampled space had

More information

A NOTE ON SPACES OF ASYMPTOTIC DIMENSION ONE

A NOTE ON SPACES OF ASYMPTOTIC DIMENSION ONE A NOTE ON SPACES OF ASYMPTOTIC DIMENSION ONE KOJI FUJIWARA AND KEVIN WHYTE Abstract. Let X be a geodesic metric space with H 1(X) uniformly generated. If X has asymptotic dimension one then X is quasi-isometric

More information

Alpha-Shapes and Flow Shapes are Homotopy Equivalent

Alpha-Shapes and Flow Shapes are Homotopy Equivalent Alpha-Shapes and Flow Shapes are Homotopy Equivalent Tamal K. Dey The Ohio State University, USA tamaldey@cis.ohio-state.edu Joachim Giesen ETH Zürich, Switzerland giesen@inf.ethz.ch Matthias John ETH

More information

Area, perimeter and derivatives of a skin curve

Area, perimeter and derivatives of a skin curve Computational Geometry 6 (003) 173 19 www.elsevier.com/locate/comgeo Area, perimeter and derivatives of a skin curve Ho-Lun Cheng a, Herbert Edelsbrunner b, a Department of Computer Science, University

More information

High School Math Contest

High School Math Contest High School Math Contest University of South Carolina February th, 017 Problem 1. If (x y) = 11 and (x + y) = 169, what is xy? (a) 11 (b) 1 (c) 1 (d) (e) 8 Solution: Note that xy = (x + y) (x y) = 169

More information

Mathematics 2260H Geometry I: Euclidean geometry Trent University, Fall 2016 Solutions to the Quizzes

Mathematics 2260H Geometry I: Euclidean geometry Trent University, Fall 2016 Solutions to the Quizzes Mathematics 2260H Geometry I: Euclidean geometry Trent University, Fall 2016 Solutions to the Quizzes Quiz #1. Wednesday, 13 September. [10 minutes] 1. Suppose you are given a line (segment) AB. Using

More information

What if the characteristic equation has complex roots?

What if the characteristic equation has complex roots? MA 360 Lecture 18 - Summary of Recurrence Relations (cont. and Binomial Stuff Thursday, November 13, 01. Objectives: Examples of Recurrence relation solutions, Pascal s triangle. A quadratic equation What

More information

Mathematics 2260H Geometry I: Euclidean geometry Trent University, Winter 2012 Quiz Solutions

Mathematics 2260H Geometry I: Euclidean geometry Trent University, Winter 2012 Quiz Solutions Mathematics 2260H Geometry I: Euclidean geometry Trent University, Winter 2012 Quiz Solutions Quiz #1. Tuesday, 17 January, 2012. [10 minutes] 1. Given a line segment AB, use (some of) Postulates I V,

More information

13 th Annual Harvard-MIT Mathematics Tournament Saturday 20 February 2010

13 th Annual Harvard-MIT Mathematics Tournament Saturday 20 February 2010 13 th Annual Harvard-MIT Mathematics Tournament Saturday 0 February 010 1. [3] Suppose that x and y are positive reals such that Find x. x y = 3, x + y = 13. 3+ Answer: 17 Squaring both sides of x y =

More information

THE PENNSYLVANIA STATE UNIVERSITY SCHREYER HONORS COLLEGE DEPARTMENT OF MATHEMATICS TOPOLOGY AND DATA ANALYSIS HANGYU ZHOU SPRING 2017

THE PENNSYLVANIA STATE UNIVERSITY SCHREYER HONORS COLLEGE DEPARTMENT OF MATHEMATICS TOPOLOGY AND DATA ANALYSIS HANGYU ZHOU SPRING 2017 THE PENNSYLVANIA STATE UNIVERSITY SCHREYER HONORS COLLEGE DEPARTMENT OF MATHEMATICS TOPOLOGY AND DATA ANALYSIS HANGYU ZHOU SPRING 2017 A thesis submitted in partial fulfillment of the requirements for

More information

Math Conventions. for the Quantitative Reasoning measure of the GRE General Test.

Math Conventions. for the Quantitative Reasoning measure of the GRE General Test. Math Conventions for the Quantitative Reasoning measure of the GRE General Test www.ets.org The mathematical symbols and terminology used in the Quantitative Reasoning measure of the test are conventional

More information

Lecture 4: Four Input K-Maps

Lecture 4: Four Input K-Maps Lecture 4: Four Input K-Maps CSE 4: Components and Design Techniques for Digital Systems Fall 24 CK Cheng Dept. of Computer Science and Engineering University of California, San Diego Outlines Boolean

More information

The Advantage Testing Foundation Olympiad Solutions

The Advantage Testing Foundation Olympiad Solutions The Advantage Testing Foundation 014 Olympiad Problem 1 Say that a convex quadrilateral is tasty if its two diagonals divide the quadrilateral into four nonoverlapping similar triangles. Find all tasty

More information

CS 273 Prof. Serafim Batzoglou Prof. Jean-Claude Latombe Spring Lecture 12 : Energy maintenance (1) Lecturer: Prof. J.C.

CS 273 Prof. Serafim Batzoglou Prof. Jean-Claude Latombe Spring Lecture 12 : Energy maintenance (1) Lecturer: Prof. J.C. CS 273 Prof. Serafim Batzoglou Prof. Jean-Claude Latombe Spring 2006 Lecture 12 : Energy maintenance (1) Lecturer: Prof. J.C. Latombe Scribe: Neda Nategh How do you update the energy function during the

More information

Lecture Notes Introduction to Cluster Algebra

Lecture Notes Introduction to Cluster Algebra Lecture Notes Introduction to Cluster Algebra Ivan C.H. Ip Update: July 11, 2017 11 Cluster Algebra from Surfaces In this lecture, we will define and give a quick overview of some properties of cluster

More information

CS 6820 Fall 2014 Lectures, October 3-20, 2014

CS 6820 Fall 2014 Lectures, October 3-20, 2014 Analysis of Algorithms Linear Programming Notes CS 6820 Fall 2014 Lectures, October 3-20, 2014 1 Linear programming The linear programming (LP) problem is the following optimization problem. We are given

More information

Geometry Problem Solving Drill 08: Congruent Triangles

Geometry Problem Solving Drill 08: Congruent Triangles Geometry Problem Solving Drill 08: Congruent Triangles Question No. 1 of 10 Question 1. The following triangles are congruent. What is the value of x? Question #01 (A) 13.33 (B) 10 (C) 31 (D) 18 You set

More information

Neuronal structure detection using Persistent Homology

Neuronal structure detection using Persistent Homology Neuronal structure detection using Persistent Homology J. Heras, G. Mata and J. Rubio Department of Mathematics and Computer Science, University of La Rioja Seminario de Informática Mirian Andrés March

More information

16 circles. what goes around...

16 circles. what goes around... 16 circles. what goes around... 2 lesson 16 this is the first of two lessons dealing with circles. this lesson gives some basic definitions and some elementary theorems, the most important of which is

More information

UNCC 2001 Comprehensive, Solutions

UNCC 2001 Comprehensive, Solutions UNCC 2001 Comprehensive, Solutions March 5, 2001 1 Compute the sum of the roots of x 2 5x + 6 = 0 (A) (B) 7/2 (C) 4 (D) 9/2 (E) 5 (E) The sum of the roots of the quadratic ax 2 + bx + c = 0 is b/a which,

More information

On bisectors in Minkowski normed space.

On bisectors in Minkowski normed space. On bisectors in Minkowski normed space. Á.G.Horváth Department of Geometry, Technical University of Budapest, H-1521 Budapest, Hungary November 6, 1997 Abstract In this paper we discuss the concept of

More information

Some Topics in Computational Topology. Yusu Wang. AMS Short Course 2014

Some Topics in Computational Topology. Yusu Wang. AMS Short Course 2014 Some Topics in Computational Topology Yusu Wang AMS Short Course 2014 Introduction Much recent developments in computational topology Both in theory and in their applications E.g, the theory of persistence

More information

Game Theory and Algorithms Lecture 7: PPAD and Fixed-Point Theorems

Game Theory and Algorithms Lecture 7: PPAD and Fixed-Point Theorems Game Theory and Algorithms Lecture 7: PPAD and Fixed-Point Theorems March 17, 2011 Summary: The ultimate goal of this lecture is to finally prove Nash s theorem. First, we introduce and prove Sperner s

More information

nx + 1 = (n + 1)x 13(n + 1) and nx = (n + 1)x + 27(n + 1).

nx + 1 = (n + 1)x 13(n + 1) and nx = (n + 1)x + 27(n + 1). 1. (Answer: 630) 001 AIME SOLUTIONS Let a represent the tens digit and b the units digit of an integer with the required property. Then 10a + b must be divisible by both a and b. It follows that b must

More information

CHAPTER 3 BOOLEAN ALGEBRA

CHAPTER 3 BOOLEAN ALGEBRA CHAPTER 3 BOOLEAN ALGEBRA (continued) This chapter in the book includes: Objectives Study Guide 3.1 Multiplying Out and Factoring Expressions 3.2 Exclusive-OR and Equivalence Operations 3.3 The Consensus

More information

Lecture 2: Addition (and free abelian groups)

Lecture 2: Addition (and free abelian groups) Lectur: Addition (and free abelian groups) of a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305) Topics in Topology: Scientific and Engineering Applications of Algebraic

More information

Approximating the Pathway Axis and the Persistence Diagram of a Collection of Balls in 3-Space

Approximating the Pathway Axis and the Persistence Diagram of a Collection of Balls in 3-Space Approximating the Pathway Axis and the Persistence Diagram of a Collection of Balls in 3-Space Eitan Yaffe Dan Halperin School of Computer Science Tel-Aviv University, Israel {eitanyaf,danha}@post.tau.ac.il

More information

2 Homework. Dr. Franz Rothe February 21, 2015 All3181\3181_spr15h2.tex

2 Homework. Dr. Franz Rothe February 21, 2015 All3181\3181_spr15h2.tex Math 3181 Dr. Franz Rothe February 21, 2015 All3181\3181_spr15h2.tex Name: Homework has to be turned in this handout. For extra space, use the back pages, or blank pages between. The homework can be done

More information

CLASS NOTES FOR APRIL 14, 2000

CLASS NOTES FOR APRIL 14, 2000 CLASS NOTES FOR APRIL 14, 2000 Announcement: Section 1.2, Questions 3,5 have been deferred from Assignment 1 to Assignment 2. Section 1.4, Question 5 has been dropped entirely. 1. Review of Wednesday class

More information

HMMT November 2013 Saturday 9 November 2013

HMMT November 2013 Saturday 9 November 2013 . [5] Evaluate + 5 + 8 + + 0. 75 There are 0 HMMT November 0 Saturday 9 November 0 Guts Round = 4 terms with average +0, so their sum is 7 0 = 75.. [5] Two fair six-sided dice are rolled. What is the probability

More information

1 Overview. CS348a: Computer Graphics Handout #8 Geometric Modeling Original Handout #8 Stanford University Thursday, 15 October 1992

1 Overview. CS348a: Computer Graphics Handout #8 Geometric Modeling Original Handout #8 Stanford University Thursday, 15 October 1992 CS348a: Computer Graphics Handout #8 Geometric Modeling Original Handout #8 Stanford University Thursday, 15 October 1992 Original Lecture #1: 1 October 1992 Topics: Affine vs. Projective Geometries Scribe:

More information

Some Topics in Computational Topology

Some Topics in Computational Topology Some Topics in Computational Topology Yusu Wang Ohio State University AMS Short Course 2014 Introduction Much recent developments in computational topology Both in theory and in their applications E.g,

More information

Satish Chandra. Unit I, REAL GASES. Lecture Notes Dated: Dec 08-14, Vander-Waals Gas

Satish Chandra. Unit I, REAL GASES. Lecture Notes Dated: Dec 08-14, Vander-Waals Gas Vander-Waals Gas Lecture Notes Dated: Dec 08-14, 01 Many equations have been proposed which describe the pvt relations of real gases more accurately than does the equation of state of an ideal gas. Some

More information

INTRODUCTION TO FINITE ELEMENT METHODS

INTRODUCTION TO FINITE ELEMENT METHODS INTRODUCTION TO FINITE ELEMENT METHODS LONG CHEN Finite element methods are based on the variational formulation of partial differential equations which only need to compute the gradient of a function.

More information

Glossary Common Core Curriculum Maps Math/Grade 9 Grade 12

Glossary Common Core Curriculum Maps Math/Grade 9 Grade 12 Glossary Common Core Curriculum Maps Math/Grade 9 Grade 12 Grade 9 Grade 12 AA similarity Angle-angle similarity. When twotriangles have corresponding angles that are congruent, the triangles are similar.

More information

Lesson 9.1 Skills Practice

Lesson 9.1 Skills Practice Lesson 9.1 Skills Practice Name Date Earth Measure Introduction to Geometry and Geometric Constructions Vocabulary Write the term that best completes the statement. 1. means to have the same size, shape,

More information

right angle an angle whose measure is exactly 90ᴼ

right angle an angle whose measure is exactly 90ᴼ right angle an angle whose measure is exactly 90ᴼ m B = 90ᴼ B two angles that share a common ray A D C B Vertical Angles A D C B E two angles that are opposite of each other and share a common vertex two

More information

Syllabus. + + x + n 1 n. + x + 2

Syllabus. + + x + n 1 n. + x + 2 1. Special Functions This class will cover problems involving algebraic functions other than polynomials, such as square roots, the floor function, and logarithms. Example Problem: Let n be a positive

More information

Comprehensive Mathematics Contest

Comprehensive Mathematics Contest Comprehensive Mathematics Contest Elon University Mathematics and Statistics Department Saturday, March 17, 2018 Multiple Choice 1. Let a and b be lengths of the major and minor axis of the ellipse given

More information

Liberal High School Lesson Plans

Liberal High School Lesson Plans Monday, 5/8/2017 Liberal High School Lesson Plans er:david A. Hoffman Class:Algebra III 5/8/2017 To 5/12/2017 Students will perform math operationsto solve rational expressions and find the domain. How

More information

Set, functions and Euclidean space. Seungjin Han

Set, functions and Euclidean space. Seungjin Han Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,

More information

2017 Harvard-MIT Mathematics Tournament

2017 Harvard-MIT Mathematics Tournament Team Round 1 Let P(x), Q(x) be nonconstant polynomials with real number coefficients. Prove that if P(y) = Q(y) for all real numbers y, then P(x) = Q(x) for all real numbers x. 2 Does there exist a two-variable

More information

COM111 Introduction to Computer Engineering (Fall ) NOTES 6 -- page 1 of 12

COM111 Introduction to Computer Engineering (Fall ) NOTES 6 -- page 1 of 12 COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 6 -- page 1 of 12 Karnaugh Maps In this lecture, we will discuss Karnaugh maps (K-maps) more formally than last time and discuss a more

More information

triangles in neutral geometry three theorems of measurement

triangles in neutral geometry three theorems of measurement lesson 10 triangles in neutral geometry three theorems of measurement 112 lesson 10 in this lesson we are going to take our newly created measurement systems, our rulers and our protractors, and see what

More information

Introduction to Real Analysis Alternative Chapter 1

Introduction to Real Analysis Alternative Chapter 1 Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces

More information

18.312: Algebraic Combinatorics Lionel Levine. Lecture 11

18.312: Algebraic Combinatorics Lionel Levine. Lecture 11 18.312: Algebraic Combinatorics Lionel Levine Lecture date: March 15, 2011 Lecture 11 Notes by: Ben Bond Today: Mobius Algebras, µ( n ). Test: The average was 17. If you got < 15, you have the option to

More information

UNIT 3 CIRCLES AND VOLUME Lesson 1: Introducing Circles Instruction

UNIT 3 CIRCLES AND VOLUME Lesson 1: Introducing Circles Instruction Prerequisite Skills This lesson requires the use of the following skills: performing operations with fractions understanding slope, both algebraically and graphically understanding the relationship of

More information

Solutions to Tutorial 7 (Week 8)

Solutions to Tutorial 7 (Week 8) The University of Sydney School of Mathematics and Statistics Solutions to Tutorial 7 (Week 8) MATH2962: Real and Complex Analysis (Advanced) Semester 1, 2017 Web Page: http://www.maths.usyd.edu.au/u/ug/im/math2962/

More information

The Advantage Testing Foundation Solutions

The Advantage Testing Foundation Solutions The Advantage Testing Foundation 2016 Problem 1 Let T be a triangle with side lengths 3, 4, and 5. If P is a point in or on T, what is the greatest possible sum of the distances from P to each of the three

More information

Intermediate Mathematics League of Eastern Massachusetts

Intermediate Mathematics League of Eastern Massachusetts Meet #5 March/April 2005 Intermediate Mathematics League of Eastern Massachusetts Average team score: 86.6 Average meet for the seasion: 95.9 Meet #5 March/April 2005 Category 1 Mystery Meet #5, March/April

More information

Advanced Digital Design with the Verilog HDL, Second Edition Michael D. Ciletti Prentice Hall, Pearson Education, 2011

Advanced Digital Design with the Verilog HDL, Second Edition Michael D. Ciletti Prentice Hall, Pearson Education, 2011 Problem 2-1 Recall that a minterm is a cube in which every variable appears. A Boolean expression in SOP form is canonical if every cube in the expression has a unique representation in which all of the

More information

(A) 2S + 3 (B) 3S + 2 (C) 3S + 6 (D) 2S + 6 (E) 2S + 12

(A) 2S + 3 (B) 3S + 2 (C) 3S + 6 (D) 2S + 6 (E) 2S + 12 1 The sum of two numbers is S Suppose 3 is added to each number and then each of the resulting numbers is doubled What is the sum of the final two numbers? (A) S + 3 (B) 3S + (C) 3S + 6 (D) S + 6 (E) S

More information

Persistent homology analysis of protein structure, flexibility and folding

Persistent homology analysis of protein structure, flexibility and folding Persistent homology analysis of protein structure, flexibility and folding arxiv:1412.2779v1 [q-bio.bm] 8 Dec 2014 Kelin Xia 1,2 Guo-Wei Wei 1,2,3,4 1 Department of Mathematics Michigan State University,

More information

Homework Assignments Math /02 Fall 2017

Homework Assignments Math /02 Fall 2017 Homework Assignments Math 119-01/02 Fall 2017 Assignment 1 Due date : Wednesday, August 30 Section 6.1, Page 178: #1, 2, 3, 4, 5, 6. Section 6.2, Page 185: #1, 2, 3, 5, 6, 8, 10-14, 16, 17, 18, 20, 22,

More information

Theorem on altitudes and the Jacobi identity

Theorem on altitudes and the Jacobi identity Theorem on altitudes and the Jacobi identity A. Zaslavskiy and M. Skopenkov Solutions. First let us give a table containing the answers to all the problems: Algebraic object Geometric sense A apointa a

More information

High School Math Contest

High School Math Contest High School Math Contest University of South Carolina February 4th, 017 Problem 1. If (x y) = 11 and (x + y) = 169, what is xy? (a) 11 (b) 1 (c) 1 (d) 4 (e) 48 Problem. Suppose the function g(x) = f(x)

More information

Again we return to a row of 1 s! Furthermore, all the entries are positive integers.

Again we return to a row of 1 s! Furthermore, all the entries are positive integers. Lecture Notes Introduction to Cluster Algebra Ivan C.H. Ip Updated: April 4, 207 Examples. Conway-Coxeter frieze pattern Frieze is the wide central section part of an entablature, often seen in Greek temples,

More information

Topological Graph Theory Lecture 4: Circle packing representations

Topological Graph Theory Lecture 4: Circle packing representations Topological Graph Theory Lecture 4: Circle packing representations Notes taken by Andrej Vodopivec Burnaby, 2006 Summary: A circle packing of a plane graph G is a set of circles {C v v V (G)} in R 2 such

More information

MEASURING SHAPE WITH TOPOLOGY

MEASURING SHAPE WITH TOPOLOGY MEASURING SHAPE WITH TOPOLOGY ROBERT MACPHERSON AND BENJAMIN SCHWEINHART Abstract. We propose a measure of shape which is appropriate for the study of a complicated geometric structure, defined using the

More information

Geometry Final Review. Chapter 1. Name: Per: Vocab. Example Problems

Geometry Final Review. Chapter 1. Name: Per: Vocab. Example Problems Geometry Final Review Name: Per: Vocab Word Acute angle Adjacent angles Angle bisector Collinear Line Linear pair Midpoint Obtuse angle Plane Pythagorean theorem Ray Right angle Supplementary angles Complementary

More information

Chapter 3. Betweenness (ordering) A system satisfying the incidence and betweenness axioms is an ordered incidence plane (p. 118).

Chapter 3. Betweenness (ordering) A system satisfying the incidence and betweenness axioms is an ordered incidence plane (p. 118). Chapter 3 Betweenness (ordering) Point B is between point A and point C is a fundamental, undefined concept. It is abbreviated A B C. A system satisfying the incidence and betweenness axioms is an ordered

More information

Homework Assignments Math /02 Fall 2014

Homework Assignments Math /02 Fall 2014 Homework Assignments Math 119-01/02 Fall 2014 Assignment 1 Due date : Friday, September 5 6th Edition Problem Set Section 6.1, Page 178: #1, 2, 3, 4, 5, 6. Section 6.2, Page 185: #1, 2, 3, 5, 6, 8, 10-14,

More information

(D) (A) Q.3 To which of the following circles, the line y x + 3 = 0 is normal at the point ? 2 (A) 2

(D) (A) Q.3 To which of the following circles, the line y x + 3 = 0 is normal at the point ? 2 (A) 2 CIRCLE [STRAIGHT OBJECTIVE TYPE] Q. The line x y + = 0 is tangent to the circle at the point (, 5) and the centre of the circles lies on x y = 4. The radius of the circle is (A) 3 5 (B) 5 3 (C) 5 (D) 5

More information

Good Triangulations. Jean-Daniel Boissonnat DataShape, INRIA

Good Triangulations. Jean-Daniel Boissonnat DataShape, INRIA Good Triangulations Jean-Daniel Boissonnat DataShape, INRIA http://www-sop.inria.fr/geometrica Algorithmic Geometry Good Triangulations J-D. Boissonnat 1 / 29 Definition and existence of nets Definition

More information

2. In ABC, the measure of angle B is twice the measure of angle A. Angle C measures three times the measure of angle A. If AC = 26, find AB.

2. In ABC, the measure of angle B is twice the measure of angle A. Angle C measures three times the measure of angle A. If AC = 26, find AB. 2009 FGCU Mathematics Competition. Geometry Individual Test 1. You want to prove that the perpendicular bisector of the base of an isosceles triangle is also the angle bisector of the vertex. Which postulate/theorem

More information

Optimistic limits of the colored Jones polynomials

Optimistic limits of the colored Jones polynomials Optimistic limits of the colored Jones polynomials Jinseok Cho and Jun Murakami arxiv:1009.3137v9 [math.gt] 9 Apr 2013 October 31, 2018 Abstract We show that the optimistic limits of the colored Jones

More information

SMT China 2014 Team Test Solutions August 23, 2014

SMT China 2014 Team Test Solutions August 23, 2014 . Compute the remainder when 2 30 is divided by 000. Answer: 824 Solution: Note that 2 30 024 3 24 3 mod 000). We will now consider 24 3 mod 8) and 24 3 mod 25). Note that 24 3 is divisible by 8, but 24

More information

11. Prove that the Missing Strip Plane is an. 12. Prove the above proposition.

11. Prove that the Missing Strip Plane is an. 12. Prove the above proposition. 10 Pasch Geometries Definition (Pasch s Postulate (PP)) A metric geometry satisfies Pasch s Postulate (PP) if for any line l, any triangle ABC, and any point D l such that A D B, then either l AC or l

More information

Definitions, Axioms, Postulates, Propositions, and Theorems from Euclidean and Non-Euclidean Geometries by Marvin Jay Greenberg ( )

Definitions, Axioms, Postulates, Propositions, and Theorems from Euclidean and Non-Euclidean Geometries by Marvin Jay Greenberg ( ) Definitions, Axioms, Postulates, Propositions, and Theorems from Euclidean and Non-Euclidean Geometries by Marvin Jay Greenberg (2009-03-26) Logic Rule 0 No unstated assumptions may be used in a proof.

More information

Triangles. 3.In the following fig. AB = AC and BD = DC, then ADC = (A) 60 (B) 120 (C) 90 (D) none 4.In the Fig. given below, find Z.

Triangles. 3.In the following fig. AB = AC and BD = DC, then ADC = (A) 60 (B) 120 (C) 90 (D) none 4.In the Fig. given below, find Z. Triangles 1.Two sides of a triangle are 7 cm and 10 cm. Which of the following length can be the length of the third side? (A) 19 cm. (B) 17 cm. (C) 23 cm. of these. 2.Can 80, 75 and 20 form a triangle?

More information

State Math Contest Senior Exam SOLUTIONS

State Math Contest Senior Exam SOLUTIONS State Math Contest Senior Exam SOLUTIONS 1. The following pictures show two views of a non standard die (however the numbers 1-6 are represented on the die). How many dots are on the bottom face of figure?

More information

Histogram, cumulative frequency, frequency, 676 Horizontal number line, 6 Hypotenuse, 263, 301, 307

Histogram, cumulative frequency, frequency, 676 Horizontal number line, 6 Hypotenuse, 263, 301, 307 INDEX A Abscissa, 76 Absolute value, 6 7, 55 Absolute value function, 382 386 transformations of, reflection, 386 scaling, 386 translation, 385 386 Accuracy, 31 Acute angle, 249 Acute triangle, 263 Addition,

More information

2017 King s College Math Competition. Instructions

2017 King s College Math Competition. Instructions 017 King s College Math Competition King s College welcomes you to this year s mathematics competition and to our campus. We wish you success in this competition and in your future studies. Instructions

More information

Concurrency and Collinearity

Concurrency and Collinearity Concurrency and Collinearity Victoria Krakovna vkrakovna@gmail.com 1 Elementary Tools Here are some tips for concurrency and collinearity questions: 1. You can often restate a concurrency question as a

More information

1 Sets of real numbers

1 Sets of real numbers 1 Sets of real numbers Outline Sets of numbers, operations, functions Sets of natural, integer, rational and real numbers Operations with real numbers and their properties Representations of real numbers

More information

Lecture 10 (Submodular function)

Lecture 10 (Submodular function) Discrete Methods in Informatics January 16, 2006 Lecture 10 (Submodular function) Lecturer: Satoru Iwata Scribe: Masaru Iwasa and Yukie Nagai Submodular functions are the functions that frequently appear

More information

10! = ?

10! = ? AwesomeMath Team Contest 013 Solutions Problem 1. Define the value of a letter as its position in the alphabet. For example, C is the third letter, so its value is 3. The value of a word is the sum of

More information

1. Let g(x) and h(x) be polynomials with real coefficients such that

1. Let g(x) and h(x) be polynomials with real coefficients such that 1. Let g(x) and h(x) be polynomials with real coefficients such that g(x)(x 2 3x + 2) = h(x)(x 2 + 3x + 2) and f(x) = g(x)h(x) + (x 4 5x 2 + 4). Prove that f(x) has at least four real roots. 2. Let M be

More information

Karnaugh Map & Boolean Expression Simplification

Karnaugh Map & Boolean Expression Simplification Karnaugh Map & Boolean Expression Simplification Mapping a Standard POS Expression For a Standard POS expression, a 0 is placed in the cell corresponding to the product term (maxterm) present in the expression.

More information

CS273: Algorithms for Structure Handout # 2 and Motion in Biology Stanford University Thursday, 1 April 2004

CS273: Algorithms for Structure Handout # 2 and Motion in Biology Stanford University Thursday, 1 April 2004 CS273: Algorithms for Structure Handout # 2 and Motion in Biology Stanford University Thursday, 1 April 2004 Lecture #2: 1 April 2004 Topics: Kinematics : Concepts and Results Kinematics of Ligands and

More information

Geometry. Deformable Smooth Surface Design. H. Edelsbrunner. 1. Introduction

Geometry. Deformable Smooth Surface Design. H. Edelsbrunner. 1. Introduction Discrete Comput Geom 21:87 115 (1999) Discrete & Computational Geometry 1999 Springer-Verlag New York Inc. Deformable Smooth Surface Design H. Edelsbrunner Department of Computer Science, University of

More information

Commutative laws for addition and multiplication: If a and b are arbitrary real numbers then

Commutative laws for addition and multiplication: If a and b are arbitrary real numbers then Appendix C Prerequisites C.1 Properties of Real Numbers Algebraic Laws Commutative laws for addition and multiplication: If a and b are arbitrary real numbers then a + b = b + a, (C.1) ab = ba. (C.2) Associative

More information

81-E If set A = { 2, 3, 4, 5 } and set B = { 4, 5 }, then which of the following is a null set? (A) A B (B) B A (C) A U B (D) A I B.

81-E If set A = { 2, 3, 4, 5 } and set B = { 4, 5 }, then which of the following is a null set? (A) A B (B) B A (C) A U B (D) A I B. 81-E 2 General Instructions : i) The question-cum-answer booklet contains two Parts, Part A & Part B. ii) iii) iv) Part A consists of 60 questions and Part B consists of 16 questions. Space has been provided

More information

Important Instructions for the School Principal. (Not to be printed with the question paper)

Important Instructions for the School Principal. (Not to be printed with the question paper) Important Instructions for the School Principal (Not to be printed with the question paper) 1) This question paper is strictly meant for use in school based SA-II, March-2012 only. This question paper

More information

USAC Colloquium. Bending Polyhedra. Andrejs Treibergs. September 4, Figure 1: A Rigid Polyhedron. University of Utah

USAC Colloquium. Bending Polyhedra. Andrejs Treibergs. September 4, Figure 1: A Rigid Polyhedron. University of Utah USAC Colloquium Bending Polyhedra Andrejs Treibergs University of Utah September 4, 2013 Figure 1: A Rigid Polyhedron. 2. USAC Lecture: Bending Polyhedra The URL for these Beamer Slides: BendingPolyhedra

More information

Lesson 2B: Thales Theorem

Lesson 2B: Thales Theorem Lesson 2B: Thales Theorem Learning Targets o I can identify radius, diameter, chords, central circles, inscribed circles and semicircles o I can explain that an ABC is a right triangle, then A, B, and

More information