Technische Universität München Zentrum Mathematik

Size: px
Start display at page:

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

Transcription

1 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 Solutions for Worksheet 1 ( ) Classwork a) Fill in the gaps in the following matrix in such a way that it represents the cincidence structure of a finite projective plane. The symbol denotes an icidence, the symbol the absence of an incidence. A B C D E F G H I K L M N a b c d e f g h i k l m n b) How can one derive a Cayley table (i.e. a table with operands as labels of the rows and columns, and the corresponding result as the corresponding table entry) for the operations (join) and (meet)? Outline such a table and fill in some entries as examples. c) What s the order of this finite plane? d) Create an (unlabeled) draft of this plane. Hint: All projective planes of this order are isomorphic. e) Label the created draft in accordance with the incidence matrix. How unique is this labeling? f) How many different ways are there to label the rows and columns of the matrix using homogeneous coordinates? g) Give one such labeling explicitely. 1

2 Solution: a) The table below gives the solution to the problem. The number after the entries hint at the order in which the matrix could be filled. For that we use the following rules: Step 1: A column or row with 4 can only contain else, since every line contains 4 points and through every point run 4 lines. Even Steps: No complete 4 4 minor is allowed. So, when the entries (x, X), (x, Y ) and (y, X) are incident, (y, Y ) cannot be an incidence. The reason is, that both the Join X Y = x and the Meet x y = X have to be unique. So one can deduce a at the fourth corner of a rectangulat built by. Odd steps: A column or row with 9 must contain in the remaining entries. Again, because every line contains 4 points and through every point run 4 lines. A B C D E F G H I K L M N a b c d e f g h i k l m n

3 b) To get the Join, one has to find the (unique) line (i.e. row) to two points (i.e. columns) being incident to both i.e. having a at both. An analogue argument holds for the Meet. This results in the following tables for both operations. A B C D E F G H I K L M N A h k l l h k l e h k e e B h n g d h g n g h d d n C k n f m f k n m m k f n D l g f l f g l g a a f a E l d m l b b l m m d d b F h h f f b b c c h c f b G k g k g b b i g i k i b H l n n l l c i c i c i n I e g m g m c g c m c e e K h h m a m h i i m a i a L k d k a d c k c c a d a M e d f f d f i i e i d e N e n n a b b b n e a a e a b c d e f g h i k l m n a N L L N D D K K L D K N b N F E N F G F G G E E N c L F L I F I F H L H I H d L E L M M B B M L E E B e N N I M M I A M A A I N f D F F M M D F M C D C C g D G I B I D B G G D I B h K F F B A F B K A A K B i K G H M M M G K G H K H k L G L L A C G A G A C C l D E H E A D D A H A E H m K E I E I C I K K C E C n N N H B N C B B H C H C c) The plane has 13 = points, thus order 3. 3

4 d) As all planes of this order are isomporphic (by the hint), one can use the projective plane over F 3 as a starting point for the drawing. First, one can use {0, 1, 2} R to imagine the points as a subset of RP 2 and depict them acordingly. The modulo arithmetic results in additional incidences, which are best depicted as bent lines. One gets to the additional points of the diagonal by steps in modulo arithmetic. So one gets with steps in the direction (1, 1) starting at (0, 1) first to (1, 2), then to (2, 3). That is, modulo 3, the point (2, 0). Whence, those three points have to be collinear. The order of the points on the line is irrelevant and should be choosen in a way that results in a nice picture. e) 4 points, of which no 3 are collinear, can be assigned arbitrarily (cf. part e). If one places the points A to D in the bottom left corner of the plane, all other labels have to as following: G b N n e a k g i m l d E L I H c C D M f F A B K h f) A projective map is determined by 4 points, of which no 3 are collinear. It maps the projective plane on itself. This means, we can choose 4 points arbitrarily and the rest of the plane unfolds. This unfolding is covered in the next part. 13 possibilities, to choose the point A. 12 possibilities, to choose B distinct from A. 9 possibilities, to choose C off the line connecting A and B. 4 possibilities, to choose D off the three lines A B, B C and C A. This results in = 5616 different ways, to label the rows and columns with equivalence classes. For each single vector there are obviously 2 different scalar multiples which can serve as a representative. With 13 points and lines, this yields a factor of and a total of of possible labels with concrete coordinates. 4

