Technische Universität München Zentrum Mathematik

Size: px
Start display at page:

Download "Technische Universität München Zentrum Mathematik"

Transcription

1 Technische Universität München Zentrum Mathematik Prof. r. r. Jürgen Richter-ebert, ernhard Werner Projective eometry SS www-m.ma.tum.de/projektiveeometriess Solutions for Worksheet (--) Question. Moulton plane lasswork The so-called Moulton plane is an affine plane, in which esargues theorem does not hold everywhere. Its projective closure can be described as follows: P = P R L = L R x a y I b z c { ax + by + cz = if x z > and a b > ax + by + cz = otherwise a) Verify, that the special case in the incidence relation I only applies to points to the right of the y axis and lines with finite negative slope. b) Show that the incidence relation is well defined. c) reate a descriptive picture of this plane. d) escribe a process by which joining lines and points of intersection can be computed. e) Verify that this projective Moulton plane satisfies all the axioms of a projective plane. f) reate a construction which demonstrates that Pappos theorem is not generally true in this plane. g) reate a construction which demonstrates that esargues theorem is not generally true in this plane. Solution: a) or points one can argue like this: ür Punkte kann man so argumentieren: x z > x z z endlich x z > x z > x > with x being the x-coordinate of the dehomogenised point. or lines it is best to rewrite the its linear equation: = ax + by + c by = (ax + c) y = a b x c b a b > a b b a b > a b > a b <

2 b) Once again, well-defined means idenpendent from the choice of the representative. I.e.: pil (λp)i(µl) x z > λx λz = λ (x z) > a b > µa µb = µ (a b) > a x + b y + c z = µa λx + µb λy + µc λz = µλ(a x + b y + c z) = a x + b y + c z = µa λx + µb λy + µc λz = µλ( a x + b y + c z) = It is important, that the squares of real numbers are always positive. So the criterion for the different cases as well as the computations in each case are independent of the choice of the representatives. c) The best way to think of the points of the Moulton plane is to see them as the points of the ordinary projective plane. nd the lines reprsented by the set of points incident to them. Lines of non-negative slope behave like normal lines in the plane i.e. they have the same points as in RP. This also holds for vertical lines, i.e. lines with infinite slope. Lines with negative slope get bent when crossing the y-axis: To the right of the axis the slope increases by the factor. The following picture shoes points and all lines between them. x = d) irst, the algorithm to determine the Join of p = (x, y, z ) T and p = (x, y, z ) T. or that we build the subsidiary line (a, b, c ) T := p p. When it has (finite) negative slope, i.e. when a b >, one has to translate the points to the right of the y-axis to the place where they would lie on the subsidiary line. I.e. to te place they would have to be when then line has no bent. { x := x falls a b > und x z > x sonst { x := x falls a b > und x z > x sonst rom p := (x, y, z ) and p := (x, y, z ) one gets the Join. p p := p p. The same ansatz works for Meets: One starts with the intersection of the lines without bents. nd if it lies to the right of the y-axis, one has to rewrite the lines, such that the fit the doubled slope to the right of the y-axis. x a y := l l = b b z c c { a i := a i falls x z > und a i b i > a i sonst a a l l := b b c c a für i {, } The calculations above result in the zero vector if and only if the given points are linearly dependent. I.e. the result can always be interpreted as an geometric object for different input objects.

3 e) The methods above always lead to a unique result. onsidering this, Join and Meet are already uniquely defined. ut strictly speaking, we showed only their existence. In theory, there might be other objects, fulfiling the incidence relations, not found by the algorithm. oth cases, two distinct Joins of given points and two distince Meets of given lines, can be formulated and discussed in equivalent ways: ssume we have p, p P; l, l L so dass p Il, p Il, p Il, p Il To contradict this, a proof by cases comes in handy. W.l.o.g. we assume that x z x z and a b a b. all : x z x z. oth points on the left. No special cases, just ordinary linear equations. So the properties of RP hold and not all incidences can be fulfilled. eide Punkte links. eine Sonderbehandlung, sondern normale eradengelichungen. aher gelten igenschaften von RP, und es können nicht alle vier Inzidenzen gleichzeitig auftreten. all : a b a b. oth lines have non-begative slope. Nothing special, ordinary linear equations. all : < x z x z ; < a b a b. ll objects get a special treatment. One can multiply all x i by and gets the ordinary linear equation. all : x z < x z ; < a b a b. oth lines with negative slope, but points on different sides. Special treatment for p, but nor for p. Multiply x by to get the ordinary linear equation. all : < x z x z ; a b < a b. oth points on the right, but line slopes have different signs. Special treatment for l. Multiply a by to get the ordinary linear equation. all : x z < x z ; a b < a b ; z. Points on different sides, slopes of lines with different signs, points finite. Moulton line does not change the sign of its slope while crossing the y-axis. Whence, this signs can be computed from the difference of the dehomogenised y-coordinates: y z y z a b y z > y z a b > oth situations contradict the assumption of this case. all : x z = < x z ; a b < a b ; z =. One point at infinity and one on the right, lines with differently signed slopes. ere, the point at infinity determines the slope. x y a b x y < a b > So, we have shown, that no diefferent points can be incident to different lines. With the existence of Join and Meet, the first two axioms hold. s a projective base we can choose. The negative sign in the last point guarantees that the special case of the incidence relation need not be considered. To prove that these are in general position, we can thus deduce from the proof in for RP. f) It is remarkably hard to find a construct in which the theorem is cleary depicted as wrong. In particular, when starting with a given collinear points as a violated conclusion. It is easier to start with given concurrent lines. The easiest way is to use this concurrency in a corner of the theorem as the conclusion and using only one bent line with a very visible bent. The rest of the configuarion should be completely on one side of the y-axis, as otherwise further bent lines complicate things.

4 x = g) esargue s Theorem as well is best depicted with one set of non-concurrent lines one side as the violated conclusion and the rest of the theorem on the other. x = Question. Symmetries of the ano plane onsider the ano plane consisting of the lines (,, ), (,, ), (,, ), (,, ), (,, ), (,, ), (,, ) Imagine the depicted triangular grid to extend infinitely in all directions.

