|
Nonagon
In geometry, a nonagon () or enneagon () is a nine-sided polygon or 9-gon. The name ''nonagon'' is a prefix Hybrid word, hybrid formation, from Latin (''nonus'', "ninth" + ''gonon''), used equivalently, attested already in the 16th century in French ''nonogone'' and in English from the 17th century. The name ''enneagon'' comes from Greek language, Greek ''enneagonon'' (εννεα, "nine" + γωνον (from γωνία = "corner")), and is arguably more correct, though less common. Regular nonagon A ''regular polygon, regular nonagon'' is represented by Schläfli symbol and has internal angles of 140°. The area of a regular nonagon of side length ''a'' is given by :A = \fraca^2\cot\frac=(9/2)ar = 9r^2\tan(\pi/9) :::= (9/2)R^2\sin(2\pi/9)\simeq6.18182\,a^2, where the radius ''r'' of the inscribed circle of the regular nonagon is :r=(a/2)\cot(\pi/9) and where ''R'' is the radius of its circumscribed circle: :R = \sqrt=r\sec(\pi/9)=(a/2)\csc(\pi/9). Construction Although a re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polygon
In geometry, a polygon () is a plane figure made up of line segments connected to form a closed polygonal chain. The segments of a closed polygonal chain are called its '' edges'' or ''sides''. The points where two edges meet are the polygon's '' vertices'' or ''corners''. An ''n''-gon is a polygon with ''n'' sides; for example, a triangle is a 3-gon. A simple polygon is one which does not intersect itself. More precisely, the only allowed intersections among the line segments that make up the polygon are the shared endpoints of consecutive segments in the polygonal chain. A simple polygon is the boundary of a region of the plane that is called a ''solid polygon''. The interior of a solid polygon is its ''body'', also known as a ''polygonal region'' or ''polygonal area''. In contexts where one is concerned only with simple and solid polygons, a ''polygon'' may refer only to a simple polygon or to a solid polygon. A polygonal chain may cross over itself, creating star polyg ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Neusis Construction
In geometry, the neusis (; ; plural: ) is a geometric construction method that was used in antiquity by Greek mathematicians. Geometric construction The neusis construction consists of fitting a line element of given length () in between two given lines ( and ), in such a way that the line element, or its extension, passes through a given point . That is, one end of the line element has to lie on , the other end on , while the line element is "inclined" towards . Point is called the pole of the neusis, line the directrix, or guiding line, and line the catch line. Length is called the ''diastema'' (). A neusis construction might be performed by means of a marked ruler that is rotatable around the point (this may be done by putting a pin into the point and then pressing the ruler against the pin). In the figure one end of the ruler is marked with a yellow eye with crosshairs: this is the origin of the scale division on the ruler. A second marking on the ruler (the blue ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Polygon
In Euclidean geometry, a regular polygon is a polygon that is Equiangular polygon, direct equiangular (all angles are equal in measure) and Equilateral polygon, equilateral (all sides have the same length). Regular polygons may be either ''convex polygon, convex'' or ''star polygon, star''. In the limit (mathematics), limit, a sequence of regular polygons with an increasing number of sides approximates a circle, if the perimeter or area is fixed, or a regular apeirogon (effectively a Line (geometry), straight line), if the edge length is fixed. General properties These properties apply to all regular polygons, whether convex or star polygon, star: *A regular ''n''-sided polygon has rotational symmetry of order ''n''. *All vertices of a regular polygon lie on a common circle (the circumscribed circle); i.e., they are concyclic points. That is, a regular polygon is a cyclic polygon. *Together with the property of equal-length sides, this implies that every regular polygon also h ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dihedral Symmetry
In mathematics, a dihedral group is the group of symmetries of a regular polygon, which includes rotations and reflections. Dihedral groups are among the simplest examples of finite groups, and they play an important role in group theory, geometry, and chemistry. The notation for the dihedral group differs in geometry and abstract algebra. In geometry, or refers to the symmetries of the -gon, a group of order . In abstract algebra, refers to this same dihedral group. This article uses the geometric convention, . Definition The word "dihedral" comes from "di-" and "-hedron". The latter comes from the Greek word hédra, which means "face of a geometrical solid". Overall it thus refers to the two faces of a polygon. Elements A regular polygon with n sides has 2n different symmetries: n rotational symmetries and n reflection symmetries. Usually, we take n \ge 3 here. The associated rotations and reflections make up the dihedral group \mathrm_n. If n is odd, each axis o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cyclic Group
In abstract algebra, a cyclic group or monogenous group is a Group (mathematics), group, denoted C_n (also frequently \Z_n or Z_n, not to be confused with the commutative ring of P-adic number, -adic numbers), that is Generating set of a group, generated by a single element. That is, it is a set (mathematics), set of Inverse element, invertible elements with a single associative binary operation, and it contains an element g such that every other element of the group may be obtained by repeatedly applying the group operation to g or its inverse. Each element can be written as an integer Exponentiation, power of g in multiplicative notation, or as an integer multiple of g in additive notation. This element g is called a ''Generating set of a group, generator'' of the group. Every infinite cyclic group is isomorphic to the additive group \Z, the integers. Every finite cyclic group of Order (group theory), order n is isomorphic to the additive group of Quotient group, Z/''n''Z, the in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
John Horton Conway
John Horton Conway (26 December 1937 – 11 April 2020) was an English mathematician. He was active in the theory of finite groups, knot theory, number theory, combinatorial game theory and coding theory. He also made contributions to many branches of recreational mathematics, most notably the invention of the cellular automaton called the Game of Life. Born and raised in Liverpool, Conway spent the first half of his career at the University of Cambridge before moving to the United States, where he held the John von Neumann Professorship at Princeton University for the rest of his career. On 11 April 2020, at age 82, he died of complications from COVID-19. Early life and education Conway was born on 26 December 1937 in Liverpool, the son of Cyril Horton Conway and Agnes Boyce. He became interested in mathematics at a very early age. By the time he was 11, his ambition was to become a mathematician. After leaving sixth form, he studied mathematics at Gonville and Caius Coll ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chaim Goodman-Strauss
Chaim Goodman-Strauss (born June 22, 1967 in Austin, Texas) is an American mathematician who works in convex geometry, especially aperiodic tiling. He retired from the faculty of the University of Arkansas and currently serves as outreach mathematician for the National Museum of Mathematics. He is co-author with John H. Conway and Heidi Burgiel of '' The Symmetries of Things'', a comprehensive book surveying the mathematical theory of patterns. Education and career Goodman-Strauss received both his B.S. (1988) and Ph.D. (1994) in mathematics from the University of Texas at Austin.Chaim Goodman-Strauss The College Board His doctoral advisor was John Edwin Luecke. He joined the faculty at the [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geometry
Geometry (; ) is a branch of mathematics concerned with properties of space such as the distance, shape, size, and relative position of figures. Geometry is, along with arithmetic, one of the oldest branches of mathematics. A mathematician who works in the field of geometry is called a ''List of geometers, geometer''. Until the 19th century, geometry was almost exclusively devoted to Euclidean geometry, which includes the notions of point (geometry), point, line (geometry), line, plane (geometry), plane, distance, angle, surface (mathematics), surface, and curve, as fundamental concepts. Originally developed to model the physical world, geometry has applications in almost all sciences, and also in art, architecture, and other activities that are related to graphics. Geometry also has applications in areas of mathematics that are apparently unrelated. For example, methods of algebraic geometry are fundamental in Wiles's proof of Fermat's Last Theorem, Wiles's proof of Fermat's ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Symmetrohedron
In geometry, a symmetrohedron is a high-symmetry polyhedron containing convex regular polygons on symmetry axes with gaps on the convex hull filled by irregular polygons. The name was coined by Craig S. Kaplan and George W. Hart. The trivial cases are the Platonic solids, Archimedean solids with all regular polygons. A first class is called ''bowtie'' which contain pairs of trapezoidal faces. A second class has Kite (geometry), kite faces. Another class are called least common multiple, LCM symmetrohedra. Symbolic notation Each symmetrohedron is described by a symbolic expression G(l; m; n; α). G represents the symmetry group (T,O,I). The values l, m and n are the multipliers ; a multiplier of m will cause a regular km-gon to be placed at every k-fold axis of G. In the notation, the axis degrees are assumed to be sorted in descending order, 5,3,2 for I, 4,3,2 for O, and 3,3,2 for T . We also allow two special values for the multipliers: *, indicating that no polygons should be ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Enneagon Symmetries
Regular may refer to: Arts, entertainment, and media Music * "Regular" (Badfinger song) * Regular tunings of stringed instruments, tunings with equal intervals between the paired notes of successive open strings Other uses * Regular character, a main character who appears more frequently and/or prominently than a recurring character * Regular division of the plane, a series of drawings by the Dutch artist M. C. Escher which began in 1936 Language * Regular inflection, the formation of derived forms such as plurals in ways that are typical for the language ** Regular verb * Regular script, the newest of the Chinese script styles Mathematics Algebra and number theory * Regular category, a kind of category that has similarities to both Abelian categories and to the category of sets * Regular chains in computer algebra * Regular element (other), certain kinds of elements of an algebraic structure * Regular extension of fields * Regular ideal (multiple definitions) ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complete Graph
In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. A complete digraph is a directed graph in which every pair of distinct vertices is connected by a pair of unique edges (one in each direction). Graph theory itself is typically dated as beginning with Leonhard Euler's 1736 work on the Seven Bridges of Königsberg. However, drawings of complete graphs, with their vertices placed on the points of a regular polygon, had already appeared in the 13th century, in the work of Ramon Llull. Such a drawing is sometimes referred to as a mystic rose. Properties The complete graph on vertices is denoted by . Some sources claim that the letter in this notation stands for the German word , but the German name for a complete graph, , does not contain the letter , and other sources state that the notation honors the contributions of Kazimierz Kuratowski to graph theory. has edg ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