5 g) The easy way is to choose 4 points again, with no 3 of them on a common line, and to assign them appropriate coordinates. E.g. A = 0 0 B = C = 0 1 D = 1 From that one can deduce all other points and all lines with the following computation being one of many = 1 L 0 1 = 0 L 1 1 = 2 L 0 1 = 0 L = 0 P 0 0 = 1 P 0 1 = 0 L 0 1 = 2 L = 2 P 2 1 = 1 L 1 1 = 0 P 1 0 = 2 P = 0 L 2 0 = 1 L 0 2 = 1 P 1 0 = 2 P = 2 P 0 2 = 2 L 2 0 = 1 P = 1 L 0 1 = 1 L 1 2 = 2 L With the starting points choosen above, one gets the following homogenous coordinates: A = (0, 0, 1) T B = (1, 0, 1) T C = (0, 1, 1) T D = (1, 1, 1) T l b = E = (1, 1, 0) T h f = F = (1, 0, 0) T k g = G = (0, 1, 0) T i c = H = (2, 2, 1) T c g = I = (1, 2, 1) T a h = K = (2, 0, 1) T a k = L = (0, 2, 1) T i f = M = (2, 1, 1) T b n = N = (1, 2, 0) T N D = a = (1, 1, 1) T F G = b = (0, 0, 1) T L F = c = (0, 1, 1) T B M = d = (2, 1, 1) T M I = e = (1, 1, 0) T C D = f = (0, 2, 1) T B D = g = (2, 0, 1) T A B = h = (0, 1, 0) T K G = i = (1, 0, 1) T A C = k = (1, 0, 0) T A H = l = (1, 2, 0) T C I = m = (1, 2, 1) T B C = n = (2, 2, 1) T E l A B C D h k n g f G F b N a K L i c H M I d e m Question 2. (n r, m k ) configurations Given an incidence structure with points P, lines L and incidence relation I satisfying the following conditions: (i) For two points p, q P with p q there exists at most one line l L with pil and qil. (ii) For two lines l, m L with l m there exists at most one point p P with pil and pim. 5

6 An (n r, m k ) configuration is an incidence structure in the sense just stated which has n points and m lines, with k points on every line and r lines through every point. a) How do the axioms stated above differ from those of a projective plane? b) Show that for every (n r, m k ) configuration the equation n r = m k holds. c) Consider m lines in the real plane in general position, together with all the points of intersection between these lines. Which configuration (i.e. which n, r, k) does one obtain from this? d) Consider n points in the real plane in general position, together with all the lines spanned by these points. Which configuration does one obtain from this? e) Complete the following sketch to form an (8 3, 8 3 ) configuration. f) Find a (13 4, 13 4 ) configuration. g) Find additional (n r, m k ) configurations. Solution: a) First, the axioms of a (n r, m k )-configuration at most one line connecting points, not exactly one. The same holds for intersection of lines. So, Join and Meet are not well-defined operations in these configuration. Second, for general (n r, m k )-configurations there is no axiom assuring the richness of the structure. I.e. one can have a (0 3, 0 5 )-configuration. Recall, that all universal statements concerning the empty set are true. So, if there are 0 points, all of the them lies on 3 lines. b) We have n r = I = m k. Both sides describe the number of incidences, i.e. the pairs of points and incident lines. As each of the n points is incident to r lines, there are n r incidences. Analogically, there are k pairs (i.e. points) for each of the m lines. When one uses incidence matrices (columns for points and rows for lines), then this matrix has n columns with r entries each and m rows with k entries each. As the total number of entries has to be unique, the claim follows. c) When the lines are in general position, no 3 of them run through a single point. Thus, every intersection is incident to exactly r = 2 lines. Since parallel lines are just a special case of intersecting lines, all lines intersect. And k = m 1 intersection points lie on every line. From part b) we infer that there are n = m k r = m (m 1) 2 = ( ) m 2 intersections in total. d) In general position no 3 points lie on a common line. So every line connecting two points is only incident to those k = 2. So every points is connected to every other point by r = n 1 different lines. We have m = n r k = n (n 1) 2 = ( n 2) such lines. e) One obvious extension of the drawing is to draw 4 (actually straight) lines connecting the outer points to form a square. On each of those lines are already 3 points as demanded. The given lines have one point less than needed and through the corners of the outer square run one too few lines. So we must augment all given lines by one corner point. As every given line already contains middle points of two sides and those are adjacent to 3 corner points, every line has to connected to the opposite corner. Otherwise, there would be more than one line connecting two points. 6

7 f) The projective plane of order 3, i.e. F 3 P 2, fulfills this combinatorial datum. g) There are many ways to obtain more projective planes. Every finite projective plane is an (n r, n r )-configuration. The homework exercises show some possibilities to generate (n r, m k )-configurations. E.g. by the projection of higher-dimensional configurations. One can spread n points evenly on a circle. A line connecting k such points could than be represented by a k-gon (in general non-regular). Given a set of such polygons for a fixed k and drawing all other polygons obtained by a rotation by 2π n, symmetry infers that all points are incident to the same number of lines. It is possible to use multiples of 2π n, as long as every point still lies on the same number of copies. It is important that every connection between points is part of at most 1 polygon to fulfill the axioms of (n r, m k )-configurations. Question 3. Counting Homework The number of points and lines in a projective plane over a field with n elements is equal to a) Show that the above equation is true for any n. n 2 + n + 1 = n3 1 n 1 b) Give different arguments explaining that count, one for each side of the above equation. c) Generalize this equation for arbitrary dimension d, namely for the projective space KP d over some field K with K = n. 7