5 a) nter the numbers... into the circles of the triangular grid in such a way that every yellow triangle corresponds to one line of the ano plane. urthermore, all diamonds should contain the same pattern of numbers, so they are related by a translation. very number should appear in every diamond exactly once. b) escribe several automorphisms τ of the ano plane which satisfy the equation τ = id. lso describe several automorphisms satisfying τ = id. c) What is the cardinality of the group of automorphisms of the ano plane? an you explain this number using the structure of the triangular grid? In order to answer this question, recall the arbitrary choices you made while filling in the triangular grid. Solution: a) You can see an appropriate pattern on the right. The was placed arbitralrily in the center of the diamond and the in one of the neighbouring fields. This determines the place of the. or the there are free circles inside the diamond and it fixes the position of the. The rest is then determined as well. The above the follows from the symmetry requirement. nd together they fix the. b) long the lines building the edges of the yellow triangles, every number occurs with period : efore one number occurs again, every other was entered into one of the circles. translation along these lines represents thus an automorphism whose seventh power is the identity. xamples for such permutations (in cycle notation) are: ( ) ( ) ( ) symmetry of order is given by the rotation by. s a center one can use either a circle or the center of one of the (yellow or white) triangles. The following examples are constructed by choosing the first cycle as the center of rotation and mapping the other numbers accordingly: ()( )( ) ( )( )() ( )( )() c) The number of automorphisms correspond to the number of labelings of the triangle lattice compliant to the combinatorics of the ano plane: The yellow triangles are the structure which has to be kept intact. nd the periodicity assures that mapping the labeling within one diamond to another is well-defined. There are ways to place the within the diamond and neighbouring cirlces for the or neighbouring triangles for the whole line and ways to orientate it. This leaves places for the to be. The rest is then determined. The total number is thus = 8. This matches the possible ways to choose points in the ano plane in general position, to use them as a projective base.

6 omework Question. 9 configurations (n r, n r ) configuration is often simply called a n r configuration. ere you see several drawings of 9 configurations. () () () () () () () (8) (9) a) Identify which of these images represent isomorphic incidence structures. Label the points in such a way that for isomorphic configurations, the labels of all collinear triples of points agree, so that the isomorphism is reafily apparent. Most of the subsequent subtasks can be addressed for all isomorphic configurations at once. b) hoose one of the given configurations which is not isomorphic to Pappos theorem. Try to reproduce this drawing (without measuring the original). Which parameters can be chosen arbitrarily during that process? c) onsider how you could compute coordinates for the points in the drawing you just created (or at least tried to create). d) or every configuration, determine the dual incidence structure, and decide which of the depicted primal configurations are isomorphic to that. Support this claimed isomorphism by labeling the lines of the original in a suitable way.

7 e) onstruct additional 9 configurations and investigate, which of the depicted configurations are isomporphic to yours. Solution: valuable tool to analyse such 9 -configuration is the not-adjacent-relation. It indicates which points are not next to each other. There are exactly points not-adjacent to a given point, as through every point run exactly lines and on every line there are additional points. One can use the non-adjacency to run through the graphs. eginning at an arbitrary point there are exactly two neighbours to go to. fter deciding for one (and actually gong there) only point is left, which was not already visited. This way, one can go through the graph until the return to the starting point. (graph-theoretical, not geometrical) circle is formed, containing at least some points of the graph. If some points were omitted, they can serve as starting points for new circles. a) The number of circles gained from the above heuristic is an invariant of the incidence structure it is independent from the embedding into the plane. So, if two graphs have a different number of cirlces, they cannot be isomorphic. aution: The opposite is, in general, false. raphs with the same number of circles need not be isomorphic. Only with the additional knowledge gained e.g. from books that there are only combinatorically different 9 -configuration and that they have different circle number one can use this number as a feature for classification. One can use the non-adjacency also for finding equivalent labelings. Though it is not enough to look at the circles alone. ut this, at least, limits the number of labelings one has to check. In total, there are the following classes, distinct by their circle numbers. Within the classes one can find equivalent labelings, like the ones given below.

8 circles with points each. This is the configuration of Pappos Theorem. () () ircles: ollinear triples of points: circle with 9 points. () (8) (), ( ), (),,,,,,,, ircles: ollinear triples of points: () () ( ),,,,,,,, 8

9 circle with and points, respectively. (9) () () ircles: ollinear triples of points: ( ), (),,,,,,,, b) In general, such a drawing will not work. Other than Pappos Theorem, the remaining 9 -configurations are no incindence-geometrical theorems. That means, that the last incidence drawn will not automattically be fulfilled. It works only for special starting positions. good example is configuration (). Starting with an equilateral triangle on the outside an positioning the corners of the middle triangle at the centers of the outside edges there is still one corner of the innermost triangle which can be choosen freely. nd only afterwards it will become cleaer whether this choice lead to a correct incidence structure. c) or the case above in configuration () one work with barycentric coordinates (i.e. in the drawing plane embedded in x + y + z = ): = = = = = = 9

10 = x x x = ( ) ( ) = x = x x x x x = ( ) ( ) = x = x x x x = ( ) ( ) = = x x x + (x )! = x x = x x, = ± So there are possibilities for to make a working configuration. d) The structures are all dual to themselves. One way to see this, is to specify a symmetric incidence matrix as dualising just means transposing this matrix. circle: a b c d e f g h k circles: a b c d e f g h k circles: a b c d e f g h k

