|
Nonagon
In geometry, a nonagon () or enneagon () is a nine-sided polygon or 9-gon. The name ''nonagon'' is a prefix 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 ''enneagonon'' (εννεα, "nine" + γωνον (from γωνία = "corner")), and is arguably more correct, though less common than "nonagon". Regular nonagon A '' 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). Construction Although a regular nonagon is not constructible with compa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polygon
In geometry, a polygon () is a plane figure that is described by a finite number of straight line segments connected to form a closed '' polygonal chain'' (or ''polygonal circuit''). The bounded plane region, the bounding circuit, or the two together, may be called a polygon. The segments of a polygonal circuit are called its '' edges'' or ''sides''. The points where two edges meet are the polygon's '' vertices'' (singular: vertex) or ''corners''. The interior of a solid polygon is sometimes called its ''body''. 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. Mathematicians are often concerned only with the bounding polygonal chains of simple polygons and they often define a polygon accordingly. A polygonal boundary may be allowed to cross over itself, creating star polygons and other self-intersecting polygons. A polygon is a 2-dimensional example of the more general polytope in any ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Neusis Construction
In geometry, the neusis (; ; plural: grc, νεύσεις, neuseis, label=none) 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'' ( el, διάστημα, lit=distance). 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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Polygon
In Euclidean geometry, a regular polygon is a polygon that is direct equiangular (all angles are equal in measure) and equilateral (all sides have the same length). Regular polygons may be either convex, star or skew. In the 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 straight line), if the edge length is fixed. General properties ''These properties apply to all regular polygons, whether convex or 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 has an inscribed circle or incircle that is tangent to every side at the midpoint. Thus a regular polygon is a tangential ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Directed Edge
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges, often called arcs. Definition In formal terms, a directed graph is an ordered pair where * ''V'' is a set whose elements are called '' vertices'', ''nodes'', or ''points''; * ''A'' is a set of ordered pairs of vertices, called ''arcs'', ''directed edges'' (sometimes simply ''edges'' with the corresponding set named ''E'' instead of ''A''), ''arrows'', or ''directed lines''. It differs from an ordinary or undirected graph, in that the latter is defined in terms of unordered pairs of vertices, which are usually called ''edges'', ''links'' or ''lines''. The aforementioned definition does not allow a directed graph to have multiple arrows with the same source and target nodes, but some authors consider a broader definition that allows directed graphs to have such multiple arcs (namely, they allow the arc set to be a mu ... [...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 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 of symmetry connects the midpoint of one side to the opposite vertex. If n is even, there are n/2 axes of symmetry connecting the midpoints of opposite sides and n/2 axes of symmetry connecting opp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cyclic Group
In group theory, a branch of abstract algebra in pure mathematics, a cyclic group or monogenous group is a group, denoted C''n'', that is generated by a single element. That is, it is a set of 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 power of ''g'' in multiplicative notation, or as an integer multiple of ''g'' in additive notation. This element ''g'' is called a '' generator'' of the group. Every infinite cyclic group is isomorphic to the additive group of Z, the integers. Every finite cyclic group of order ''n'' is isomorphic to the additive group of Z/''n''Z, the integers modulo ''n''. Every cyclic group is an abelian group (meaning that its group operation is commutative), and every finitely generated abelian group ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
John Horton Conway
John Horton Conway (26 December 1937 – 11 April 2020) was an English mathematician 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 College, Ca ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chaim Goodman-Strauss
Chaim Goodman-Strauss (born June 22, 1967 in Austin TX) is an American mathematician who works in convex geometry, especially aperiodic tiling. He is on the faculty of the University of Arkansas and is a co-author with John H. Conway 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 |
Geometry
Geometry (; ) is, with arithmetic, one of the oldest branches of mathematics. It is concerned with properties of space such as the distance, shape, size, and relative position of figures. A mathematician who works in the field of geometry is called a '' geometer''. Until the 19th century, geometry was almost exclusively devoted to Euclidean geometry, which includes the notions of point, line, plane, distance, angle, surface, and curve, as fundamental concepts. During the 19th century several discoveries enlarged dramatically the scope of geometry. One of the oldest such discoveries is Carl Friedrich Gauss' ("remarkable theorem") that asserts roughly that the Gaussian curvature of a surface is independent from any specific embedding in a Euclidean space. This implies that surfaces can be studied ''intrinsically'', that is, as stand-alone spaces, and has been expanded into the theory of manifolds and Riemannian geometry. Later in the 19th century, it appeared that ... [...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 faces. Another class are called 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 placed on the given axes, and 0, indic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Enneagon Symmetries
The term regular can mean normal or in accordance with rules. It may refer to: People * Moses Regular (born 1971), America football player 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 in arts, entertainment, and media * 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 * ''Regular Show'', an animated television sitcom * ''The Regular Guys'', a radio morning show 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 There are an extremely large number of unrelated notions of "regularity" in mathematics. ... [...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 edges ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