8 Solution: a) Multiplying both sides of the equation with (n 1) results in the easy computation (n 2 + n + 1)(n 1) = (n 3 + n 2 + n) (n 2 + n + 1) = n 3 + (n 2 n 2 ) + (n n) 1 = n 3 1 b) The right hand side follows directly from the quotient group describing P: P = {( K 3 0 \ 0 0 K \ {0} For a field K with n elements, the vector space K 3 has n 3 elements. Minus the zero vector, we get n 3 1 possible representatives for our points. Modulo the n 1 non-zero field elements we get the desired number of points. The left hand side results from splitting the projective structures in an affine part and a boundary. The projective plane is an affine plane plus the line at infinity. A projective line is a an affine line plus a point at infinity. An affine plane over a field with n elements has n 2 points. An affine line has n points. And a single point is just 1 point. Together we get n 2 + n + 1 points. This is equivalent to split the representatives of the points in the ones of the form (x, y, 1) T, (x, 1, 0) T and (1, 0, 0) T, respectively: )} x y 1 x, y K = n2 x 1 0 x K = n = 1 An alternative to obtain the left hand side is to count the n + 1 lines through every point p multiplied by the n points on each of these lines distinct from p. This method, however, is harder to generalise to higher dimensions. c) For the right hand side, the representatives have d + 1 elements, determining the exponent of the numerator. On the left hand side, we have d + 1 affine objects starting with the d-dimensional affine space down to a 0-dimensional point. Whence, the general equation is This can be proven the same way as part a). d r=0 n r = nd+1 1 n 1 Question 4. Subset configurations Given a set A with a elements. Consider all subsets with three elements as points, and all subsets with two elements as lines. Incidence shall be defined using containment of sets. P := {p A p = 3} L := {l A l = 2} pil := l p a) What configuration will result for a = 3? Create a sketch of this configuration and label it. b) Also give the (n r, m k ) name which results from a = 4, and create a labeled sketch of that as well. c) What configuration will result from a = 5? What is special about this situation? d) Can you draw the configuration for a = 5 in such a way that the lines and points of that configuration are indeed lines and points of the Euclidean plane? e) What is the connection between the configuration for a = 5 and Desargues theorem? f) complete and label the following drawing in such a way that it reflects the configuration for A = {1, 2, 3, 4, 5, 6}. 8

9 Hint: The points of this drawing can be transferred to 5mm graph paper. g) Give the name of the configuration which results from the general case, i.e. for arbitrary a. h) Describe these configurations as projections of objects in higher dimensions. Solution: a) We get the following (1 3, 3 1 )-configuration b) We get the following (4 3, 6 2 )-configuration

10 c) We get a (10 3, 10 3 )-configuartion. Remark, that here we have the same number of points and lines, resulting in an (n r, n r )-configuration (abbreviated as an n r -configuartion). It is even self-dual. This becomes obvious when we replace every point p P by its complement A \ p L an vice versa. This transition preserves incidences, leading to the duality of the incidence relation. d) The configuartion is easily embedded into the plane. By Desargue s Theorem we know that when all incidents except for one hold, this last one holds, too. A possible picture is: e) The given configuartion is just the configuration depicting Desargue s Theorem. So, when all but one incidents hold, the last one holds, too. This is true in all projective planes in which Desargue s Theorem holds. f) The comlete configuration is 10

11 g) For an arbitrary a we get an (n r, m k )-configuration with ( ) a n = 3 m = ( ) a 2 r = 3 k = a 2 To be sure, one can check whether the number of incidents is correct: ( ) a I = n r = 3 = 3 a! 3!(a 3)! 3 = a! 2!(a 3)! = a! (a 2) = 2!(a 2)! ( ) a (a 2) = m k 2 h) One can think of these configurations as intersections of planes in the three-dimensional affine space, such that they are in general position w.r.t. each other and to the drawing plane. In that case, three planes intersect in a single point and two planes in a line. Projecting these into the drawing plane gives points and lines again. Subsets describing points and lines label just the planes used to generate these object by intersections. Question 5. Axiomatics An incidence structure (P, L, I) is a projective plane if and only if the following axioms hold: (i) For p, q P, p q there exists exactly one l L with pil and qil (ii) For l, m L, l m there exists exactly one p P with pil and pim (iii) There exists a, b, c, d P such that no three of these are incident to the same line. Show using these axioms exclusively that the following statements hold in any projective plane: a) For every point p P there exists a line l L which is not incident to p. 11