11 aution: The existence of a symmetric incidence matrix is only a sufficient condition for an incidence structure to be self-dual. ut it is not clear that any self-dual configuration can be written as a symmetric incidence matrix. e) ombinatorically, there are only three different 9 -configurations. very configuration found can be assigned to one of the classes above by counting its circles. Question. initely Pappos a) What is the smalles finite projective plane in which a non-degenerate instance of Pappos theorem can be realized, and in which this theorem is generally true? b) reate a sketch of the corresponding projective plane, and in that emphasize one instance of the theorem. c) lso create a sketch of this theorem in RP. Label the points in both sketches correspondingly, so that the common combinatorics become clear. Solution: a) s Pappos Theorem needs 9 points, the ano plane only allows degenerated version of the theorem. Since Pappos Theorem holds in every projective plane constructed from a field, the plane P is the smallest plane in which the theorem appears in a non-degenerated way and in which it holds universally. That it holds follows from the the fact, that the algebraic proof from the lecture works over every field. b) The eassiest way is to start with the (known) depiction of of the plane P and marking an instance of the theorem in it. c) When using the same labels for corresponding points, it becomes clear the points in the middle line of the finite depiction appear reordered. That is an artefact from the embedding the combinatorics, i.e. the incidences, are all that matter.

12 Question. ollineations iven the following points in P : = = = = = i a) ind a projective transformation, which fixes the points, and and maps onto. Write down a function τ a : P P which describes the effect of this transformation for the points of the plane. b) ind a collineation which is not a projective transformation but still maps the points as stated above. escribe this second operation using a function τ b : P P c) onsider both the collineations you obtained in the previous subtasks, and apply each of them to the point = (i,, ) T. ompare the results. d) emonstrate that the map τ b is well defined. Solution: a) We want a matrix M fulfilling the following equations: M = α M = β M = γ M = δ s a scalar in front of the matrix does not alter the projective geometric interpretation of the matrix as a map, on of the scalars in the equations can be choosen arbitrarily, e.g. δ =. s of the pre-images are already unit vectors, the respective columns of M have to be the images of these unit vectors. With the fourth point we get the following linear system: α β = i γ α β = i γ Mit diesen Vorfaktoren ist die bbildungsmatrix bestimmt als amit ergibt sich die geforderte unktion als M = i τ a : p M p b) Mapping a number to its complex conjugate is an automorphism of. nd conjugating all entries of a vector cannot be described by a projective map. So we want a map gained from a matrix proudct after conjugating and still fulfilling the following equations: M Ā = α M = β M = γ M = δ s the pre-images are all real and the images do not get conjugated, the matrix M is the same as above. This results in the function τ b : p M p

13 c) Inserting the point yields i i τ a () = M = M =, i i τ b () = M Ē = M =. oth images really lie in different equivalence classes. s the projective map τ a was fully characterised by the pairs of pre-image and image points, τ b indeed cannot be a projective transformation. d) To show that τ b is well-defined we have to establish that the equivalence class of τ b ([p]) is independent from the representative of [p]. So let λp be a generic representative of the equivalence class [p]. Then we have τ b (λp) = M (λp) = M ( λ p) = λ(m p) = λ τ b (p) [τ b (p)]

Technische Universität München Zentrum Mathematik

Technische Universität München Zentrum Mathematik Technische Universität München Zentrum Mathematik Prof. r. r. Jürgen Richter-ebert, ernhard Werner Projective eometry SS 8 https://www-m.ma.tum.de/bin/view/lehre/ss8/pss8/webome Solutions for Worksheet

More information

Technische Universität München Zentrum Mathematik

Technische Universität München Zentrum Mathematik Question 1. Incidence matrix with gaps Technische Universität München Zentrum Mathematik Prof. Dr. Dr. Jürgen Richter-Gebert, Bernhard Werner Projective Geometry SS 2016 www-m10.ma.tum.de/projektivegeometriess16

More information

Technische Universität München Zentrum Mathematik

Technische Universität München Zentrum Mathematik Technische Universität München Zentrum Mathematik Prof. Dr. Dr. Jürgen Richter-Gebert, Bernhard Werner Projective Geometry SS 208 https://www-m0.ma.tum.de/bin/view/lehre/ss8/pgss8/webhome Solutions for

More information

MAT 3271: Selected Solutions to the Assignment 6

