Related papers: A regular $n$-gon spiral
We construct triangular hyperbolic polyhedra whose links are generalized 4-gons. The universal cover of those polyhedra are hyperbolic buildings, which appartments are hyperbolic planes tesselated by regular triangles with angles $\pi/4$.…
In this paper, constructions of regular pentagon and decagon, and the calculation of the main trigonometric ratios of the corresponding central angles are approached. In this way, for didactic purposes, it is intended to show the reader…
This article analyses geometric constructions by origami when up to $n$ simultaneous folds may be done at each step. It shows that any arbitrary angle can be $m$-sected if the largest prime factor of $m$ is $p\le n+2$. Also, the regular…
If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…
In an equiangular spiral, "the whorls continually increase in breadth and do so in a steady and unchanging ratio... It follows that the sectors cut off by successive radii, at equal vectorial angles, are similar to one another in every…
We develop a theory of soliton spiraling in a bulk nonlinear medium and reveal a new physical mechanism: periodic power exchange via induced coherence, which can lead to stable spiraling and the formation of dynamical two-soliton states.…
We begin by proving a few general facts about Simson polygons, defined as polygons which admit a pedal line. We use an inductive argument to show that no convex $n$-gon, $n\geq5$, admits a Simson Line. We then determine a property which…
Colloidal particles in polymer solutions and functionalized nanoparticles often exhibit short-range attraction coupled with long-range repulsion (SALR) leading to the spontaneous formation of symmetric patterns. Chiral nanostructures formed…
We construct the quaternion algebra [10] "geometrically" by a three dimensional analogue of the classic two dimensional geometric description of the complex field. The algebraic description of the multiplication operation in three…
In this work we study inside-out dissections of polygons and polyhedra. We first show that an arbitrary polygon can be inside-out dissected with $2n+1$ pieces, thereby improving the best previous upper bound of $4(n-2)$ pieces.…
In this Paper, for every $n>5$, we show examples of pairs articulated $n$-gons $P$ and $P'$ of different area such that every ordered sequence of internal angles of $P$ coincide with some ordered sequence of internal angles of $P'$.
We describe a polynomial time algorithm that takes as input a polygon with axis-parallel sides but irrational vertex coordinates, and outputs a set of as few rectangles as possible into which it can be dissected by axis-parallel cuts and…
A method is described for constructing, with computer assistance, planar substitution tilings that have n-fold rotational symmetry. This method uses as prototiles the set of rhombs with angles that are integer multiples of pi/n, and…
We explore optimal circular nonconvex partitions of regular k-gons. The circularity of a polygon is measured by its aspect ratio: the ratio of the radii of the smallest circumscribing circle to the largest inscribed disk. An optimal…
Special orthogonal matrices with rational elements form the group SO(n,Q), where Q is the field of rational numbers. A theorem describing the structure of an arbitrary matrix from this group is proved. This theorem yields an algorithm for…
This paper aims to develop the mathematical representation of a surface generated by elliptical arcs joining the sides of a regular polygon to a point lying vertically upward on the central axis of the polygon. The volume of the…
We analyze the spiral structure that results in a numerical simulation of a galactic disk with stellar and gaseous components evolving in a potential that includes an axisymmetric halo and bulge. We perform a second simulation without the…
We demonstrate in an elementary way how to construct a frieze pattern of width $m-3$ from a partition of a convex $m$-gon by not intersecting diagonals.
We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi…
This paper presents an additional class of regular polyhedra--envelope polyhedra--made of regular polygons, where the arrangement of polygons (creating a single surface) around each vertex is identical; but dihedral angles between faces…