12 b) For two lines l, m L the sets of incident points have equal cardinality: {p P pil} = {q P qim} Hint: The lecture in this case showed two inequalities, with the proof of the second one only suggested by a claim that it is analogous to the first. Together these two inequalities result in equality only for finite sets. To properly handle infinite sets, one should define a bijection between them to compare their cardinality. c) For finite projective planes, the number of points and the number of lines is always equal. Hint: Several of these statements have been shown in this or a similar form in the lecture. Simply copying the proofs from the lecture is not the idea behind this task. Instead you should recall all the relevant arguments and formalize the proofs in such a way that you can best follow them yourself. Solution: The following proofs don t use statements from the lecture on purpose, since it is explicitly stated to use axioms only. Some results accord to lemmas from the lecture, but may use a different proof to show a different ansatz. a) Beweis: 1. One starts with the four points a to d, which exists by axiom (iii). 2. With axiom (i) we can look at their Joins, e.g. g = a b and h = b c. 3. The Meet of those is by axiom (ii) unique. As b is incident to both, the Meet has to be b. I.e. g h = b. 4. If p b, at most one of the lines g and h can run through p. So at least one ist not incident to p and can be uesed as l. 5. If p = b, we can choose l = c d. Assuming p = b is incident to this l, the points b, c and d would be on the same line contradicting axiom (iii). b) To prove that two sets have the same cardinality, we have to find a bijection between them. In the lecture, it was enough to find injections, since we condidered only finite sets. 1. There is a point p, neither on l nor on m By axiom (iii) the points a to d exist. Since no 3 are on a common line, at most 2 of them can lie on ech of the lines l and m If one of these lines is not incident to 2 of the points above, one of the points is not incident to both lines. Call it p and proceed with step If both lines are incident to 2 of the points above, label them w.l.o.g. in a way, that l = a b and m = c d. Describing the lines in this way is unique by (i) the Joins g = a c and h = b d exist, again, by (i) g, h, l and m are distinct. Each of these lines is defined by 2 of the points a to d. If two lines were equal, it would contain 3 of these points. That violates (iii) The point p = g h exists by (ii) p lies not on l or m. We can show this by contradiction: W.l.o.g. assume that p lies on l. By its definition it also lies on g l und g have the common point a. Hence, by (ii) we have a = p By definition, p lies on h, too. And from h = b d we can infer that a, b, d are collinear. That contradicts (iii). So, in any case we found a point p outside the lines l and m. 2. Projecting one line onto the other through the point p is a bijection f between the lines to be precise between the sets of points on the lines For each point r with ril exists a unique line h = r p connecting it to p, by (i) As p is not on l and thus r/neqp, (i) is indeed applicable. Moreover, this implies h l and h m The Join h intersects m in the unique point s = h m, by (ii) Define f(r) as s By axiom (i), h is also the unique line incident to both s and p. Thus, f is injective. 12

13 2.6. By axiom (i), there exists a line h = s p connecting p with every point s on l By axiom (ii), each of these connections intersect l in an appropriate point r = h l, with f(r) = s by the above definition. So, f is surjective We deduce that f is bijective. 3. This means that the sets of points incident to both lines have the same cardinality. c) The proof uses the results from the previous parts and gives the concrete number of points and lines. 1. By part b) we have the same number of points on every line. Denote this number by n + 1 so that the order of the plane is n as usual. Caution: That there is something called order and how the number of elements can be derived from it is not part of the axioms. It cannot be used directly. 2. The number of points in the plane is n 2 + n By axiom (iii) we have 4 points a, b, c, which do not lie on a common line By (i), the Join l = b c exists By (iii), a does not lie on l By b) and the definition above, there are exactly n + 1 points on l. Denote them by p i By (i), for each of these there is a line h i = p i a connecting it to a The lines h i are distinct. Otherwise, 2 points p i and p j would lie on a line together with a. But l = p i p j is unique by (i) and we saw above, that a is not on l On each of these n + 1 lines h i lie, by b), n + 1 points Apart from the point a, lying on all of them, any two of the lines h i do not share another point. Because then, two differnet lines would connect this point and a, violating (i) By (ii), every line through a intersects l in the unique point p i. So, besides the n + 1 lines h i there are no other lines through a For every point in the plane distinct from a there is a line connecting it with a by (i) As only the n + 1 lines h i contain a, every point in the plane has to lie on one of them Thus, in the plane we have the point a and n(n + 1) further points n points distinct from a for each of the n + 1 lines h i So the total number of points in the plane is n 2 + n The number of lines is n 2 + n + 1. The proof for this is just the dual of the proof above Every line distinct from l has to intersect l in one of its points p i, by (ii) Through every point p i on l run n + 1 line, which we will show below. These are l and n additional lines Except for l, no line contains more than one p i by (i) Because of that, in the plane we have l and n(n + 1) further lines n lines distinct from l for each of the n + 1 points p i So the total numberof lines is n 2 + n What is left to show is, that exactly n + 1 lines go through every ppint of the plane For every point p exists a line l not incident to p by part a) By part b), n + 1 points lie on l To each of these n + 1 points we have a line connecting it to p, by (i) On the other hand, no line through p does not intersect l This gives a bijection between the n + 1 points on l and the lines through p. 5. As both the number of points and lines is n 2 + n + 1, both number are equal. 13

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 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

Provide a drawing. Mark any line with three points in blue color.

Provide a drawing. Mark any line with three points in blue color. Math 3181 Name: Dr. Franz Rothe August 18, 2014 All3181\3181_fall14h1.tex 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

Problem 3.1 (Building up geometry). For an axiomatically built-up geometry, six groups of axioms needed:

Problem 3.1 (Building up geometry). For an axiomatically built-up geometry, six groups of axioms needed: Math 3181 Dr. Franz Rothe September 29, 2016 All3181\3181_fall16h3.tex Names: Homework has to be turned in this handout. For extra space, use the back pages, or put blank pages between. The homework can

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

Planar Graphs. 1 Graphs and maps. 1.1 Planarity and duality

Planar Graphs. 1 Graphs and maps. 1.1 Planarity and duality Planar Graphs In the first half of this book, we consider mostly planar graphs and their geometric representations, mostly in the plane. We start with a survey of basic results on planar graphs. This chapter

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

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

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

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

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 www-m.ma.tum.de/projektiveeometriess Solutions for Worksheet (--) Question. Moulton

More information

7. The Gauss-Bonnet theorem

