Lectures – Math 128 – Geometry – Spring 2002
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
LINEAR ALGEBRA METHODS in COMBINATORICS László Babai
LINEAR ALGEBRA METHODS IN COMBINATORICS L´aszl´oBabai and P´eterFrankl Version 2.1∗ March 2020 ||||| ∗ Slight update of Version 2, 1992. ||||||||||||||||||||||| 1 c L´aszl´oBabai and P´eterFrankl. 1988, 1992, 2020. Preface Due perhaps to a recognition of the wide applicability of their elementary concepts and techniques, both combinatorics and linear algebra have gained increased representation in college mathematics curricula in recent decades. The combinatorial nature of the determinant expansion (and the related difficulty in teaching it) may hint at the plausibility of some link between the two areas. A more profound connection, the use of determinants in combinatorial enumeration goes back at least to the work of Kirchhoff in the middle of the 19th century on counting spanning trees in an electrical network. It is much less known, however, that quite apart from the theory of determinants, the elements of the theory of linear spaces has found striking applications to the theory of families of finite sets. With a mere knowledge of the concept of linear independence, unexpected connections can be made between algebra and combinatorics, thus greatly enhancing the impact of each subject on the student's perception of beauty and sense of coherence in mathematics. If these adjectives seem inflated, the reader is kindly invited to open the first chapter of the book, read the first page to the point where the first result is stated (\No more than 32 clubs can be formed in Oddtown"), and try to prove it before reading on. (The effect would, of course, be magnified if the title of this volume did not give away where to look for clues.) What we have said so far may suggest that the best place to present this material is a mathematics enhancement program for motivated high school students. -
Diameter, Width and Thickness in the Hyperbolic Plane
DIAMETER, WIDTH AND THICKNESS IN THE HYPERBOLIC PLANE AKOS´ G.HORVATH´ Abstract. This paper contains a new concept to measure the width and thickness of a convex body in the hyperbolic plane. We compare the known concepts with the new one and prove some results on bodies of constant width, constant diameter and given thickness. 1. Introduction In hyperbolic geometry there are several concepts to measure the breadth of a convex set. In the first section of this paper we introduce a new idea and compare it with four known ones. Correspondingly, we define three classes of bodies, bodies of constant with, bodies of constant diameter and bodies having the constant shadow property, respectively. In Euclidean space more or less these classes are agree but in the hyperbolic plane we need to differentiate them. Among others we find convex compact bodies of constant width which size essential in the fulfilment of this property (see Statement 7) and others where the size dependence is non-essential (see Statementst:circle). We prove that the property of constant diameter follows to the fulfilment of constant shadow property (see Theorem 2), and both of them are stronger as the property of constant width (see Theorem 1). In the last part of this paper, we introduce the thickness of a constant body and prove a variant of Blaschke’s theorem on the larger circle inscribed to a plane-convex body of given thickness. 1.1. The hyperbolic concepts of width (breadth) introduced earlier. 1.1.1. width ( ): Santal´oin his paper [14] developed the following approach. -
AN INSTRUMENT in HYPERBOLIC GEOMETRY P. 290]
AN INSTRUMENT IN HYPERBOLIC GEOMETRY M. W. AL-DHAHIR1 In addition to straight edge and compasses, the classical instru- ments of Euclidean geometry, we have in hyperbolic geometry the horocompass and the hypercompass. By a straight edge, or ruler, we draw the line joining any two distinct points, and by the compasses we construct a circle with given center and radius. The horocompass is used to draw a horocycle through a given point when its diameter through the point with its direction are given. If the central line and radius of a hypercycle are given, we can draw it by the hypercompass. Although ruler and compasses have been generally used in the solutions of construction problems in hyperbolic geometry [l; 2, p. 191, pp. 204-206; 3, p. 394], other instruments have been intro- duced, and the relationships among these instruments, together with some restrictions, have been studied in recent years [2, pp. 289-291]. An important result in this connection is the following theorem [2, p. 290]. Theorem A. In conjunction with a ruler, the three compasses are equivalent. Recently [3, p. 389], a different geometrical tool, called the parallel-ruler, has been considered. For any point 4 and any ray a, not incident to 4, we can draw, with this ruler, a line through 4 parallel to a. As in Euclidean geometry, the parallel-ruler may also be used as an ordinary ruler. Hence the following result has been obtained [3]. Theorem H. Any construction that can be performed by a ruler and compasses can be performed by a parallel-ruler. -
Notes on Euclidean Geometry Kiran Kedlaya Based
Notes on Euclidean Geometry Kiran Kedlaya based on notes for the Math Olympiad Program (MOP) Version 1.0, last revised August 3, 1999 c Kiran S. Kedlaya. This is an unfinished manuscript distributed for personal use only. In particular, any publication of all or part of this manuscript without prior consent of the author is strictly prohibited. Please send all comments and corrections to the author at [email protected]. Thank you! Contents 1 Tricks of the trade 1 1.1 Slicing and dicing . 1 1.2 Angle chasing . 2 1.3 Sign conventions . 3 1.4 Working backward . 6 2 Concurrence and Collinearity 8 2.1 Concurrent lines: Ceva’s theorem . 8 2.2 Collinear points: Menelaos’ theorem . 10 2.3 Concurrent perpendiculars . 12 2.4 Additional problems . 13 3 Transformations 14 3.1 Rigid motions . 14 3.2 Homothety . 16 3.3 Spiral similarity . 17 3.4 Affine transformations . 19 4 Circular reasoning 21 4.1 Power of a point . 21 4.2 Radical axis . 22 4.3 The Pascal-Brianchon theorems . 24 4.4 Simson line . 25 4.5 Circle of Apollonius . 26 4.6 Additional problems . 27 5 Triangle trivia 28 5.1 Centroid . 28 5.2 Incenter and excenters . 28 5.3 Circumcenter and orthocenter . 30 i 5.4 Gergonne and Nagel points . 32 5.5 Isogonal conjugates . 32 5.6 Brocard points . 33 5.7 Miscellaneous . 34 6 Quadrilaterals 36 6.1 General quadrilaterals . 36 6.2 Cyclic quadrilaterals . 36 6.3 Circumscribed quadrilaterals . 38 6.4 Complete quadrilaterals . 39 7 Inversive Geometry 40 7.1 Inversion . -
Extension of Algorithmic Geometry to Fractal Structures Anton Mishkinis
Extension of algorithmic geometry to fractal structures Anton Mishkinis To cite this version: Anton Mishkinis. Extension of algorithmic geometry to fractal structures. General Mathematics [math.GM]. Université de Bourgogne, 2013. English. NNT : 2013DIJOS049. tel-00991384 HAL Id: tel-00991384 https://tel.archives-ouvertes.fr/tel-00991384 Submitted on 15 May 2014 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Thèse de Doctorat école doctorale sciences pour l’ingénieur et microtechniques UNIVERSITÉ DE BOURGOGNE Extension des méthodes de géométrie algorithmique aux structures fractales ■ ANTON MISHKINIS Thèse de Doctorat école doctorale sciences pour l’ingénieur et microtechniques UNIVERSITÉ DE BOURGOGNE THÈSE présentée par ANTON MISHKINIS pour obtenir le Grade de Docteur de l’Université de Bourgogne Spécialité : Informatique Extension des méthodes de géométrie algorithmique aux structures fractales Soutenue publiquement le 27 novembre 2013 devant le Jury composé de : MICHAEL BARNSLEY Rapporteur Professeur de l’Université nationale australienne MARC DANIEL Examinateur Professeur de l’école Polytech Marseille CHRISTIAN GENTIL Directeur de thèse HDR, Maître de conférences de l’Université de Bourgogne STEFANIE HAHMANN Examinateur Professeur de l’Université de Grenoble INP SANDRINE LANQUETIN Coencadrant Maître de conférences de l’Université de Bourgogne RONALD GOLDMAN Rapporteur Professeur de l’Université Rice ANDRÉ LIEUTIER Rapporteur “Technology scientific director” chez Dassault Systèmes Contents 1 Introduction 1 1.1 Context . -
NATURAL STRUCTURES in DIFFERENTIAL GEOMETRY Lucas
NATURAL STRUCTURES IN DIFFERENTIAL GEOMETRY Lucas Mason-Brown A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science in mathematics Trinity College Dublin March 2015 Declaration I declare that the thesis contained herein is entirely my own work, ex- cept where explicitly stated otherwise, and has not been submitted for a degree at this or any other university. I grant Trinity College Dublin per- mission to lend or copy this thesis upon request, with the understanding that this permission covers only single copies made for study purposes, subject to normal conditions of acknowledgement. Contents 1 Summary 3 2 Acknowledgment 6 I Natural Bundles and Operators 6 3 Jets 6 4 Natural Bundles 9 5 Natural Operators 11 6 Invariant-Theoretic Reduction 16 7 Classical Results 24 8 Natural Operators on Differential Forms 32 II Natural Operators on Alternating Multivector Fields 38 9 Twisted Algebras in VecZ 40 10 Ordered Multigraphs 48 11 Ordered Multigraphs and Natural Operators 52 12 Gerstenhaber Algebras 57 13 Pre-Gerstenhaber Algebras 58 irred 14 A Lie-admissable Structure on Graacyc 63 irred 15 A Co-algebra Structure on Graacyc 67 16 Loday's Rigidity Theorem 75 17 A Useful Consequence of K¨unneth'sTheorem 83 18 Chevalley-Eilenberg Cohomology 87 1 Summary Many of the most important constructions in differential geometry are functorial. Take, for example, the tangent bundle. The tangent bundle can be profitably viewed as a functor T : Manm ! Fib from the category of m-dimensional manifolds (with local diffeomorphisms) to 3 the category of fiber bundles (with locally invertible bundle maps). -
Arxiv:1806.04129V2 [Math.GT] 23 Aug 2018 Dense, Although in Certain Cases It Is Locally the Product of a Cantor Set and an Interval
ANGELS' STAIRCASES, STURMIAN SEQUENCES, AND TRAJECTORIES ON HOMOTHETY SURFACES JOSHUA BOWMAN AND SLADE SANDERSON Abstract. A homothety surface can be assembled from polygons by identifying their edges in pairs via homotheties, which are compositions of translation and scaling. We consider linear trajectories on a 1-parameter family of genus-2 homothety surfaces. The closure of a trajectory on each of these surfaces always has Hausdorff dimension 1, and contains either a closed loop or a lamination with Cantor cross-section. Trajectories have cutting sequences that are either eventually periodic or eventually Sturmian. Although no two of these surfaces are affinely equivalent, their linear trajectories can be related directly to those on the square torus, and thence to each other, by means of explicit functions. We also briefly examine two related families of surfaces and show that the above behaviors can be mixed; for instance, the closure of a linear trajectory can contain both a closed loop and a lamination. A homothety of the plane is a similarity that preserves directions; in other words, it is a composition of translation and scaling. A homothety surface has an atlas (covering all but a finite set of points) whose transition maps are homotheties. Homothety surfaces are thus generalizations of translation surfaces, which have been actively studied for some time under a variety of guises (measured foliations, abelian differentials, unfolded polygonal billiard tables, etc.). Like a translation surface, a homothety surface is locally flat except at a finite set of singular points|although in general it does not have an accompanying Riemannian metric|and it has a well-defined global notion of direction, or slope, again except at the singular points. -
Cross Ratios on Boundaries of Symmetric Spaces and Euclidean Buildings
Transformation Groups c The Author(s) (2020) Vol. 26, No. 1, 2021, pp. 31–68 CROSS RATIOS ON BOUNDARIES OF SYMMETRIC SPACES AND EUCLIDEAN BUILDINGS J. BEYRER∗ Department of Mathematics Universit¨atHeidelberg Im Neuenheimer Feld 205, 69120 Heidelberg, Germany [email protected] Abstract. We generalize the natural cross ratio on the ideal boundary of a rank one symmetric space, or even CAT(−1) space, to higher rank symmetric spaces and (non- locally compact) Euclidean buildings. We obtain vector valued cross ratios defined on simplices of the building at infinity. We show several properties of those cross ratios; for example that (under some restrictions) periods of hyperbolic isometries give back the translation vector. In addition, we show that cross ratio preserving maps on the chamber set are induced by isometries and vice versa, | motivating that the cross ratios bring the geometry of the symmetric space/Euclidean building to the boundary. Introduction Cross ratios on boundaries are a crucial tool in hyperbolic geometry and more general negatively curved spaces. In this paper we show that we can generalize these cross ratios to (the non-positively curved) symmetric spaces of higher rank and thick Euclidean buildings with many of the properties of the cross ratio still valid. 2 2 On the boundary @1H of the hyperbolic plane H there is naturally a multi- plicative cross ratio defined by z1 − z2 z3 − z4 crH2 (z1; z2; z3; z4) = z1 − z4 z3 − z2 2 2 when considering H in the upper half space model, i.e., @1H = R [ f1g. This cross ratio plays an essential role in hyperbolic geometry. -
Pst-Euclide a Pstricks Package for Drawing Geometric Pictures; V.1.75
pst-euclide A PSTricks package for drawing geometric pictures; v.1.75 Dominique Rodriguez Herbert Voß Liao Xiongfei September 29, 2020 The pst-eucl package allow the drawing of Euclidean geometric figures using LATEX macros for specifying mathematical constraints. It is thus possible to build point using common transformations or intersections. The use of coordinates is limited to points which controlled the figure. I would like to thanks the following persons for the help they gave me for development of this package: • Denis Girou pour ses critiques pertinentes et ses encouragement lors de la décou- verte de l’embryon initial et pour sa relecture du présent manuel; • Michael Vulis for his fast testing of the documentation using VTEX which leads to the correction of a bug in the PostScript code; • Manuel Luque and Olivier Reboux for their remarks and their examples. • Alain Delplanque for its modification theorems on automatic placing of points name and the ability of giving a list of points in \pstGeonode. Thanks to: Manuel Luque; Thomas Söll. 1 Contents 2 Contents I. The package 5 1. Special specifications 5 1.1. PSTricks Options ........................................ 5 1.2. Conventions .................................... ....... 5 2. Basic Objects 5 2.1. Points......................................... ...... 5 2.2. Segmentmark.................................... ...... 7 2.3. Segmentlabels .................................. ....... 8 2.4. Triangles...................................... ....... 9 2.5. Angles ........................................ -
Chapter Ii: Affine and Euclidean Geometry Affine and Projective Geometry, E
AFFINE AND PROJECTIVE GEOMETRY, E. Rosado & S.L. Rueda CHAPTER II: AFFINE AND EUCLIDEAN GEOMETRY AFFINE AND PROJECTIVE GEOMETRY, E. Rosado & S.L. Rueda 2. AFFINE TRANSFORMATIONS 2.1 Definition and first properties Definition Let (A; V; φ) and (A0;V 0; φ0) be two real affine spaces. We will say that a map 0 f : A −! A is an affine transformation if there exists a linear transformation f¯: V −! V 0 such that: f¯(PQ) = f (P ) f (Q); 8P; Q 2 A: This is equivalent to say that for every P 2 A and every vector u¯ 2 V we have f(P + u) = f(P ) + f¯(u): We call f¯ the linear transformation associated to f. AFFINE AND PROJECTIVE GEOMETRY, E. Rosado & S.L. Rueda Proposition Let (A; V; φ) and (A0;V 0; φ0) be two affine subspaces and let f : A −! A0 be an affine transformation with associated linear transformation f¯: V −! V 0. The following statements hold: 1. f is injective if and only if f¯ is injective. 2. f is surjective if and only if f¯ is surjective. 3. f is bijective if and only if f¯ is bijective. Proposition Let g : A −! A0 and f : A0 −! A00 be two affine transformations. The composi- tion f ◦g : A −! A00 is also an affine transformation and its associated linear transformation is f ◦ g = f¯◦ g¯. Proposition Let f; g : A −! A0 be two affine transformations which coincide over a point P , f(P ) = g(P ), and which have the same associated linear transformation f¯ =g ¯. -
Euclidean Geometry
An Interactive Java Program to Generate Hyperbolic Repeating Patterns Based on Regular Tessellations Including Hyperbolic Lines and Equidistant Curves A THESIS SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA BY Sakethram Karumuri IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF SCIENCE Dr. Douglas Dunham July, 2015 © Sakethram Karumuri 2015 ALL RIGHTS RESERVED Acknowledgements I would like to gratefully acknowledge my advisor, Dr. Douglas Dunham whose constant guidance and support helped me in completing this thesis. Without his persistent help, this work would not have been completed. I would like to thank my committee members, Dr. Peter Willemsen and Dr. Steven Trogdon for their support and encouragement. I would like to thank my exceptional department faculty, especially Dr. Ted Pedersen, Dr. Huayang Wang and Dr. Hudson Turner for teaching me the nitty gritty of Computer Science concepts. I would like to thank Lori Lucia and Clare Ford for providing support in times of need. I would also like to thank all my friends and fellow graduate students especially Shiva Kumar Chittamuru and Mounika Alla for sharing their knowledge and experience which helped me to complete my thesis. Finally, I would like to thank my parents and my sister for their unconditional trust and timely encouragement. It was their love that helped me rise up during the times of adversity. i Dedicated to my mom, Mrs. Savitri Karumuri, my dad, Mr. Syam Babu Karumuri, and my sister, Mrs. Prathyusha Gunishetty ii Abstract Repeating patterns have been utilized as art by various cultures all through the history. -
Chapter 1 : the Hyperbolic Plane
Géométrie Hyperbolique 1 M2 Dynamique Chapter 1 : The Hyperbolic plane I Möbius transformations We start with a little bit of geometry on the Riemann sphere using Möbius transformation. A - Definitions Let C^ = C [ f1g be the Riemann sphere. It is the one-point compactification of the usual complex plane. It is homemorphic to the sphere S2 (embedded in R3) through the stereographic projection. It’s also homeomorphic to CP 1, the complex projective line, which is the quotient of C2 n f(0; 0)g by C∗. Definition I.1 A Möbius transformation is a map φ : C^ ! C^ defined by 8 az + b > if z 2 ; z 6= − d < cz + d C c φ(z) = d 1 if z = − c :> a c if z = 1 with a; b; c; d 2 C such that ad − bc 6= 0. Remark : If c = 0, the last two cases are the same We denote by Mob(C^) the set of all Möbius transformations. We can give basic examples of Möbius transformations : • Translations of the form Tb : z 7! z + b with b 2 C. iθ • Rotations. For example Rθ : z 7! e z are the rotations around 0. • Homotheties. For example Sλ : z 7! λz with λ 2 R>0. are the homotheties from 0. 1 • The involution : I : z 7! z Exercise 1: Prove that the group Mob(C^) is generated by the set fTb; b 2 Cg [ fRθ; θ 2 Rg [ fSλ; λ 2 R>0g [ fIg (Try to decompose any map into these elementary elements). Any similarity z 7! az + b with a 2 C∗ and b 2 C is of course a Mobius transformation.