MAT 3271: Selected Solutions to the Assignment 6 Chapter 2: Major Exercises MAT 3271: Selected Solutions to the Assignment 6 1. Since a projective plan is a model of incidence geometry, Incidence Axioms 1-3 and Propositions 2.1-2.5 (which follow logically

More information

Technische Universität München Zentrum Mathematik

Technische Universität München Zentrum Mathematik Technische Universität München Zentrum Mathematik Prof. Dr. Dr. Jürgen Richter-Gebert, Bernhard Werner Projective Geometry SS 28 https://www-m.ma.tum.de/bin/view/lehre/ss8/pgss8/webhome Solutions for Worksheet

More information

TECHNISCHE UNIVERSITÄT BERLIN WS2005 Fachbereich 3 - Mathematik Prof. Dr. U. Pinkall / Charles Gunn Abgabe:

TECHNISCHE UNIVERSITÄT BERLIN WS2005 Fachbereich 3 - Mathematik Prof. Dr. U. Pinkall / Charles Gunn Abgabe: TECHNISCHE UNIVERSITÄT BERLIN WS2005 Fachbereich 3 - Mathematik Prof. Dr. U. Pinkall / Charles Gunn Abgabe: 27.10.2005 1. Übung Geometrie I (Lines in P 2 (R), Separation, Desargues) 1. Aufgabe Line equations

More information

Parallel and perspective projections such as used in representing 3d images.

Parallel and perspective projections such as used in representing 3d images. Chapter 5 Rotations and projections In this chapter we discuss Rotations Parallel and perspective projections such as used in representing 3d images. Using coordinates and matrices, parallel projections

More information

Basic Euclidean Geometry

Basic Euclidean Geometry hapter 1 asic Euclidean Geometry This chapter is not intended to be a complete survey of basic Euclidean Geometry, but rather a review for those who have previously taken a geometry course For a definitive

More information

EXTREME POINTS AND AFFINE EQUIVALENCE

EXTREME POINTS AND AFFINE EQUIVALENCE EXTREME POINTS AND AFFINE EQUIVALENCE The purpose of this note is to use the notions of extreme points and affine transformations which are studied in the file affine-convex.pdf to prove that certain standard

More information

Part II. Working and Playing with Geometry

Part II. Working and Playing with Geometry Part II Working and Playing with Geometry 129 Need to play is the mother of all invention. Kristina Brenneman, Portland Tribune, 2005 So far we have prepared a solid basis for projective geometry with

More information

CS-9645 Introduction to Computer Vision Techniques Winter 2019

CS-9645 Introduction to Computer Vision Techniques Winter 2019 Table of Contents Projective Geometry... 1 Definitions...1 Axioms of Projective Geometry... Ideal Points...3 Geometric Interpretation... 3 Fundamental Transformations of Projective Geometry... 4 The D

More information

Projective geometry and the extended Euclidean plane

Projective geometry and the extended Euclidean plane Chapter 2 Projective geometry and the extended Euclidean plane Math 4520, Fall 2017 As we can see from Hilbert s treatment, a completely worked out axiom system for geometry in the plane is quite complicated.

More information

2.1 Angles, Lines and Parallels & 2.2 Congruent Triangles and Pasch s Axiom

2.1 Angles, Lines and Parallels & 2.2 Congruent Triangles and Pasch s Axiom 2 Euclidean Geometry In the previous section we gave a sketch overview of the early parts of Euclid s Elements. While the Elements set the standard for the modern axiomatic approach to mathematics, it

More information

2 Solution of Homework

2 Solution of Homework Math 3181 Name: Dr. Franz Rothe February 6, 2014 All3181\3181_spr14h2.tex Homework has to be turned in this handout. The homework can be done in groups up to three due February 11/12 2 Solution of Homework

More information

ON THE STRONGLY REGULAR GRAPH OF PARAMETERS

ON THE STRONGLY REGULAR GRAPH OF PARAMETERS ON THE STRONGLY REGULAR GRAPH OF PARAMETERS (99, 14, 1, 2) SUZY LOU AND MAX MURIN Abstract. In an attempt to find a strongly regular graph of parameters (99, 14, 1, 2) or to disprove its existence, we

More information

2 Geometry Solutions

2 Geometry Solutions 2 Geometry Solutions jacques@ucsd.edu Here is give problems and solutions in increasing order of difficulty. 2.1 Easier problems Problem 1. What is the minimum number of hyperplanar slices to make a d-dimensional

More information

Math 462: Review questions

Math 462: Review questions Math 462: Review questions Paul Hacking 4/22/10 (1) What is the angle between two interior diagonals of a cube joining opposite vertices? [Hint: It is probably quickest to use a description of the cube

More information

1 Affine and Projective Coordinate Notation

1 Affine and Projective Coordinate Notation CS348a: Computer Graphics Handout #9 Geometric Modeling Original Handout #9 Stanford University Tuesday, 3 November 992 Original Lecture #2: 6 October 992 Topics: Coordinates and Transformations Scribe:

More information

Lecture 2 - Introduction to Polytopes

Lecture 2 - Introduction to Polytopes Lecture 2 - Introduction to Polytopes Optimization and Approximation - ENS M1 Nicolas Bousquet 1 Reminder of Linear Algebra definitions Let x 1,..., x m be points in R n and λ 1,..., λ m be real numbers.

More information

Part I. Projective Geometry

Part I. Projective Geometry Part I Projective Geometry 1 Pappus s Theorem: Nine proofs and three variations ees, then, know just this fact which is of service to themselves, that the hexagon is greater than the square and the triangle

More information

Geometric transformations assign a point to a point, so it is a point valued function of points. Geometric transformation may destroy the equation

Geometric transformations assign a point to a point, so it is a point valued function of points. Geometric transformation may destroy the equation Geometric transformations assign a point to a point, so it is a point valued function of points. Geometric transformation may destroy the equation and the type of an object. Even simple scaling turns a

More information

Laguerre Planes: A Basic Introduction

Laguerre Planes: A Basic Introduction Laguerre Planes: A Basic Introduction Tam Knox Spring 2009 1 1 Introduction Like a projective plane, a Laguerre plane is a type of incidence structure, defined in terms of sets of elements and an incidence

More information

A GENTLE INTRODUCTION TO THE BASIC CONCEPTS OF SHAPE SPACE AND SHAPE STATISTICS

A GENTLE INTRODUCTION TO THE BASIC CONCEPTS OF SHAPE SPACE AND SHAPE STATISTICS A GENTLE INTRODUCTION TO THE BASIC CONCEPTS OF SHAPE SPACE AND SHAPE STATISTICS HEMANT D. TAGARE. Introduction. Shape is a prominent visual feature in many images. Unfortunately, the mathematical theory

More information

Mathematical and Algorithmic Foundations Linear Programming and Matchings

Mathematical and Algorithmic Foundations Linear Programming and Matchings Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis

More information

Product constructions for transitive decompositions of graphs

Product constructions for transitive decompositions of graphs 116 Product constructions for transitive decompositions of graphs Geoffrey Pearce Abstract A decomposition of a graph is a partition of the edge set, giving a set of subgraphs. A transitive decomposition

More information

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material

More information

Inversive Plane Geometry

Inversive Plane Geometry Inversive Plane Geometry An inversive plane is a geometry with three undefined notions: points, circles, and an incidence relation between points and circles, satisfying the following three axioms: (I.1)

More information

Test 1, Spring 2013 ( Solutions): Provided by Jeff Collins and Anil Patel. 1. Axioms for a finite AFFINE plane of order n.

Test 1, Spring 2013 ( Solutions): Provided by Jeff Collins and Anil Patel. 1. Axioms for a finite AFFINE plane of order n. Math 532, 736I: Modern Geometry Test 1, Spring 2013 ( Solutions): Provided by Jeff Collins and Anil Patel Part 1: 1. Axioms for a finite AFFINE plane of order n. AA1: There exist at least 4 points, no

More information

Chapter 15 Introduction to Linear Programming

Chapter 15 Introduction to Linear Programming Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of

More information

Robot Vision: Projective Geometry

Robot Vision: Projective Geometry Robot Vision: Projective Geometry Ass.Prof. Friedrich Fraundorfer SS 2018 1 Learning goals Understand homogeneous coordinates Understand points, line, plane parameters and interpret them geometrically

More information

Lecture notes on the simplex method September We will present an algorithm to solve linear programs of the form. maximize.

Lecture notes on the simplex method September We will present an algorithm to solve linear programs of the form. maximize. Cornell University, Fall 2017 CS 6820: Algorithms Lecture notes on the simplex method September 2017 1 The Simplex Method We will present an algorithm to solve linear programs of the form maximize subject

More information

The angle measure at for example the vertex A is denoted by m A, or m BAC.

The angle measure at for example the vertex A is denoted by m A, or m BAC. MT 200 ourse notes on Geometry 5 2. Triangles and congruence of triangles 2.1. asic measurements. Three distinct lines, a, b and c, no two of which are parallel, form a triangle. That is, they divide the

More information

Parameterization of triangular meshes

Parameterization of triangular meshes Parameterization of triangular meshes Michael S. Floater November 10, 2009 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to

More information

Topics in geometry Exam 1 Solutions 7/8/4

Topics in geometry Exam 1 Solutions 7/8/4 Topics in geometry Exam 1 Solutions 7/8/4 Question 1 Consider the following axioms for a geometry: There are exactly five points. There are exactly five lines. Each point lies on exactly three lines. Each

More information

the projective completion of the affine plane with four points

the projective completion of the affine plane with four points Math 3181 Dr. Franz Rothe November 23, 20 1 Test Name: 50 Problem 1.1. Here are once more: a highly symmetric illustration for the Fano plane based on an equilateral triangle the projective completion

More information

Numerical Optimization

Numerical Optimization Convex Sets Computer Science and Automation Indian Institute of Science Bangalore 560 012, India. NPTEL Course on Let x 1, x 2 R n, x 1 x 2. Line and line segment Line passing through x 1 and x 2 : {y

More information

This blog addresses the question: how do we determine the intersection of two circles in the Cartesian plane?

This blog addresses the question: how do we determine the intersection of two circles in the Cartesian plane? Intersecting Circles This blog addresses the question: how do we determine the intersection of two circles in the Cartesian plane? This is a problem that a programmer might have to solve, for example,

More information

Division of the Humanities and Social Sciences. Convex Analysis and Economic Theory Winter Separation theorems

Division of the Humanities and Social Sciences. Convex Analysis and Economic Theory Winter Separation theorems Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Topic 8: Separation theorems 8.1 Hyperplanes and half spaces Recall that a hyperplane in

More information

An Investigation of the Planarity Condition of Grötzsch s Theorem

An Investigation of the Planarity Condition of Grötzsch s Theorem Le Chen An Investigation of the Planarity Condition of Grötzsch s Theorem The University of Chicago: VIGRE REU 2007 July 16, 2007 Abstract The idea for this paper originated from Professor László Babai

More information

Construction of planar triangulations with minimum degree 5

Construction of planar triangulations with minimum degree 5 Construction of planar triangulations with minimum degree 5 G. Brinkmann Fakultät für Mathematik Universität Bielefeld D 33501 Bielefeld, Germany gunnar@mathematik.uni-bielefeld.de Brendan D. McKay Department

More information

Exercises for Chapter Three You know you've got to exercise your brain just like your muscles. Will Rogers ( )

Exercises for Chapter Three You know you've got to exercise your brain just like your muscles. Will Rogers ( ) Exercises for Chapter Three You know you've got to exercise your brain just like your muscles. Will Rogers (1879 1935) Investigation Exercise 3.1. (a) Construct a tessellation. (Directions for construction.)

More information

Line Arrangement. Chapter 6

Line Arrangement. Chapter 6 Line Arrangement Chapter 6 Line Arrangement Problem: Given a set L of n lines in the plane, compute their arrangement which is a planar subdivision. Line Arrangements Problem: Given a set L of n lines

More information

The Graphs of Triangulations of Polygons

The Graphs of Triangulations of Polygons The Graphs of Triangulations of Polygons Matthew O Meara Research Experience for Undergraduates Summer 006 Basic Considerations Let Γ(n) be the graph with vertices being the labeled planar triangulation

More information

The Gewirtz Graph Morgan J. Rodgers Design Theory Fall 2007

The Gewirtz Graph Morgan J. Rodgers Design Theory Fall 2007 The Gewirtz Graph Morgan J. Rodgers Design Theory Fall 2007 The Gewirtz Graph is the unique strongly regular graph having parameters (56, 10, 0, 2). We will call this graph Γ. This graph was actually discovered

More information

The Three Dimensional Coordinate System

The Three Dimensional Coordinate System The Three-Dimensional Coordinate System The Three Dimensional Coordinate System You can construct a three-dimensional coordinate system by passing a z-axis perpendicular to both the x- and y-axes at the

More information

3.3 Optimizing Functions of Several Variables 3.4 Lagrange Multipliers

3.3 Optimizing Functions of Several Variables 3.4 Lagrange Multipliers 3.3 Optimizing Functions of Several Variables 3.4 Lagrange Multipliers Prof. Tesler Math 20C Fall 2018 Prof. Tesler 3.3 3.4 Optimization Math 20C / Fall 2018 1 / 56 Optimizing y = f (x) In Math 20A, we

More information

Interpretations and Models. Chapter Axiomatic Systems and Incidence Geometry

Interpretations and Models. Chapter Axiomatic Systems and Incidence Geometry Interpretations and Models Chapter 2.1-2.4 - Axiomatic Systems and Incidence Geometry Axiomatic Systems in Mathematics The gold standard for rigor in an area of mathematics Not fully achieved in most areas

More information

Unit Circle. Project Response Sheet

Unit Circle. Project Response Sheet NAME: PROJECT ACTIVITY: Trigonometry TOPIC Unit Circle GOALS MATERIALS Explore Degree and Radian Measure Explore x- and y- coordinates on the Unit Circle Investigate Odd and Even functions Investigate

More information

Lecture 2 September 3

Lecture 2 September 3 EE 381V: Large Scale Optimization Fall 2012 Lecture 2 September 3 Lecturer: Caramanis & Sanghavi Scribe: Hongbo Si, Qiaoyang Ye 2.1 Overview of the last Lecture The focus of the last lecture was to give

More information

Substituting a 2 b 2 for c 2 and using a little algebra, we can then derive the standard equation for an ellipse centred at the origin,

Substituting a 2 b 2 for c 2 and using a little algebra, we can then derive the standard equation for an ellipse centred at the origin, Conics onic sections are the curves which result from the intersection of a plane with a cone. These curves were studied and revered by the ancient Greeks, and were written about extensively by both Euclid

More information

POLYHEDRAL GEOMETRY. Convex functions and sets. Mathematical Programming Niels Lauritzen Recall that a subset C R n is convex if

POLYHEDRAL GEOMETRY. Convex functions and sets. Mathematical Programming Niels Lauritzen Recall that a subset C R n is convex if POLYHEDRAL GEOMETRY Mathematical Programming Niels Lauritzen 7.9.2007 Convex functions and sets Recall that a subset C R n is convex if {λx + (1 λ)y 0 λ 1} C for every x, y C and 0 λ 1. A function f :

More information

Math 102A Hw 3 P a (2 points)

Math 102A Hw 3 P a (2 points) Math 102 Hw 3 P.93 12 a (2 points) If any pair of these lines are equal, the conclusion is immediate, so assume that we have three distinct lines such that l m and m n. Suppose, on the contrary, that l

More information

6th Bay Area Mathematical Olympiad

6th Bay Area Mathematical Olympiad 6th Bay Area Mathematical Olympiad February 4, 004 Problems and Solutions 1 A tiling of the plane with polygons consists of placing the polygons in the plane so that interiors of polygons do not overlap,

More information

1 Solution of Homework I

1 Solution of Homework I Math 3181 Dr. Franz Rothe Name: All3181\3181_spr13h1.tex 1 Solution of Homework I 10 Problem 1.1. As far as two-dimensional geometry is concerned, Hilbert s Proposition 1 reduces to one simple statement:

More information

Geometry. Every Simplicial Polytope with at Most d + 4 Vertices Is a Quotient of a Neighborly Polytope. U. H. Kortenkamp. 1.

Geometry. Every Simplicial Polytope with at Most d + 4 Vertices Is a Quotient of a Neighborly Polytope. U. H. Kortenkamp. 1. Discrete Comput Geom 18:455 462 (1997) Discrete & Computational Geometry 1997 Springer-Verlag New York Inc. Every Simplicial Polytope with at Most d + 4 Vertices Is a Quotient of a Neighborly Polytope

More information

Error-Correcting Codes

Error-Correcting Codes Error-Correcting Codes Michael Mo 10770518 6 February 2016 Abstract An introduction to error-correcting codes will be given by discussing a class of error-correcting codes, called linear block codes. The

More information

Notes and Answers to Homework Exam 1, Geometric Algorithms, 2017

Notes and Answers to Homework Exam 1, Geometric Algorithms, 2017 Notes and Answers to Homework Exam 1, Geometric Algorithms, 2017 Below are some notes and sketches of correct answers for the first homework exam. We have also included the most common mistakes that were

More information

Lecture 3A: Generalized associahedra

Lecture 3A: Generalized associahedra Lecture 3A: Generalized associahedra Nathan Reading NC State University Cluster Algebras and Cluster Combinatorics MSRI Summer Graduate Workshop, August 2011 Introduction Associahedron and cyclohedron

More information

Name: Rational Functions 2.1H. Set Topic: Simplifying rational expressions & operations on rational expressions

Name: Rational Functions 2.1H. Set Topic: Simplifying rational expressions & operations on rational expressions Name: Rational Functions 2.1H Ready, Set, Go! Ready Topic: Polynomial division Use division to determine if the given linear term is a factor of the polynomial. If it is a linear factor, then find the

More information

Graph Theory Questions from Past Papers

Graph Theory Questions from Past Papers Graph Theory Questions from Past Papers Bilkent University, Laurence Barker, 19 October 2017 Do not forget to justify your answers in terms which could be understood by people who know the background theory

More information

Parameterized Complexity of Independence and Domination on Geometric Graphs

Parameterized Complexity of Independence and Domination on Geometric Graphs Parameterized Complexity of Independence and Domination on Geometric Graphs Dániel Marx Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany. dmarx@informatik.hu-berlin.de

More information

LECTURE 1 Basic definitions, the intersection poset and the characteristic polynomial

LECTURE 1 Basic definitions, the intersection poset and the characteristic polynomial R. STANLEY, HYPERPLANE ARRANGEMENTS LECTURE Basic definitions, the intersection poset and the characteristic polynomial.. Basic definitions The following notation is used throughout for certain sets of

More information

arxiv: v1 [math.co] 4 Sep 2017

arxiv: v1 [math.co] 4 Sep 2017 Abstract Maximal chord diagrams up to all isomorphisms are enumerated. The enumerating formula is based on a bijection between rooted one-vertex one-face maps on locally orientable surfaces andacertain

More information

ADDITION LAW ON ELLIPTIC CURVES

ADDITION LAW ON ELLIPTIC CURVES ADDITION LAW ON ELLIPTIC CURVES JORDAN HISEL Abstract. This paper will explore projective spaces and elliptic curves. Addition on elliptic curves is rather unintuitive, but with a rigorous definition,

More information

College of Computer & Information Science Fall 2007 Northeastern University 14 September 2007

College of Computer & Information Science Fall 2007 Northeastern University 14 September 2007 College of Computer & Information Science Fall 2007 Northeastern University 14 September 2007 CS G399: Algorithmic Power Tools I Scribe: Eric Robinson Lecture Outline: Linear Programming: Vertex Definitions

More information

Each point P in the xy-plane corresponds to an ordered pair (x, y) of real numbers called the coordinates of P.

Each point P in the xy-plane corresponds to an ordered pair (x, y) of real numbers called the coordinates of P. Lecture 7, Part I: Section 1.1 Rectangular Coordinates Rectangular or Cartesian coordinate system Pythagorean theorem Distance formula Midpoint formula Lecture 7, Part II: Section 1.2 Graph of Equations

More information

Multiple View Geometry in Computer Vision

Multiple View Geometry in Computer Vision Multiple View Geometry in Computer Vision Prasanna Sahoo Department of Mathematics University of Louisville 1 Projective 3D Geometry (Back to Chapter 2) Lecture 6 2 Singular Value Decomposition Given a

More information

The Helly Number of the Prime-coordinate Point Set

The Helly Number of the Prime-coordinate Point Set The Helly Number of the Prime-coordinate Point Set By KEVIN BARRETT SUMMERS SENIOR THESIS Submitted in partial satisfaction of the requirements for Highest Honors for the degree of BACHELOR OF SCIENCE

More information

1. Lecture notes on bipartite matching

1. Lecture notes on bipartite matching Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans February 5, 2017 1. Lecture notes on bipartite matching Matching problems are among the fundamental problems in

More information

(Refer Slide Time: 00:02:02)

(Refer Slide Time: 00:02:02) Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 20 Clipping: Lines and Polygons Hello and welcome everybody to the lecture

More information

UNM - PNM STATEWIDE MATHEMATICS CONTEST XLI. February 7, 2009 Second Round Three Hours

UNM - PNM STATEWIDE MATHEMATICS CONTEST XLI. February 7, 2009 Second Round Three Hours UNM - PNM STATEWIDE MATHEMATICS CONTEST XLI February 7, 009 Second Round Three Hours (1) An equilateral triangle is inscribed in a circle which is circumscribed by a square. This square is inscribed in

More information

1. Lecture notes on bipartite matching February 4th,

1. Lecture notes on bipartite matching February 4th, 1. Lecture notes on bipartite matching February 4th, 2015 6 1.1.1 Hall s Theorem Hall s theorem gives a necessary and sufficient condition for a bipartite graph to have a matching which saturates (or matches)

More information

Technische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik. Combinatorial Optimization (MA 4502)

Technische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik. Combinatorial Optimization (MA 4502) Technische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik Combinatorial Optimization (MA 4502) Dr. Michael Ritter Problem Sheet 4 Homework Problems Problem

More information

LECTURE 13, THURSDAY APRIL 1, 2004

LECTURE 13, THURSDAY APRIL 1, 2004 LECTURE 13, THURSDAY APRIL 1, 2004 FRANZ LEMMERMEYER 1. Parametrizing Curves of Genus 0 As a special case of the theorem that curves of genus 0, in particular those with the maximal number of double points,

More information

Two-graphs revisited. Peter J. Cameron University of St Andrews Modern Trends in Algebraic Graph Theory Villanova, June 2014

Two-graphs revisited. Peter J. Cameron University of St Andrews Modern Trends in Algebraic Graph Theory Villanova, June 2014 Two-graphs revisited Peter J. Cameron University of St Andrews Modern Trends in Algebraic Graph Theory Villanova, June 2014 History The icosahedron has six diagonals, any two making the same angle (arccos(1/

More information

Projective planes. Möge diese Büchlein dazu beitragen dies schöne Gebiet über die Jahrhunderte zu retten. Blaschke, Projektive Geometrie 1949

Projective planes. Möge diese Büchlein dazu beitragen dies schöne Gebiet über die Jahrhunderte zu retten. Blaschke, Projektive Geometrie 1949 2 Projective planes Möge diese Büchlein dazu beitragen dies schöne Gebiet über die Jahrhunderte zu retten. Blaschke, Projektive Geometrie 1949 The basis of all investigations in this book will be projective

More information

Definition 2 (Projective plane). A projective plane is a class of points, and a class of lines satisfying the axioms:

Definition 2 (Projective plane). A projective plane is a class of points, and a class of lines satisfying the axioms: Math 3181 Name: Dr. Franz Rothe January 30, 2014 All3181\3181_spr14h2.tex Homework has to be turned in this handout. The homework can be done in groups up to three due February 11/12 2 Homework 1 Definition

More information

ORIE 6300 Mathematical Programming I September 2, Lecture 3

ORIE 6300 Mathematical Programming I September 2, Lecture 3 ORIE 6300 Mathematical Programming I September 2, 2014 Lecturer: David P. Williamson Lecture 3 Scribe: Divya Singhvi Last time we discussed how to take dual of an LP in two different ways. Today we will

More information

On Some Elementary Properties of Quadrilaterals

On Some Elementary Properties of Quadrilaterals Forum eometricorum Volume 17 (2017) 473 482. FRUM EM SSN 1534-1178 n Some Elementary Properties of Quadrilaterals Paris Pamfilos bstract. We study some elementary properties of convex quadrilaterals related

More information

SECTION 1.3: BASIC GRAPHS and SYMMETRY

SECTION 1.3: BASIC GRAPHS and SYMMETRY (Section.3: Basic Graphs and Symmetry).3. SECTION.3: BASIC GRAPHS and SYMMETRY LEARNING OBJECTIVES Know how to graph basic functions. Organize categories of basic graphs and recognize common properties,

More information

3D Computer Vision II. Reminder Projective Geometry, Transformations

3D Computer Vision II. Reminder Projective Geometry, Transformations 3D Computer Vision II Reminder Projective Geometry, Transformations Nassir Navab" based on a course given at UNC by Marc Pollefeys & the book Multiple View Geometry by Hartley & Zisserman" October 21,

More information

Applied Lagrange Duality for Constrained Optimization

Applied Lagrange Duality for Constrained Optimization Applied Lagrange Duality for Constrained Optimization Robert M. Freund February 10, 2004 c 2004 Massachusetts Institute of Technology. 1 1 Overview The Practical Importance of Duality Review of Convexity

More information

Pantographic polygons

Pantographic polygons 203 Pantographic polygons John Miller and Emanuel Strzelecki Abstract Necessary and sufficient conditions are given for a polygon to be pantographic. The property is held by all regular polygons and by

More information

Cluster algebras and infinite associahedra

Cluster algebras and infinite associahedra Cluster algebras and infinite associahedra Nathan Reading NC State University CombinaTexas 2008 Coxeter groups Associahedra and cluster algebras Sortable elements/cambrian fans Infinite type Much of the

More information

WHAT YOU SHOULD LEARN

WHAT YOU SHOULD LEARN GRAPHS OF EQUATIONS WHAT YOU SHOULD LEARN Sketch graphs of equations. Find x- and y-intercepts of graphs of equations. Use symmetry to sketch graphs of equations. Find equations of and sketch graphs of

More information

Stereo Vision. MAN-522 Computer Vision

Stereo Vision. MAN-522 Computer Vision Stereo Vision MAN-522 Computer Vision What is the goal of stereo vision? The recovery of the 3D structure of a scene using two or more images of the 3D scene, each acquired from a different viewpoint in

More information

Mathematical Programming and Research Methods (Part II)

Mathematical Programming and Research Methods (Part II) Mathematical Programming and Research Methods (Part II) 4. Convexity and Optimization Massimiliano Pontil (based on previous lecture by Andreas Argyriou) 1 Today s Plan Convex sets and functions Types

More information

The University of Sydney MATH2008 Introduction to Modern Algebra

The University of Sydney MATH2008 Introduction to Modern Algebra 2 Semester 2, 2003 The University of Sydney MATH2008 Introduction to Modern Algebra (http://www.maths.usyd.edu.au/u/ug/im/math2008/) Lecturer: R. Howlett Computer Tutorial 2 This tutorial explores the

More information

Lecture 3: Some Strange Properties of Fractal Curves

Lecture 3: Some Strange Properties of Fractal Curves Lecture 3: Some Strange Properties of Fractal Curves I have been a stranger in a strange land. Exodus 2:22 1. Fractal Strangeness Fractals have a look and feel that is very different from ordinary curves.

More information

On the number of distinct directions of planes determined by n points in R 3

On the number of distinct directions of planes determined by n points in R 3 On the number of distinct directions of planes determined by n points in R 3 Rom Pinchasi August 27, 2007 Abstract We show that any set of n points in R 3, that is not contained in a plane, determines

More information

16.410/413 Principles of Autonomy and Decision Making

16.410/413 Principles of Autonomy and Decision Making 16.410/413 Principles of Autonomy and Decision Making Lecture 17: The Simplex Method Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology November 10, 2010 Frazzoli (MIT)

More information

Introduction to Homogeneous coordinates

Introduction to Homogeneous coordinates Last class we considered smooth translations and rotations of the camera coordinate system and the resulting motions of points in the image projection plane. These two transformations were expressed mathematically

More information

Matrices. Chapter Matrix A Mathematical Definition Matrix Dimensions and Notation

Matrices. Chapter Matrix A Mathematical Definition Matrix Dimensions and Notation Chapter 7 Introduction to Matrices This chapter introduces the theory and application of matrices. It is divided into two main sections. Section 7.1 discusses some of the basic properties and operations

More information

New Directions in Linear Programming

New Directions in Linear Programming New Directions in Linear Programming Robert Vanderbei November 5, 2001 INFORMS Miami Beach NOTE: This is a talk mostly on pedagogy. There will be some new results. It is not a talk on state-of-the-art

More information

Vocabulary: Looking For Pythagoras

Vocabulary: Looking For Pythagoras Vocabulary: Looking For Pythagoras Concept Finding areas of squares and other figures by subdividing or enclosing: These strategies for finding areas were developed in Covering and Surrounding. Students

More information

4. Simplicial Complexes and Simplicial Homology

4. Simplicial Complexes and Simplicial Homology MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n

More information

274 Curves on Surfaces, Lecture 5

274 Curves on Surfaces, Lecture 5 274 Curves on Surfaces, Lecture 5 Dylan Thurston Notes by Qiaochu Yuan Fall 2012 5 Ideal polygons Previously we discussed three models of the hyperbolic plane: the Poincaré disk, the upper half-plane,

More information

On ɛ-unit distance graphs

On ɛ-unit distance graphs On ɛ-unit distance graphs Geoffrey Exoo Department of Mathematics and Computer Science Indiana State University Terre Haute, IN 47809 g-exoo@indstate.edu April 9, 003 Abstract We consider a variation on

More information

Three applications of Euler s formula. Chapter 10

Three applications of Euler s formula. Chapter 10 Three applications of Euler s formula Chapter 10 A graph is planar if it can be drawn in the plane R without crossing edges (or, equivalently, on the -dimensional sphere S ). We talk of a plane graph if

More information

Discrete mathematics , Fall Instructor: prof. János Pach

Discrete mathematics , Fall Instructor: prof. János Pach Discrete mathematics 2016-2017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.2. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations,

More information