English
Related papers

Related papers: A regular $n$-gon spiral

200 papers

Every convex polygon with $n$ vertices is a linear projection of a higher-dimensional polytope with at most $147\,n^{2/3}$ facets.

Combinatorics · Mathematics 2020-03-03 Yaroslav Shitov

The construction of regular polygons with a compass and straightedge is a well-known task and this problem has interested mathematicians for a long time. In particular, for a long time they could not answer the question of whether is it…

Metric Geometry · Mathematics 2026-04-14 J. Mainik

We compute the number of triangulations of a convex $k$-gon each of whose sides is subdivided by $r-1$ points. We find explicit formulas and generating functions, and we determine the asymptotic behaviour of these numbers as $k$ and/or $r$…

Combinatorics · Mathematics 2017-02-06 Andrei Asinowski , Christian Krattenthaler , Toufik Mansour

We say that a triangle $T$ tiles a polygon $A$, if $A$ can be dissected into finitely many nonoverlapping triangles similar to $T$. We show that if $N>42$, then there are at most three nonsimilar triangles $T$ such that the angles of $T$…

Metric Geometry · Mathematics 2020-02-28 M. Laczkovich

Given any convex $n$-gon, in this article, we: (i) prove that its vertices can form at most $n^2/2 + \Theta(n\log n)$ isosceles trianges with two sides of unit length and show that this bound is optimal in the first order, (ii) conjecture…

Computational Geometry · Computer Science 2010-09-16 Amol Aggarwal

Skeletal polyhedra and polygonal complexes are finite or infinite periodic structures in 3-space with interesting geometric, combinatorial, and algebraic properties. These structures can be viewed as finite or infinite periodic graphs…

Metric Geometry · Mathematics 2016-10-11 Egon Schulte , Asia Ivić Weiss

Abstract polytopes generalize the classical notion of convex polytopes to more general combinatorial structures. The most studied ones are regular and chiral polytopes, as it is well-known, they can be constructed as coset geometries from…

Combinatorics · Mathematics 2023-04-06 Isabel Hubard , Elías Mochán

We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…

Computational Geometry · Computer Science 2007-05-23 Erik D. Demaine , Martin L. Demaine , Anna Lubiw , Joseph O'Rourke

In the manifold theory of spiral structure in barred galaxies, the usual assumption is that the spirals rotate with the same pattern speed as the bar. Here we generalize the manifold theory under the assumption that the spirals rotate with…

Chaotic Dynamics · Physics 2020-04-22 C. Efthymiopoulos , M. Harsoula , G. Contopoulos

We show that the problem of constructing a real rational knot of a reasonably low degree can be reduced to an algebraic problem involving the pure braid group: expressing an associated element of the pure braid group in terms of the…

Geometric Topology · Mathematics 2016-08-16 Shane D'Mello , Rama Mishra

N-body simulations of disc galaxies that display recurrent transient spiral patterns are comparatively easy to construct, but are harder to understand. In this paper, I summarise the evidence from such experiments that the spiral patterns…

Astrophysics of Galaxies · Physics 2010-11-19 J. A. Sellwood

We construct a natural generalized complex structure on the total space of any bundle endowed with a Chern connection and whose typical fibre is a homogeneous symplectic manifold. This extends known constructions of generalized complex…

Differential Geometry · Mathematics 2013-04-09 Radu Pantilie

We establish a relationship between the word complexity and the number of generalized diagonals for a polygonal billiard. We conclude that in the rational case the complexity function has cubic upper and lower bounds. In the tiling case the…

Dynamical Systems · Mathematics 2007-05-23 J. Cassaigne , P. Hubert , S. Troubetzkoy

We show that every heptagon is a section of a $3$-polytope with $6$ vertices. This implies that every $n$-gon with $n\geq 7$ can be obtained as a section of a $(2+\lfloor\frac{n}{7}\rfloor)$-dimensional polytope with at most…

Metric Geometry · Mathematics 2015-02-11 Arnau Padrol , Julian Pfeifle

A way to add an extra dimension is briefly discussed.

Classical Analysis and ODEs · Mathematics 2007-10-15 Stephen Semmes

We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…

Computational Geometry · Computer Science 2016-08-12 David Eppstein , Elena Mumford

We construct a series of examples of non--flat non--homogeneous parabolic geometries that carry a symmetry of the parabolic geometry at each point.

Differential Geometry · Mathematics 2016-03-22 Jan Gregorovič , Lenka Zalabová

The visibility graph of a simple polygon represents visibility relations between its vertices. Knowing the correct order of the vertices around the boundary of a polygon and its visibility graph, it is an open problem to locate the vertices…

Computational Geometry · Computer Science 2019-05-03 Sahar Mehrpour , Alireza Zarei

We study the symplectic geometry of the moduli space of closed n-gons with fixed side-lengths in hyperbolic 3-space. We prove that these moduli spaces have a symplectic structure coming from Poisson Lie theory. We construct completely…

Symplectic Geometry · Mathematics 2007-05-23 Michael Kapovich , John J. Millson , Thomas Treloar

We construct a family of heptagon relations -- algebraic imitations of five-dimensional Pachner move 3--4, parameterized by simplicial 3-cocycles.

Geometric Topology · Mathematics 2021-03-30 Igor G. Korepanov