7. The Gauss-Bonnet theorem 7. The Gauss-Bonnet theorem 7.1 Hyperbolic polygons In Euclidean geometry, an n-sided polygon is a subset of the Euclidean plane bounded by n straight lines. Thus the edges of a Euclidean polygon are formed

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

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

CHAPTER 2. Graphs. 1. Introduction to Graphs and Graph Isomorphism

CHAPTER 2. Graphs. 1. Introduction to Graphs and Graph Isomorphism CHAPTER 2 Graphs 1. Introduction to Graphs and Graph Isomorphism 1.1. The Graph Menagerie. Definition 1.1.1. A simple graph G = (V, E) consists of a set V of vertices and a set E of edges, represented

More information

Cardinality of Sets. Washington University Math Circle 10/30/2016

Cardinality of Sets. Washington University Math Circle 10/30/2016 Cardinality of Sets Washington University Math Circle 0/0/06 The cardinality of a finite set A is just the number of elements of A, denoted by A. For example, A = {a, b, c, d}, B = {n Z : n } = {,,, 0,,,

More information

Partitions and Packings of Complete Geometric Graphs with Plane Spanning Double Stars and Paths

Partitions and Packings of Complete Geometric Graphs with Plane Spanning Double Stars and Paths Partitions and Packings of Complete Geometric Graphs with Plane Spanning Double Stars and Paths Master Thesis Patrick Schnider July 25, 2015 Advisors: Prof. Dr. Emo Welzl, Manuel Wettstein Department of

More information

The statement implies that any three intersection points of two distinct planes lie on a line.

The statement implies that any three intersection points of two distinct planes lie on a line. Math 3181 Dr. Franz Rothe February 23, 2015 All3181\3181_spr15ts1.tex 1 Solution of Test Name: Problem 1.1. The second part of Hilbert s Proposition 1 states: Any two different planes have either no point

More information

MATH 890 HOMEWORK 2 DAVID MEREDITH

MATH 890 HOMEWORK 2 DAVID MEREDITH MATH 890 HOMEWORK 2 DAVID MEREDITH (1) Suppose P and Q are polyhedra. Then P Q is a polyhedron. Moreover if P and Q are polytopes then P Q is a polytope. The facets of P Q are either F Q where F is a facet

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

Discrete Mathematics I So Practice Sheet Solutions 1

Discrete Mathematics I So Practice Sheet Solutions 1 Discrete Mathematics I So 2016 Tibor Szabó Shagnik Das Practice Sheet Solutions 1 Provided below are possible solutions to the questions from the practice sheet issued towards the end of the course. Exercise

More information

or else take their intersection. Now define

or else take their intersection. Now define Samuel Lee Algebraic Topology Homework #5 May 10, 2016 Problem 1: ( 1.3: #3). Let p : X X be a covering space with p 1 (x) finite and nonempty for all x X. Show that X is compact Hausdorff if and only

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

Automorphism Groups of Cyclic Polytopes

Automorphism Groups of Cyclic Polytopes 8 Automorphism Groups of Cyclic Polytopes (Volker Kaibel and Arnold Waßmer ) It is probably well-known to most polytope theorists that the combinatorial automorphism group of a cyclic d-polytope with n

More information

Definition 1 (Hand-shake model). A hand shake model is an incidence geometry for which every line has exactly two points.

Definition 1 (Hand-shake model). A hand shake model is an incidence geometry for which every line has exactly two points. Math 3181 Dr. Franz Rothe Name: All3181\3181_spr13t1.tex 1 Solution of Test I Definition 1 (Hand-shake model). A hand shake model is an incidence geometry for which every line has exactly two points. Definition

More information

6.2 Classification of Closed Surfaces

6.2 Classification of Closed Surfaces Table 6.1: A polygon diagram 6.1.2 Second Proof: Compactifying Teichmuller Space 6.2 Classification of Closed Surfaces We saw that each surface has a triangulation. Compact surfaces have finite triangulations.

More information

Final Exam 1:15-3:15 pm Thursday, December 13, 2018

Final Exam 1:15-3:15 pm Thursday, December 13, 2018 Final Exam 1:15-3:15 pm Thursday, December 13, 2018 Instructions: Answer all questions in the space provided (or attach additional pages as needed). You are permitted to use pencils/pens, one cheat sheet

More information

Module 7. Independent sets, coverings. and matchings. Contents

Module 7. Independent sets, coverings. and matchings. Contents Module 7 Independent sets, coverings Contents and matchings 7.1 Introduction.......................... 152 7.2 Independent sets and coverings: basic equations..... 152 7.3 Matchings in bipartite graphs................

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

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

Pebble Sets in Convex Polygons

Pebble Sets in Convex Polygons 2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon

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

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

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

Synthetic Geometry. 1.1 Foundations 1.2 The axioms of projective geometry

Synthetic Geometry. 1.1 Foundations 1.2 The axioms of projective geometry Synthetic Geometry 1.1 Foundations 1.2 The axioms of projective geometry Foundations Def: A geometry is a pair G = (Ω, I), where Ω is a set and I a relation on Ω that is symmetric and reflexive, i.e. 1.

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

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

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

Module 11. Directed Graphs. Contents

Module 11. Directed Graphs. Contents Module 11 Directed Graphs Contents 11.1 Basic concepts......................... 256 Underlying graph of a digraph................ 257 Out-degrees and in-degrees.................. 258 Isomorphism..........................

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

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

Basic Combinatorics. Math 40210, Section 01 Fall Homework 4 Solutions

Basic Combinatorics. Math 40210, Section 01 Fall Homework 4 Solutions Basic Combinatorics Math 40210, Section 01 Fall 2012 Homework 4 Solutions 1.4.2 2: One possible implementation: Start with abcgfjiea From edge cd build, using previously unmarked edges: cdhlponminjkghc

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

Exercise set 2 Solutions

Exercise set 2 Solutions Exercise set 2 Solutions Let H and H be the two components of T e and let F E(T ) consist of the edges of T with one endpoint in V (H), the other in V (H ) Since T is connected, F Furthermore, since T

More information

Computational Geometry: Lecture 5

Computational Geometry: Lecture 5 Computational Geometry: Lecture 5 Don Sheehy January 29, 2010 1 Degeneracy In many of the algorithms that we have discussed so far, we have run into problems when that input is somehow troublesome. For

More information

5 Matchings in Bipartite Graphs and Their Applications

5 Matchings in Bipartite Graphs and Their Applications 5 Matchings in Bipartite Graphs and Their Applications 5.1 Matchings Definition 5.1 A matching M in a graph G is a set of edges of G, none of which is a loop, such that no two edges in M have a common

More information

On the Relationships between Zero Forcing Numbers and Certain Graph Coverings

On the Relationships between Zero Forcing Numbers and Certain Graph Coverings On the Relationships between Zero Forcing Numbers and Certain Graph Coverings Fatemeh Alinaghipour Taklimi, Shaun Fallat 1,, Karen Meagher 2 Department of Mathematics and Statistics, University of Regina,

More information

arxiv:submit/ [math.co] 9 May 2011

arxiv:submit/ [math.co] 9 May 2011 arxiv:submit/0243374 [math.co] 9 May 2011 Connectivity and tree structure in finite graphs J. Carmesin R. Diestel F. Hundertmark M. Stein 6 May, 2011 Abstract We prove that, for every integer k 0, every

More information

Math 734 Aug 22, Differential Geometry Fall 2002, USC

Math 734 Aug 22, Differential Geometry Fall 2002, USC Math 734 Aug 22, 2002 1 Differential Geometry Fall 2002, USC Lecture Notes 1 1 Topological Manifolds The basic objects of study in this class are manifolds. Roughly speaking, these are objects which locally

More information

HW Graph Theory Name (andrewid) - X. 1: Draw K 7 on a torus with no edge crossings.

HW Graph Theory Name (andrewid) - X. 1: Draw K 7 on a torus with no edge crossings. 1: Draw K 7 on a torus with no edge crossings. A quick calculation reveals that an embedding of K 7 on the torus is a -cell embedding. At that point, it is hard to go wrong if you start drawing C 3 faces,

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

2009 HMMT Team Round. Writing proofs. Misha Lavrov. ARML Practice 3/2/2014

2009 HMMT Team Round. Writing proofs. Misha Lavrov. ARML Practice 3/2/2014 Writing proofs Misha Lavrov ARML Practice 3/2/2014 Warm-up / Review 1 (From my research) If x n = 2 1 x n 1 for n 2, solve for x n in terms of x 1. (For a more concrete problem, set x 1 = 2.) 2 (From this

More information

TWO COORDINATIZATION THEOREMS FOR PROJECTIVE PLANES

TWO COORDINATIZATION THEOREMS FOR PROJECTIVE PLANES TWO COORDINATIZATION THEOREMS FOR PROJECTIVE PLANES HARRY ALTMAN A projective plane Π consists of a set of points Π p, a set of lines Π L, and a relation between them, denoted and read on, satisfying the

More information

EM225 Projective Geometry Part 2

EM225 Projective Geometry Part 2 EM225 Projective Geometry Part 2 eview In projective geometry, we regard figures as being the same if they can be made to appear the same as in the diagram below. In projective geometry: a projective point

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

Uniform edge-c-colorings of the Archimedean Tilings

Uniform edge-c-colorings of the Archimedean Tilings Discrete & Computational Geometry manuscript No. (will be inserted by the editor) Uniform edge-c-colorings of the Archimedean Tilings Laura Asaro John Hyde Melanie Jensen Casey Mann Tyler Schroeder Received:

More information

Lecture 6: Faces, Facets

Lecture 6: Faces, Facets IE 511: Integer Programming, Spring 2019 31 Jan, 2019 Lecturer: Karthik Chandrasekaran Lecture 6: Faces, Facets Scribe: Setareh Taki Disclaimer: These notes have not been subjected to the usual scrutiny

More information

A graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial.

A graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial. 2301-670 Graph theory 1.1 What is a graph? 1 st semester 2550 1 1.1. What is a graph? 1.1.2. Definition. A graph G is a triple (V(G), E(G), ψ G ) consisting of V(G) of vertices, a set E(G), disjoint from

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

Preferred directions for resolving the non-uniqueness of Delaunay triangulations

Preferred directions for resolving the non-uniqueness of Delaunay triangulations Preferred directions for resolving the non-uniqueness of Delaunay triangulations Christopher Dyken and Michael S. Floater Abstract: This note proposes a simple rule to determine a unique triangulation

More information

Lecture 5: More Examples/Applications of Quasirandom Graphs

Lecture 5: More Examples/Applications of Quasirandom Graphs Random and Quasirandom Graphs Instructor: Padraic Bartlett Lecture 5: More Examples/Applications of Quasirandom Graphs Week 4 Mathcamp 2012 In our last class, we saw that the Paley graphs were an example

More information

2017 SOLUTIONS (PRELIMINARY VERSION)

2017 SOLUTIONS (PRELIMINARY VERSION) SIMON MARAIS MATHEMATICS COMPETITION 07 SOLUTIONS (PRELIMINARY VERSION) This document will be updated to include alternative solutions provided by contestants, after the competition has been mared. Problem

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

Haga's Origamics. Haga's Origamics are a series of activities designed to illustrate the science behind simple paper folding.

Haga's Origamics. Haga's Origamics are a series of activities designed to illustrate the science behind simple paper folding. Haga's Origamics Haga's Origamics are a series of activities designed to illustrate the science behind simple paper folding. Activity I : TUPS (Turned-Up Parts) Take a square piece of paper and label the

More information

Embeddability of Arrangements of Pseudocircles into the Sphere

Embeddability of Arrangements of Pseudocircles into the Sphere Embeddability of Arrangements of Pseudocircles into the Sphere Ronald Ortner Department Mathematik und Informationstechnologie, Montanuniversität Leoben, Franz-Josef-Straße 18, 8700-Leoben, Austria Abstract

More information

points are stationed arbitrarily close to one corner of the square ( n+1

points are stationed arbitrarily close to one corner of the square ( n+1 1 Intro We ve seen previously that we can construct networks based on the regular triangular, rectangular and hexagonal lattices where the total network length is linear in n and the R-statistic for the

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

EDAA40 At home exercises 1

EDAA40 At home exercises 1 EDAA40 At home exercises 1 1. Given, with as always the natural numbers starting at 1, let us define the following sets (with iff ): Give the number of elements in these sets as follows: 1. 23 2. 6 3.

More information

THREE LECTURES ON BASIC TOPOLOGY. 1. Basic notions.

THREE LECTURES ON BASIC TOPOLOGY. 1. Basic notions. THREE LECTURES ON BASIC TOPOLOGY PHILIP FOTH 1. Basic notions. Let X be a set. To make a topological space out of X, one must specify a collection T of subsets of X, which are said to be open subsets of

More information

Mock Exam. Juanjo Rué Discrete Mathematics II, Winter Deadline: 14th January 2014 (Tuesday) by 10:00, at the end of the lecture.

Mock Exam. Juanjo Rué Discrete Mathematics II, Winter Deadline: 14th January 2014 (Tuesday) by 10:00, at the end of the lecture. Mock Exam Juanjo Rué Discrete Mathematics II, Winter 2013-2014 Deadline: 14th January 2014 (Tuesday) by 10:00, at the end of the lecture. Problem 1 (2 points): 1. State the definition of perfect graph

More information

Counting the number of spanning tree. Pied Piper Department of Computer Science and Engineering Shanghai Jiao Tong University

Counting the number of spanning tree. Pied Piper Department of Computer Science and Engineering Shanghai Jiao Tong University Counting the number of spanning tree Pied Piper Department of Computer Science and Engineering Shanghai Jiao Tong University 目录 Contents 1 Complete Graph 2 Proof of the Lemma 3 Arbitrary Graph 4 Proof

More information

Lecture 15: The subspace topology, Closed sets

Lecture 15: The subspace topology, Closed sets Lecture 15: The subspace topology, Closed sets 1 The Subspace Topology Definition 1.1. Let (X, T) be a topological space with topology T. subset of X, the collection If Y is a T Y = {Y U U T} is a topology

More information

Infinity and Uncountability. Countable Countably infinite. Enumeration

Infinity and Uncountability. Countable Countably infinite. Enumeration Infinity and Uncountability. Countable Countably infinite. Enumeration How big is the set of reals or the set of integers? Infinite! Is one bigger or smaller? Same size? Same number? Make a function f

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

Chapter 8. Voronoi Diagrams. 8.1 Post Oce Problem

Chapter 8. Voronoi Diagrams. 8.1 Post Oce Problem Chapter 8 Voronoi Diagrams 8.1 Post Oce Problem Suppose there are n post oces p 1,... p n in a city. Someone who is located at a position q within the city would like to know which post oce is closest

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

Treewidth and graph minors

Treewidth and graph minors Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under

More information

Matching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.

Matching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition. 18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have

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

INTRODUCTION TO GRAPH THEORY. 1. Definitions

INTRODUCTION TO GRAPH THEORY. 1. Definitions INTRODUCTION TO GRAPH THEORY D. JAKOBSON 1. Definitions A graph G consists of vertices {v 1, v 2,..., v n } and edges {e 1, e 2,..., e m } connecting pairs of vertices. An edge e = (uv) is incident with

More information

Omittable Planes. Submitted: Jul 16, 2010; Accepted: Aug 26, 2011; Published: Sep 2, 2011 Mathematics Subject Classification: 52C35

Omittable Planes. Submitted: Jul 16, 2010; Accepted: Aug 26, 2011; Published: Sep 2, 2011 Mathematics Subject Classification: 52C35 Omittable Planes Branko Grünbaum Jonathan Lenchner Submitted: Jul 16, 2010; Accepted: Aug 26, 2011; Published: Sep 2, 2011 Mathematics Subject Classification: 52C35 Abstract In analogy to omittable lines

More information

Tutte s Theorem: How to draw a graph

Tutte s Theorem: How to draw a graph Spectral Graph Theory Lecture 15 Tutte s Theorem: How to draw a graph Daniel A. Spielman October 22, 2018 15.1 Overview We prove Tutte s theorem [Tut63], which shows how to use spring embeddings to obtain

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

MITOCW watch?v=4dj1oguwtem

MITOCW watch?v=4dj1oguwtem MITOCW watch?v=4dj1oguwtem PROFESSOR: So it's time to examine uncountable sets. And that's what we're going to do in this segment. So Cantor's question was, are all sets the same size? And he gives a definitive

More information

Rubber bands. Chapter Rubber band representation

Rubber bands. Chapter Rubber band representation Chapter 1 Rubber bands In the previous chapter, we already used the idea of looking at the graph geometrically, by placing its nodes on the line and replacing the edges by rubber bands. Since, however,

More information

L-CONVEX-CONCAVE SETS IN REAL PROJECTIVE SPACE AND L-DUALITY

L-CONVEX-CONCAVE SETS IN REAL PROJECTIVE SPACE AND L-DUALITY MOSCOW MATHEMATICAL JOURNAL Volume 3, Number 3, July September 2003, Pages 1013 1037 L-CONVEX-CONCAVE SETS IN REAL PROJECTIVE SPACE AND L-DUALITY A. KHOVANSKII AND D. NOVIKOV Dedicated to Vladimir Igorevich

More information

Notes on point set topology, Fall 2010

Notes on point set topology, Fall 2010 Notes on point set topology, Fall 2010 Stephan Stolz September 3, 2010 Contents 1 Pointset Topology 1 1.1 Metric spaces and topological spaces...................... 1 1.2 Constructions with topological

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

6. Lecture notes on matroid intersection

6. Lecture notes on matroid intersection Massachusetts Institute of Technology 18.453: Combinatorial Optimization Michel X. Goemans May 2, 2017 6. Lecture notes on matroid intersection One nice feature about matroids is that a simple greedy algorithm

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

CS522: Advanced Algorithms

CS522: Advanced Algorithms Lecture 1 CS5: Advanced Algorithms October 4, 004 Lecturer: Kamal Jain Notes: Chris Re 1.1 Plan for the week Figure 1.1: Plan for the week The underlined tools, weak duality theorem and complimentary slackness,

More information

γ(ɛ) (a, b) (a, d) (d, a) (a, b) (c, d) (d, d) (e, e) (e, a) (e, e) (a) Draw a picture of G.

γ(ɛ) (a, b) (a, d) (d, a) (a, b) (c, d) (d, d) (e, e) (e, a) (e, e) (a) Draw a picture of G. MAD 3105 Spring 2006 Solutions for Review for Test 2 1. Define a graph G with V (G) = {a, b, c, d, e}, E(G) = {r, s, t, u, v, w, x, y, z} and γ, the function defining the edges, is given by the table ɛ

More information

Lecture 7: Jan 31, Some definitions related to Simplical Complex. 7.2 Topological Equivalence and Homeomorphism

Lecture 7: Jan 31, Some definitions related to Simplical Complex. 7.2 Topological Equivalence and Homeomorphism CS 6170 Computational Topology: Topological Data Analysis University of Utah Spring 2017 School of Computing Lecture 7: Jan 31, 2017 Lecturer: Prof. Bei Wang Scribe: Avani Sharma,

More information

Geometric structures on manifolds

Geometric structures on manifolds CHAPTER 3 Geometric structures on manifolds In this chapter, we give our first examples of hyperbolic manifolds, combining ideas from the previous two chapters. 3.1. Geometric structures 3.1.1. Introductory

More information

Cardinality Lectures

Cardinality Lectures Cardinality Lectures Enrique Treviño March 8, 014 1 Definition of cardinality The cardinality of a set is a measure of the size of a set. When a set A is finite, its cardinality is the number of elements

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

Chapter 3. Set Theory. 3.1 What is a Set?

Chapter 3. Set Theory. 3.1 What is a Set? Chapter 3 Set Theory 3.1 What is a Set? A set is a well-defined collection of objects called elements or members of the set. Here, well-defined means accurately and unambiguously stated or described. Any

More information

13 th Annual Johns Hopkins Math Tournament Saturday, February 19, 2011 Automata Theory EUR solutions

13 th Annual Johns Hopkins Math Tournament Saturday, February 19, 2011 Automata Theory EUR solutions 13 th Annual Johns Hopkins Math Tournament Saturday, February 19, 011 Automata Theory EUR solutions Problem 1 (5 points). Prove that any surjective map between finite sets of the same cardinality is a

More information